Computational Analysis of Dynamic Logic GMTI Tracker

Abstract

The major computational challenge of multi-target tracking in clutter is solving the report-to-track association problem that has non-combinatorial complexity. Dynamic logic (DL) tracker performs data association without combinatorial complexity. The algorithm is designed for multi-target high-clutter scenarios in which combinatorial trackers have impractically high complexity. Thus, DL tracker can operate on GMTI data with low detection thresholds and detect very low signal tracks. This paper presents analysis of numerical performance of the dynamic logic tracker on a representative scenario