Cookies on this website

We use cookies to ensure that we give you the best experience on our website. If you click 'Accept all cookies' we'll assume that you are happy to receive all cookies and you won't see this message again. If you click 'Reject all non-essential cookies' only necessary cookies providing core functionality such as security, network management, and accessibility will be enabled. Click 'Find out more' for information on how to change your cookie settings.

This paper considers the problem of forming and maintaining tracks when measurements have both uncertain origin and are limited by finite resolution. A new version of the probabilistic data association algorithm is derived which takes account of the effects of sensor resolution. The Integrated Probabilistic Data Association-Finite Resolution (IPDA-FR) algorithm is presented for two situations, first when an accurate stationary clutter map is available and second when no a priori clutter information is available. Both cases result in a set of recursive formulae for data association and probability of track existence, thus enabling automatic track initiation and track maintenance. Simulation results comparing the performance of IPDA-FR with the IPDA and standard PDA algorithm are presented. © 1995.

Original publication

DOI

10.1016/0005-1098(95)98484-N

Type

Journal article

Journal

Automatica

Publication Date

01/01/1995

Volume

31

Pages

559 - 570