Abstract

Most tracking algorithms in the literature assume that the targets always generate measurements independently of each other, i.e., the sensor is assumed to have infinite resolution. Such algorithms have been dominant because addressing the presence of merged measurements increases the computational complexity of the tracking problem, and limitations on computing resources often make this infeasible. When merging occurs, these algorithms suffer degraded performance, often due to tracks being terminated too early. In this paper, we use the theory of random finite sets (RFS) to develop a principled Bayesian solution to tracking an unknown and variable number of targets in the presence of merged measurements. We propose two tractable implementations of the resulting filter, with differing computational requirements. The performance of these algorithms is demonstrated by Monte Carlo simulations of a multi-target bearings-only scenario, where measurements become merged due to the effect of finite sensor resolution.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call