A Smoothing Algorithm for Improved Tracking in Clutter and Multitarget Environment

The probabilistic data association filter (PDAF) has been proven to be a very good practical approximation to the otherwise computationally impractical, optimal or nearly optimal algorithms for the problem of tracking targets in cluttered or multi-target environments. In this paper, we develop a smoothing algorithm in the spirit of the PDAF, called the PDAS, in order to incorporate the advantages of smoothing techniques to the tracking problem. Various methods of using the smoothing techniques without undue or excessive increase in the computational method are briefly described.

[1]  Yaakov Bar-Shalom,et al.  Multi-target tracking using joint probabilistic data association , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[2]  K.K. Biswas,et al.  An Approach to Fixed-Point Smoothing Problems , 1972, IEEE Transactions on Aerospace and Electronic Systems.

[3]  Y. Bar-Shalom,et al.  Tracking in a cluttered environment with probabilistic data association , 1975, Autom..

[4]  Yaakov Bar-Shalom,et al.  Adaptive nonlinear filtering for tracking with measurements of uncertain origin , 1972, CDC 1972.

[5]  Yaakov Bar-Shalom,et al.  Sonar tracking of multiple targets using joint probabilistic data association , 1983 .