Integrated probabilistic data association (IPDA)

A version of the probabilistic data association (PDA) algorithm that is called integrated probabilistic data association (IPDA) is presented. Rather than deriving algorithms based on an assumption of track existence, IPDA starts from expressions which treat track existence as an event with an associated probability. This approach leads to a set of recursive formulae for both data association and probability of track existence or track quality. This is useful in the track initiation phase (to confirm a tentative track) and in track termination (to terminate a false track). The IPDA algorithm is compared with both the probabilistic data association algorithm (PDA) and the interactive multiple model (IMM) PDA algorithm.<
>