Advertisement

An Accelerated IMM JPDA Algorithm for Tracking Multiple Manoeuvring Targets in Clutter

  • Ljudmil V. Bojilov
  • Kiril M. Alexiev
  • Pavlina D. Konstantinova
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2542)

Abstract

Theoretically the most powerful approach for tracking multiple targets is known to be Multiple Hypothesis Tracking (MHT) method. The MHT method, however, leads to combinatorial explosion and computational overload. By using an algorithm for finding the K-best assignments, MHT approach can be considerably optimized in terms of computational load. A much simpler alternative of MHT approach can be the Joint Probabilistic Data Association (JPDA) algorithm combined with Interacting Multiple Models (IMM) approach. Even though it is much simpler, this approach can overwhelm computations as well. To overcome this drawback an algorithm due to Murty and optimized by Miller, Stone and Cox is embedded in IMM-JPDA algorithm for determining a ranked set of K-best hypotheses instead of all feasible hypotheses. The presented algorithm assures continuous maneuver detection and adequate estimation of manoeuvring targets in heavy clutter. This affects in a good target tracking performance with limited computational and memory requirements. The corresponding numerical results are presented.

Keywords

tracking manoeuvring cluttered environment assignment 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bojilov, L., Alexiev, K., Konstantinova, P.,: An Algorithm Unifying IMM and JPDA Approaches. Comptes Randue de l’Academie Bulgare des Sciences (to be published).Google Scholar
  2. 2.
    Murty, K.,: An Algorithm for Ranking All the Assignment in Order of Increasing Cost. Operations Research. 16 (1968) 682–687zbMATHCrossRefGoogle Scholar
  3. 3.
    Miller, M., Stone, H., Cox, I.: Optimizing Murty’s Ranked Assignment Method. IEEE Transactions on AES. 33(1997) 851–862Google Scholar
  4. 4.
    Jonker, R., Volgenant, A.: A shortest Augmenting Path Algorithm for Dens and Sparse Assignment Problems. Computing. 38 (1987) 325–340zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Yaakov Bar-Shalom: Multitarget-Multisensor Tracking: Advanced Applications. Artech House. Norwood. MA. (1990)Google Scholar
  6. 6.
    Blackman, S.: Multiple-Target Tracking with Radar Applications. Artech House. Norwood. MA. (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Ljudmil V. Bojilov
    • 1
  • Kiril M. Alexiev
    • 1
  • Pavlina D. Konstantinova
    • 1
  1. 1.Central Laboratory for Parallel ProcessingBulgarian Academy of SciencesSofiaBulgaria

Personalised recommendations