Rauch-Tung-Striebel Smoothing Linear Multi-Target Tracking in Clutter

Abstract

Most conventional data association based multi-target tracking (MTT) algorithms typically suffer from intractable computational complexities and could not perform in an environment where large number of closely spaced multiple targets move across each other in clutters. Unlike to the existing MTT systems, the linear multi-target (LM) algorithm modifies the measurement detection followed by neighbored tracks as a clutter, hence, it updates the track without the influence of other tracks. Thus, LM technique is a computationally efficient algorithm that allows the multi-target system to play like a single target tracking algorithm. Smoothing maximizes the state estimation accuracy and reduces estimation error based on future scan measurement. However, only few research paper focused on the LM algorithm without utilizing the benefits of the smoothing. This paper presents Rauch-Tung-Striebel Smoothing in the linear multi-target based on integrated probabilistic data association (RTS-LMIPDA). The RTS-LMIPDA algorithm fuses forward and backward LM track predictions to obtain the smoothing prediction which is required to calculate the smoothing multi-target state estimates in the forward track. Numerical analysis is presented to illustrate the estimation accuracy and false track discrimination (FTD) performances of RTS-LMIPDA in comparison to the existing MTT algorithms using the simulations.

Keywords

• Data association
• estimation
• false-track discrimination (FTD)
• linear multi-target tracking
• smoothing
• target existence probability (TEP)