Comparison of two MDA algorithms for a problem in missile defense

In this paper we compare the performance of two Multidimensional Assignment Algorithms (MDA), the Lagrangean Relaxation based S-D algorithm and the Sequential m-best 2-D algorithm, applied to a realistic problem in missile defense surveillance. The benchmark problem consists of a set of sources that provide "event" (track) estimates of multiple launches, via a number of communication networks to a Fusion Center (FC) which has to perform data association prior to fusion. The network model used "loses" the information tag that distinguishes reports from the same source transmitted through different networks, i.e., the track identity (ID) assigned by the source is not passed on. Only a track ID assigned by the network, and the source ID accompany the track. Thus detection and elimination of track duplications at the FC is needed. The proposed hierarchical approach to the problem requires the solution of several MDA problems before calculating the fused estimate, so accuracy of the solution of each is crucial. Examples with several launches, sources and networks are presented to compare the performance of the two assignment algorithms.

[1]  T. Kirubarajan,et al.  Performance Limits of Track-to-Track Fusion vs . Centralized Estimation : Theory and Application , 2001 .

[2]  M.L. Miller,et al.  Optimizing Murty's ranked assignment method , 1997, IEEE Transactions on Aerospace and Electronic Systems.

[3]  Katta G. Murty,et al.  Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost , 1968, Oper. Res..

[4]  Krishna R. Pattipati,et al.  Dynamically adaptable m-best 2-D assignment algorithm and multilevel parallelization , 1999 .

[5]  Ingemar J. Cox,et al.  On Finding Ranked Assignments With Application to Multi-Target Tracking and Motion Correspondence , 1995 .

[6]  W.D. Blair,et al.  Simulations studies of multisensor track association and fusion methods , 2006, 2006 IEEE Aerospace Conference.

[7]  Thia Kirubarajan,et al.  Estimation with Applications to Tracking and Navigation: Theory, Algorithms and Software , 2001 .

[8]  Aubrey B. Poore,et al.  A New Lagrangian Relaxation Based Algorithm for a Class of Multidimensional Assignment Problems , 1997, Comput. Optim. Appl..

[9]  Krishna R. Pattipati,et al.  Fast data association using multidimensional assignment with clustering , 2001 .

[10]  Yakov Bar-Shalom,et al.  Multitarget-Multisensor Tracking: Principles and Techniques , 1995 .

[11]  Y. Bar-Shalom,et al.  A hierarchical benchmark association problem in missile defense , 2005, SPIE Optics + Photonics.

[12]  Huimin Chen,et al.  Multisensor track-to-track association for tracks with dependent errors , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[13]  Lance M. Kaplan,et al.  Assignment costs for multiple sensor track-to-track association , 2008, IEEE Transactions on Aerospace and Electronic Systems.