Multidimensional Assignment Problems Arising in Multitarget and Multisensor Tracking

  • Aubrey B. Poore
Part of the Combinatorial Optimization book series (COOP, volume 7)


The ever-increasing demand in surveillance is to produce highly accurate target and track identification and estimation in real-time, even for dense target scenarios and in regions of high track contention. The use of multiple sensors, through more varied information, has the potential to greatly enhance target identification and state estimation. For multitarget tracking, the processing of multiple scans all at once yields high track identification. However, to achieve this accurate state estimation and track identification, one must solve an NP-hard data association problem of partitioning observations into tracks and false alarms in real-time. Over the last ten years a new approach to the problem formulation based on multidimensional assignment problems and near optimal solution in real-time by Lagrangian relaxation has evolved and is proving to be superior to all other approaches. This work reviews the problem formulation and algorithms with some suggested future directions.


Assignment Problem Lagrangian Relaxation Data Association Tracking Problem Multi Target Tracking 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bar-Shalom and Li, 1995]
    Bar-Shalom, Y. and Li, X. R., editors (1995). Multitarget-Multisensor Tracking: Principles and Techniques. OPAMP Tech. Books, Los Angeles.Google Scholar
  2. [Barker et al., 1995]
    Barker, T. N., Persichetti, J. A., Poore, Jr., A. B., and Rijavec, N. (1995). Method and system for tracking multiple regional objects. US Patent Number 5,406,289.Google Scholar
  3. [Bertsekas, 1998]
    Bertsekas, D. P. (1998). Network Optimization. Athena Scientific, Belmont, MA.zbMATHGoogle Scholar
  4. [Blackman and Popoli, 1999]
    Blackman, S. and Popoli, R. (1999). Design and Analysis of Modern Tracking Systems. Artech House, Norwood, MA.zbMATHGoogle Scholar
  5. [Chummun et al., 1999]
    Chummun, M., Kirubarajan, T., Pattipati, K., and Bar-Shalom, Y. (1999). Efficient multidimensional data association for multisensor-multitarget tracking using clustering and assignment algorithms. In Proc. 2nd International Conference on Information Fusion, Silicon Valley, CA.Google Scholar
  6. [Deb et al., 1993]
    Deb, S., Pattipati, K. R., and Bar-Shalom, Y. (1993). A. multisensor-multitarget data association algorithm for heterogeneous systems. IEEE Transactions on Aerospace and Electronic Systems, 29:560–568.CrossRefGoogle Scholar
  7. [Deb et al., 1997]
    Deb, S., Pattipati, K. R., Bar-Shalom, Y., and Yeddanapudi, M. (1997). A generalized s-dimensional assignment algorithm for multisensor multitarget state estimation. IEEE Transactions on Aerospace and Electronic Systems, 33:523–538.CrossRefGoogle Scholar
  8. [Drummond, 1999]
    Drummond, O. (1999). Target tracking. In Wiley Encyclopedia of Electrical and Electronics Engineering, Vol. 21, pages 377–391. Wiley.Google Scholar
  9. [Garvey and Johnson, 1979]
    Garvey, M. and Johnson, D. (1979). Computers and Intractability: A guide to the theory ofNP-Completeness. W.H. Freeman & Co., CA.Google Scholar
  10. [Jonker and Volgenant, 1987]
    Jonker, R. and Volgenant, A. (1987). A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing, 38:325–340.MathSciNetzbMATHCrossRefGoogle Scholar
  11. [Kirubarajan et al., 1997]
    Kirubarajan, T., Bar-Shalom, Y., and Pattipati, K. R. (1997). Multiassignment for tracking a large number of overlapping objects. In Proceedings SPIE Conf. Signal & Data Proc. of small Targets, VOL. 3136, San Diego, CA.Google Scholar
  12. [Kirubarajan et al., 1998]
    Kirubarajan, T., Wang, H., Bar-Shalom, Y., and Pattipati, K. (1998). Efficient multisensor fusion using multidimensional assignment for multitarget tracking. In Proceedings SPIE Conf. Signal Processing, Sensor Fusion and Target Recognition, Orlando, FL.Google Scholar
  13. [Kiwiel, 1985]
    Kiwiel, K. C. (1985). Methods of descent for nondifferentiable optimization. Lecture Notes in Mathematics 1133. Springer-Verlag, Berlin.Google Scholar
  14. [Morefield, 1977]
    Morefield, C. L. (1977). Application of 0–1 integer programming to multitarget tracking problems. IEEE Transactions on Automatic Control, 22(3):302–312.MathSciNetzbMATHCrossRefGoogle Scholar
  15. [Murphey et al., 1998a]
    Murphey, R., Pardalos, P., and Pitsoulis, L. (1998a). A GRASP for the multi-target multi-sensor tracking problem. In Networks, Discrete Mathematics and Theoretical Computer Science Series, volume 40, pages 277–302. American Mathematical Society.MathSciNetGoogle Scholar
  16. [Murphey et al., 1998b]
    Murphey, R., Pardalos, P., and Pitsoulis, L. (1998b). A parallel GRASP for the data association multidimensional assignment problem. In Parallel Processing of Discrete Problems, IMA Volumes in Mathematics and its Applications, volume 106, pages 159–180. SpringerVerlag.MathSciNetCrossRefGoogle Scholar
  17. [Nemhauser and Wolsey, 1988]
    Nemhauser, G. L. and Wolsey, L. A. (1988). Integer and Combinatorial Optimization. John Wiley and Sons, New York.zbMATHGoogle Scholar
  18. [Poore, 1994]
    Poore, A. B. (1994). Multidimensional assignment formulation of data association problems arising from multitarget tracking and multisensor data fusion. Computational Optimization and Applications, 3:27–57.MathSciNetzbMATHCrossRefGoogle Scholar
  19. [Poore and A.J. Robertson, 1997]
    Poore, A. B. and A.J. Robertson, I. (1997). A new class of lagrangian relaxation based algorithms for a class of multidimensional assignment problems. Computational Optimization and Applications, 8(2): 129–150.MathSciNetzbMATHCrossRefGoogle Scholar
  20. [Poore and Drummond, 1997]
    Poore, A. B. and Drummond, O. E. (1997). Track initiation and maintenance using multidimensional assignment problems. In Pardalos, P. M., Hearn, D., and Hager, W., editors, Network Optimization, volume 450 of Lecture Notes in Economics and Mathematical Systems, pages 407–422. Springer-Verlag.Google Scholar
  21. [Poore and Rijavec, 1991a]
    Poore, A. B. and Rijavec, N. (1991a). Multidimensional assignment problems, and lagrangian relaxation. In Proceedings of the SDI Panels on Tracking, volume Issue No. 2, pages 3–51 to 3–74, Institute for Defense Analyses.Google Scholar
  22. [Poore and Rijavec, 1991b]
    Poore, A. B. and Rijavec, N. (1991b). Multitarget tracking and multidimensional assignment problems. In Proceedings of the 1991 SPIE Conference on Signal and Data Processing of Small Targets 1991, volume 1481, pages 345–356.Google Scholar
  23. [Poore and Rijavec, 1993]
    Poore, A. B. and Rijavec, N. (1993). A Lagrangian relaxation algorithm for multi-dimensional assignment problems arising from multitarget tracking. SIAM Journal on Optimization, 3(3):545–563.MathSciNetCrossRefGoogle Scholar
  24. [Poore and Rijavec, 1994]
    Poore, A. B. and Rijavec, N. (1994). A numerical study of some data association problems arising in multitarget tracking. In Hager, W. W., Hearn, D. W., and Pardalos, P. M., editors, Large Scale Optimization: State of the Art, pages 339–361, Boston, MA. Kluwer Academic Publishers B. V.CrossRefGoogle Scholar
  25. [Poore et al., 1992]
    Poore, A. B., Rijavec, N., and Barker, T. (1992). Data association for track initiation and extension using multiscan windows. In Signal and Data Processing of Small Targets 1992, Proc. SPIE 1698, 1992, volume 1698, pages 432–441.Google Scholar
  26. [Poore et al., 1993]
    Poore, A. B., Rijavec, N., Barker, T., and Munger, M. (1993). Data association problems posed as multidimensional assignment problems: numerical simulations. In Drummond, O. E., editor, Signal and Data Processing of Small Targets 1954, pages 564–573. Proceedings of the SPIE.CrossRefGoogle Scholar
  27. [Poore and Yan, 1999]
    Poore, A. B. and Yan, X. (1999). Some algorithmic improvements in multi-frame most probable hypothesis tracking. In Drummond, O., editor, Signal and Data Processing of Small Targets, SPIE.Google Scholar
  28. [Poore, 1996]
    Poore, Jr., A. B. (1996). Method and system for tracking multiple regional objects by multi—dimensional relaxation. US Patent Number 5,537,119.Google Scholar
  29. [Poore, 1999]
    Poore, Jr., A. B. (issue on September 28, 1999). Method and system for tracking multiple regional objects by multi—dimensional relaxation, cip.US patent number 5,959,574.Google Scholar
  30. [Popp et al., 1998]
    Popp, R., Pattipati, K., Bar-Shalom, Y., and Gassner, R. (1998). An adaptive m-best SD assignment algorithm and parallelization for multitarget tracking. In Proceedings 1998 IEEE Aerospace Conference, Snowmass, CO.Google Scholar
  31. [Reid, 1996]
    Reid, D. B. (1996). An algorithm for tracking multiple targets. IEEE Transactions on Automatic Control, 24(6):843–854.CrossRefGoogle Scholar
  32. [Robertson, 2000]
    Robertson, A. (2000). A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem.Google Scholar
  33. [Schramm and Zowe, 1992]
    Schramm, H. and Zowe, J. (1992). A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results. SIAM Journal on Optimization, 2:121–152.MathSciNetzbMATHCrossRefGoogle Scholar
  34. [Shea and Poore, 1998]
    Shea, P. J. and Poore, A. B. (1998). Computational experiences with hot starts for a moving window implementation of track maintenance. In 1998 SPIE Conference Proceedings 3373, Signal and Data Processing of Small Targets 1998, Orlando, FL.Google Scholar
  35. [Shor, 1985]
    Shor, N. Z. (1985). Minimization Methods forNon-Difjerentiable Functions. Springer-Verlag, New York.CrossRefGoogle Scholar
  36. [Sittler, 1964]
    Sittler, R. W. (1964). An optimal data association problem in surveillance theory. IEEE Transactions on Military Electronics, 8(2):125–139.CrossRefGoogle Scholar
  37. [Waltz and Llinas, 1990]
    Waltz, E. and Llinas, J. (1990). Multisensor Data Fusion. Artech House, Boston, MA.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2000

Authors and Affiliations

  • Aubrey B. Poore
    • 1
  1. 1.Department of MathematicsColorado State UniversityFort CollinsUSA

Personalised recommendations