01680nas a2200205   4500000000100000000000100001008004100002260000900043653001500052653002600067653003300093653001300126100002000139700001800159700002600177245009100203300001200294490000600306520116200312       2002                            d  c200210aassignment10acluttered environment10amultiple maneuvering targets10aTracking1 aLjudmil Bojilov1 aKiril Alexiev1 aPavlina Konstantinova00aAn Accelerated IMM-JPDA Algorithm for Tracking Multiple Maneuvering Targets in Clutter  a141-1530 v93 a<p>Theoretically, the Multiple Hypothesis Tracking (MHT) method is the most powerful approach for tracking multiple targets. The MHT method, however, leads to combinatorial explosion and computational overload. By using an algorithm for finding the K-best assignments, the MHT approach can be considerably optimized in terms of computational load. A much simpler alternative of the MHT approach is provided by the Joint Probabilistic Data Association (JPDA) algorithm in combination with the Interacting Multiple Models (IMM) approach. Even though it is much more simple, this approach can also be computationally overwhelming. To overcome this drawback, an algorithm due to Murty and optimized by Miller, Stone and Cox is embedded in the IMM-JPDA algorithm in order to determine a ranked set of K-best hypotheses (instead of all feasible hypotheses). The presented algorithm assures continuous maneuver detection and adequate estimation of maneuvering targets in heavy clutter. This results in a good overall target tracking performance with moderate computational and memory requirements. The article further presents corresponding simulation results.</p>