Multiscan association as a single-commodity flow optimization problem

Multiscan data association can significantly enhance tracking performance in critical radar surveillance scenarios involving multiple targets, low detection probability, high false alarm probability, evasive target maneuvers and finite radar resolution. Unfortunately, however, this approach is affected by the curse of dimensionality which hinders its real-time application for tracking problems with short scan periods and/or long association windows and/or many measurements. In this paper it is shown how the formulation of the multiscan association as a single commodity flow optimization problem allows a relaxation of the association problem which, on one hand, guarantees close-to-optimal association performance and, on the other hand, implies a significant reduction of the computational load.