Systems Engineering and Electronics ›› 2022, Vol. 44 ›› Issue (11): 3515-3521.doi: 10.12305/j.issn.1001-506X.2022.11.27

• Guidance, Navigation and Control • Previous Articles     Next Articles

Asynchronous track-to-track association algorithm based on k means distance of nearest neighbors

Xiao YI1, Rui ZENG1,2,*   

  1. 1. Naval Aviation University, Yantai 264001, China
    2. Unit 92325 of the PLA, Datong 037001, China
  • Received:2021-01-26 Online:2022-10-26 Published:2022-10-29
  • Contact: Rui ZENG

Abstract:

Aiming at the complex problem of local node track-to-track association under asynchronous and unequal rates, an asynchronous track-to-track direct association algorithm based on the k means distance of the nearest neighbors is proposed. First, the k means distance calculation rule of the nearest neighbor between different track sequences is given. Then the gray relational degree among different track sequences are calculated, the classical allocation method is used to determine the track-to-track association. The algorithm does not need time domain registration, and it avoids the accumulation of estimation error propagation. The simulation data show that the algorithm has high correct correlation rate and low time consumption. Asynchronous factors such as inconsistency of sampling period and startup time of local nodes have no obvious influence on the algorithm, and the algorithm is not affected by the change of noise distribution form and targets number.

Key words: track-to-track association, asynchronous track, k means distance of nearest neighbors, grey relational degree, multidimensional allocation

CLC Number: 

[an error occurred while processing this directive]