基于动态规划的多目标GMTI-TBD技术研究

发布时间：2018-02-24 00:41

本文关键词： 多目标动态规划状态预测值函数计算复杂度　出处：《仪器仪表学报》2016年02期 　论文类型：期刊论文

【摘要】：针对多目标跟踪出现的邻近目标难分辨及计算量大的问题,目前大多数检测跟踪算法在算法性能和计算复杂度之间权衡,不能同时兼顾这两项指标。本文提出了一种基于动态规划的多目标(GMTI-TBD)方法,该算法根据雷达实际检测目标时出现的距离向和方位向展宽,限定目标能量扩展区域,得到新的值函数;在此基础上,通过对目标状态的预测去除多目标的相互干扰。另一方面,利用单次动态规划估计目标所在区域,使轨迹搜索范围大大减小,有效解决了多目标带来的高维计算量问题。仿真结果表明本文算法在检测跟踪性能上优于经典的多目标DP-TBD算法,同时所需计算时间较少。
[Abstract]:In order to solve the problem of difficult resolution of adjacent targets and large amount of computation in multi-target tracking, most of the detection and tracking algorithms balance the performance and computational complexity of the detection and tracking algorithms. In this paper, a multi-target GMTI-TBD-based method based on dynamic programming is proposed. The algorithm is based on the range and azimuth direction of radar detection, and limits the energy expansion region of the target. A new value function is obtained, and on the basis of this, the mutual interference of multiple targets is eliminated by predicting the target state. On the other hand, the region of the target is estimated by single dynamic programming, and the range of trajectory search is greatly reduced. The simulation results show that the proposed algorithm is superior to the classical multi-objective DP-TBD algorithm in detection and tracking performance and requires less computation time.
【作者单位】：西安空间无线电技术研究所;中国民用航空西北地区空中交通管理局;
【基金】：国家自然科学基金(61101127)项目资助
【分类号】：TP391.41

【相似文献】