In situations with a significant number of targets in mutual proximity (close to each other), optimal multitarget data association approach suffers from the numerical explosion. This severely limits the applicability; i.e. the number of close targets that may be reliably tracked. We propose an iterative implementation of Joint Integrated Probabilistic Data Association (JIPDA) which allows a performance/computation resources trade off. This approach can also be incorporated into Joint Integrated Track Splitting (JITS). The iterations start with the single target Integrated Probabilistic Data Association (IPDA) and each subsequent iteration improves the approximation towards JIPDA, reaching the optimal multitarget solution within a finite number of iterations.
Taek Lyul Song