检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:谭顺成 陈中华 于洪波 TAN Shun-cheng;CHEN Zhong-hua;YU Hong-bo(Naval Aviation University,Institute of Information Fusion,Shandong Yantai 264001,China;Nanjing Research Institute of Electronics Technology,Jiangsu Nanjing 210039,China)
机构地区:[1]海军航空大学信息融合研究所,山东烟台264001 [2]南京电子技术研究所,江苏南京210039
出 处:《现代防御技术》2021年第4期49-55,63,共8页Modern Defence Technology
基 金:中国博士后科学基金项目(2021M693003);国家自然科学基金项目(61671462,61372027)。
摘 要:针对分布式2D雷达网由于缺乏高度信息而不能对空中目标进行航迹关联的问题,研究了一种2D与2D雷达航迹关联算法。首先,利用雷达和目标之间的几何特性将来自两异地雷达的航迹有效地统一起来,建立航迹关联函数;然后,对关联函数进行一阶泰勒展开,得到关联函数与雷达量测噪声的线性关系,并根据雷达量测噪声的置信区间得到关联门限;最后,在航迹粗关联的基础上建立基于历史信息的关联代价矩阵,利用匈牙利算法对代价矩阵进行航迹最优分配,实现航迹精关联。仿真结果表明,该方法能够有效解决分布式2D雷达网对空中目标的航迹关联问题,具有一定的实际应用价值。Due to the lack of altitude information,aircraft targets can not be made track association by the distributed 2D radar network.A novel track association algorithm for 2D and 2D radar is proposed.The tracks coming from two radars belong to different places are united based on geometrical features of radars and target,and association function is created.The linear relationship between association function and radar measurement noise is built with the first-order of Taylor expansion of the association function,and the association threshold is obtained according to the confidence interval of measurement noise.The association cost matrix based on historical information is established after rough track association,and precise track association is realized through optimal assignment with Hungary algorithm.Simulation results demonstrate that the proposed method can solve the track association in distributed 2D radar network effectively,and be of certain practical application value.
关 键 词:航迹关联 2D雷达网 最优分配 关联代价矩阵 匈牙利算法
分 类 号:TN953[电子电信—信号与信息处理] TN957[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229