Under the scenario of dense targets in clutter, a multi-layer optimal data correlation algorithm is proposed. This algorithm eliminates a large number of false location points from the assignment process by rough corr...Under the scenario of dense targets in clutter, a multi-layer optimal data correlation algorithm is proposed. This algorithm eliminates a large number of false location points from the assignment process by rough correlations before we calculate the correlation cost, so it avoids the operations for the target state estimate and the calculation of the correlation cost for the false correlation sets. In the meantime, with the elimination of these points in the rough correlation, the disturbance from the false correlations in the assignment process is decreased, so the data correlation accuracy is improved correspondingly. Complexity analyses of the new multi-layer optimal algorithm and the traditional optimal assignment algorithm are given. Simulation results show that the new algorithm is feasible and effective.展开更多
多层Morphin算法扩展了对未知环境的预测范围,克服了传统Morphin算法搜索轨迹不灵活的缺点,但每个搜索节点生成的搜索弧数目固定,搜索和评估所花费的时间随着搜索层数的增多呈指数阶增加。针对该问题,提出了一种可变搜索弧Morphin算法(v...多层Morphin算法扩展了对未知环境的预测范围,克服了传统Morphin算法搜索轨迹不灵活的缺点,但每个搜索节点生成的搜索弧数目固定,搜索和评估所花费的时间随着搜索层数的增多呈指数阶增加。针对该问题,提出了一种可变搜索弧Morphin算法(variable search arc of Morphin,VSA-Morphin)。调整每层搜索节点生成的搜索弧数目,使之不再固定,而是随着层数增加而减少,从而缩短搜索和评估时间。利用MATLAB仿真测试表明,多层VSA-Morphin算法与多层Morphin算法所规划的路径基本一致,但运行时间却相对更少,从而验证了多层VSA-Morphin算法的有效性和正确性。展开更多
基金This project was supported by the National Natural Science Foundation of China (60672139, 60672140)the Excellent Ph.D. Paper Author Foundation of China (200237)the Natural Science Foundation of Shandong (2005ZX01).
文摘Under the scenario of dense targets in clutter, a multi-layer optimal data correlation algorithm is proposed. This algorithm eliminates a large number of false location points from the assignment process by rough correlations before we calculate the correlation cost, so it avoids the operations for the target state estimate and the calculation of the correlation cost for the false correlation sets. In the meantime, with the elimination of these points in the rough correlation, the disturbance from the false correlations in the assignment process is decreased, so the data correlation accuracy is improved correspondingly. Complexity analyses of the new multi-layer optimal algorithm and the traditional optimal assignment algorithm are given. Simulation results show that the new algorithm is feasible and effective.
文摘多层Morphin算法扩展了对未知环境的预测范围,克服了传统Morphin算法搜索轨迹不灵活的缺点,但每个搜索节点生成的搜索弧数目固定,搜索和评估所花费的时间随着搜索层数的增多呈指数阶增加。针对该问题,提出了一种可变搜索弧Morphin算法(variable search arc of Morphin,VSA-Morphin)。调整每层搜索节点生成的搜索弧数目,使之不再固定,而是随着层数增加而减少,从而缩短搜索和评估时间。利用MATLAB仿真测试表明,多层VSA-Morphin算法与多层Morphin算法所规划的路径基本一致,但运行时间却相对更少,从而验证了多层VSA-Morphin算法的有效性和正确性。
