Research On Reconnaissance Radar Target Tracking Technolog

Surveillance radar can accomplish the monitoring of moving targets such as personnel and vehicles.It also has the characteristics of fast target detection,high measurement accuracy and all-weather work.It has been widely used in the field of military and civilian monitoring.However,surveillance radar often faces environments with a large number of targets and high clutter density.In this application scenario,radar tracking algorithm has some problems,such as slow target track initiation,large number of false tracks,high data association error rate,divergent tracking filter and low operation efficiency of the algorithm which even difficult to meet the real-time requirements of the system.In response to these problems,this paper has conducted in-depth research on track initiation and data association technology in multi-target tracking processing of surveillance radar.The main work is as follows:(1)A grid density clustering algorithm for radar multi-target tracking is proposed.Due to the continuity of target motion and the randomness of clutter distribution,by recording the radar measurement data at multiple consecutive times,the possible targets and some discrete clutter can be distinguished according to the measured density characteristics,so as to simplify the subsequent multi-target tracking processing.Simulation results show that the algorithm can quickly and effectively cluster arbitrary shape data sets,and can effectively identify the discrete "clutter" data in the data sets.(2)Aiming at the problems of slow track initiation and many false tracks in the high-density clutter environment of traditional track initiation algorithms,a modified logic track initiation algorithm based on sliding window grid density clustering is proposed.The algorithm avoids the interference of measurement points in different clusters,greatly reduces the number of echo points that the track initiation algorithm needs to make correlation judgments at each time,reduces the false track initiation probability,reduces the amount of algorithm calculation,and can significantly improve the operation efficiency of the algorithm.The effectiveness of the algorithm is verified by simulation experiments.(3)The steps of constructing joint events in JPDA algorithm are improved,and a recursive splitting algorithm of confirmation matrix is proposed.The algorithm can quickly and accurately split the confirmation matrix of any dimension to obtain each interconnection matrix.It also has the advantages of reducing memory requirements and easy computer implementation.On this basis,aiming at the problems of large amount of computation and poor real-time performance of the traditional JPDA algorithm in the environment of large number of targets and high clutter density,a fast JPDA algorithm based on sliding window grid density clustering is proposed.Simulation results show that the proposed new algorithm hardly affects the tracking performance of JPDA algorithm,and can effectively reduce the amount of calculation and improve the operation efficiency of the algorithm.Finally,a multi-target tracking processing scheme based on sliding window grid density clustering is proposed,and the effectiveness of this scheme is verified by experiments.