The interacting multiple model (IMM) estimator has been shown to be very effective when applied to air traffic surveillance problem. However, because of the additional filter modules necessary to cover the possible target maneuvers, the IMM estimator also imposes an increasing computational burden. Hence, in an effort to design a real-time multiple model multitarget tracking algorithm that is independent of the number of modules used in the state estimator, we propose a "coarse-grained" (dynamic) parallelization that is superior, in terms of computational performance, to a "fine-grained" (static) parallelization of the state estimator, while not sacrificing tracking accuracy. In addition to having the potential of realizing superlinear speedups, the proposed parallelization scales to larger multiprocessor system and is robust, i.e., it adapts to diverse multitarget scenarios maintaining the same level of efficiency given any one of numerous factors influencing the problem size. We develop and demonstrate the dynamic parallelization on a shared-memory MIMD multiprocessor for a civilian air traffic surveillance problem using a measurement database based on two FAA air traffic control radars.
Parallelization of a multiple model multitarget tracking algorithm with superlinear speedups
IEEE Transactions on Aerospace and Electronic Systems ; 33 , 1 ; 281-290
1997-01-01
1044095 byte
Article (Journal)
Electronic Resource
English
Parallelization of a Multiple Model Multitarget Tracking Algorithm with Superlinear Speedups
Online Contents | 1997
|An Adaptive m-best SD Assignment Algorithm for Parallelization for Multitarget Tracking
British Library Conference Proceedings | 1998
|Evaluating a Multiple-Hypothesis Multitarget Tracking Algorithm
Online Contents | 1994
|Shared-memory parallelization of the data association problem in multitarget tracking
Tema Archive | 1997
|