A New Relaxation Algorithm and Passive Sensor Data Association

IEEE Transactions on Automatic Control

Volumn 37, Issue 2, 1992, Pages 198-213

  Pattipati, Krishna R ^a   Deb, Somnath ^a   Bar Shalom, Yaakov ^a   Washburn, Robert B ^b  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b BAE SYSTEMS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--ALGORITHMS; SIGNAL DETECTION;

MEASUREMENT-TARGET ASSOCIATION PROBLEM;

OPTIMIZATION;

EID: 0026821150     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/9.121621     Document Type: Article

References (56)

1. R. A. Singer, R. G. Sea, and R. B. Housewright, “Deviation and Evaluation of improved tracking filters for use in dense multitarget environments,” IEEE Trans. Informat. Theory, vol. IT-20, pp. 423–432, July 1974.
2. D. L. Alspach, “A Gaussian sum approach to the multi-target identification-tracking problem,” Automatica, vol. 11, pp. 285–296, May 1975.
3. Y. Bar-Shalom and E. Tse, “Tracking in a cluttered environment with probabilistic data association,” Automatica, vol. 11, pp. 451–460, Sept. 1975.
4. C. L. Morefield, “Application of 0-1 integer programming to multi-target tracking problems,” IEEE Trans. Automat. Contr., vol. AC-22, pp. 302–312, June 1977.
5. Y. Bar-Shalom, “Tracking methods in a multitarget environment,” IEEE Trans. Automat. Contr., vol. AC-23, pp. 618–626, Aug. 1978.
6. D. B. Reid, “An algorithm for tracking multiple targets,” IEEE Trans. Automat. Contr., vol. AC-24, no. 6, pp. 423–432, Dec. 1979.
7. T. E. Fortmann, Y. Bar-Shalom, and M. Scheffe, “Multitarget tracking using joint probabilistic data association,” IEEE J. Ocean. Eng., vol. OE-8, pp. 173–184, July 1983.
8. C. B. Chang and L. C. Youens, “Measurement correlation for multiple sensor tracking in a dense target environment,” IEEE Trans. Automat. Contr., vol. AC-27, no. 6, pp. 1250–1252, Dec. 1982.
9. T. Kurien and R. B. Washburn, “Multiobject tracking using passive sensors,” in Proc. 1985 Amer. Contr. Conf., Boston, MA, June 1985, pp. 1032-1038.
10. S. S. Blackman, Multi-target Tracking with Radar Applications. Dedham, MA: Artech, 1986.
11. S. Mori, C. Y. Chong, E. Tse, and R. P. Wishner, “Tracking and classifying multiple targets without a priori identification,” IEEE Trans. Automat. Contr., vol. AC-31, pp. 401–409, May 1986.
12. R. B. Washburn, “A random point process approach to multiobject tracking,” in Proc. Amer. Contr. Conf., June 1987.
13. E. Lawler, Combinatorial Optimization, Networks and Matroids. New York: Holt, Reinhart, and Winston, 1976.
14. H. W. Kuhn, “The Hungarian method for the assignment problem,” Naval Res. Logist. Quart., vol. 3, pp. 253–258, 1955.
15. D. P. Bertsekas, “The auction algorithm: A distributed relaxation method for the assignment problem,” Annals of Operat. Res., vol. 14, pp. 105–123, 1988.
16. M. L. Balinski, “Signature methods for the assignment problem,” Operat. Res., vol 33, no. 3, pp. 527–536, May-June 1985.
17. D. Goldfarb, “Efficient dual simplex algorithm for the assignment problem,” Math. Programming, vol. 33, pp. 187–203, 1985.
18. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
19. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
20. N. G. Shor, “Utilization of the space dilation in the minimization of convex functions,” Kibernetica ‘Kiev’, 1970.
21. D. P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods. New York: Academic, 1982.
22. J. E. Dennis, Jr. and R. B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Englewood Cliffs, NJ: Prentice-Hall, 1983.
23. Y. Bar-Shalom and T. E. Fortmann, Tracking and Data Association. New York: Academic, 1988.
24. S. A. Cook, “The complexity of theorem-proving procedures,” in Proc. 3rd Annual ACM Symp. Theory of Computing, New York, 1971, pp. 151-158.
25. R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. New York: Plenum, pp. 85–103.
26. E. L. Lawler and D. E. Wood, “Branch-and-bound methods: A survey,” Operat. Res., vol. 14, pp. 699–719, 1966.
27. E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms. Rockville, MD: Computer Science, 1978.
28. N. J. Nilsson, Principles of Artificial Intelligence. Palo Alto, CA: Tioga, 1980.
29. J. Pearl, Heuristics. Reading, MA: Addison-Wesley, 1984.
30. N. R. Sandell, Jr., D. P. Bertsekas, J. J. Shaw, S. W. Gully, and R. F. Gendron, “Optimal scheduling of large-scale hydrothermal power systems,” in Proc. 1982 IEEE Int. Large-Scale Syst. Symp., Virginia Beach, VA, Oct. 1982, pp. 141-147.
31. K. R. Pattipati, J. J. Shaw, and M. P. Kastner, “A hierarchical model for the design of large maintenance facilities,” presented at the IEEE Conf. Syst. Man, and Cybern., New Delhi, India, Jan. 1984, pp. 560–568.
32. D. P. Bertsekas, “A unified framework for primal-dual methods in minimum cost network flow problems,” Math Programming, vol. 32, pp. 125–145, 1985.
33. K. R. Pattipati, S. Deb, and R. B. Washburn, “A comparison of assignment algorithms for the passive sensor correlation problem,” presented at the Int. Conf. Contr. Theory Appl., Jerusalem, Israel, 1989.
34. M. L. Fisher, “Optimal solution of scheduling problems using Lagrange multipliers,” Rep. 7210, Center for Mathematical Studies in Business and Economics, Univ. Chicago, Chicago, IL, 1972.
35. D. G. Luenberger, Linear and Nonlinear Programming. Reading, MA: Addison-Wesley, 1984.
36. D. P. Bertsekas, Personal Communication to K. R. Pattipati, 1983.
37. B. T. Poljak, “Subgradient method: A survey of Soviet research,” in Nonsmooth Minimization, C. Lemarechal and R. Mifflin, Eds. London, U.K.: Pergammon, 1978.
38. P. R. Williams, “Multi target estimation using multiple bearing-only sensors,” in Proc. 9th MIT/ONR Workshop on C3 Systems, Monterey, CA, June 1986, pp. 65-68.
39. H. A. Heidary, “Deghosting in passive multi-sensor systems,” in Multitarget-multisensor Tracking: Advanced Applications, Y. Bar-Shalom, Coordinator, UCLA Extension short course, Jan. 1988.
40. D. P. Bertsekas and D. A. Castanon, “The Auction algorithm for the transportation problem,” Annals Operat. Res., vol. 20, pp. 67–96, 1989.
41. J. F. Pierce, “Application of combinatorial programming to a class of all-zero-one integer programming problems,” Management Sci., vol. 15, no. 3, pp. 191–209, Nov. 1968.
42. J. F. Pierce and J. S. Lasky, “Improved combinatorial programming algorithms for a class of all-zero-one integer programming problems,” Management Sci., vol. 19, no. 5, pp. 528–543, Jan. 1973.
43. D. P. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation. Englewood Cliffs, NJ: Prentice-Hall, 1989.
44. S. Deb, K. R. Pattipati, Y. Bar-Shalom, and R. B. Washburn, “Assignment algorithms for the passive sensor data association problem,” in Proc. SPIE Conf, Orlando, FL, Mar. 1989, pp. 231–243.
45. K. R. Pattipati, S. Deb, Y. Bar-Shalom, and R. B. Washburn, “A relaxation algorithm for the passive sensor data association problem,” presented at the Amer. Contr. Conf., Pittsburgh, PA, June 1989.
46. S. Deb, K. R. Pattipati, and Y. Bar-Shalom, “PASSDAT: Passive sensor data association for tracking—A PC software,” in Proc. SPIE Conf, Orlando, FL, Apr. 1990.
47. S. Deb, R. Mallubhatla, K. R. Pattipati, and Y. Bar-Shalom, “A multisensor multitarget data association algorithm for tracking,” presented at the IEEE Int. Conf. System. Eng., Pittsburgh, PA, Aug. 1990.
48. D. P. Bertsekas and D. A. Castanon, “Parallel synchronous and asynchronous implementations of the Auction algorithm,” Rep. TP-308, Alphatech, Inc., Burlington, MA, Nov. 1989; Also in Parallel Computing ‘to be published’.
49. K. R. Pattipati, S. Deb, Y. Bar-Shalom, and R. B. Washburn, “Passive sensor data association using a new relaxation algorithm,” Multitarget-Multisensor Tracking: Advances and Applications, Y. Bar-Shalon, Ed. Norwood, MA: Artech, 1990.
50. Personal communication with Lisa Petra, Boeing Aircraft Co., Seattle, WA, 1990.
51. T. G. Allen, L. B. Feinberg, R. O. LaMaire, K. R. Pattipati, H. Tsaknakis, R. B. Washburn, “Multiple information set tracking correlator ‘MISTC’,” Final rep. TR-406, Alphatech, Inc., Burlington, MA, Sept. 1988.
52. K. G. Gilbert and R. B. Hofstra, “Multidimensional assignment problems,” Decision Sci., vol. 19, pp. 306–321, 1988.
53. W. P. Pierskalla, “The multidimensional assignment problem,” Operat. Res., vol. 16, pp. 422–431, 1968.
54. D. B. Fogel, “Addressing the traveling salesman problem through evolutionary adaptation,” Biological Cybernetics, vol. 60, pp. 139–144, 1988.
55. G. H. Sasaki and B. Hajek, “The time complexity of maximum matching by simulated annealing,” JACM, vol. 35, no. 2, pp. 387–403, 1988.
56. E. Balas and M. J. Saltzman, “An algorithm for the three-index assignment problem,” Operat. Res., vol. 39, no. 1, pp. 150–161, Jan.-Feb. 1991.