Combinatorial problems in multitarget tracking  A comprehensive solution
Abstract
The paper presents a new solution to the combinatorial problems that arise when multiple targets are to be tracked simultaneously. In multitarget situations, the correspondence between targets and observations may be lost because of crossing trajectories, closeby targets, false alarms, missed detections, etc. The number of data association hypotheses that are feasible and for which probabilities have to be calculated is extremely large in any but the smallest of such problems. A new algorithm for locating the N globally best hypotheses using a simple search method instead of extensive enumeration or integer programming methods is presented.
 Publication:

IEE Proceedings F: Communications Radar and Signal Processing
 Pub Date:
 February 1987
 Bibcode:
 1987IPCRS.134..113N
 Keywords:

 Combinatorial Analysis;
 Radar Tracking;
 Tracking Problem;
 Algorithms;
 Maximum Likelihood Estimates;
 Probability Theory;
 Radar Targets;
 Communications and Radar