SAS-KNN-DPC: A Novel Algorithm for Multi-Sensor Multi-Target Track Association Using Clustering

The track-to-track association (T2TA) problem is a fundamental and critical challenge in information fusion, situational awareness, and target tracking. Existing algorithms based on statistical mathematics, fuzzy mathematics, gray theory, and artificial intelligence suffer from several limitations that are hard to solve, such as over-idealized models, unrealistic assumptions, insufficient real-time performance, and high computational complexity due to pairwise matching requirements. Considering these limitations, we propose a self-adaptive step-2-based K-nearest neighbor density peak clustering (SAS-KNN-DPC) algorithm to address T2TA problem. Firstly, the step-2 temporal neighborhood affinity matrix under a non-registration framework is defined and the calculation methods for multi-feature track-point fusion similarity matrix are given. Secondly, the proposed self-adaptive multi-feature similarity truncation matrix is defined to measure the multidimensional distance between track points and the self-adaptive step-2 truncation distance is also defined to enhance the adaptivity of the algorithm. Finally, we propose improved definitions of local distance and global relative distance to complete both cluster center selection and association assignment. The proposed algorithm eliminates the need for exhaustive pairwise matching between track sequences and avoids time alignment, significantly improving the real-time performance of T2TA. Simulation results demonstrate that compared to other algorithms, the proposed algorithm achieves higher accuracy, reduced computational time, and better real-time performance in complex scenarios.