关于导弹战场突防目标航迹规划仿真

Simulation of Target Track Planning for Missile Battlefield

航迹规划是实现导弹在战场突防过程中自主飞行、提高导弹生存能力的技术保障,航迹规划算法则是航迹规划的核心。为解决传统的单向动态规划算法在反舰导弹航迹规划过程中耗时长以及规划航迹上存在冗余节点的问题,提出双向动态规划算法和基于三角不等式的航迹优化策略。首先将规划空间网格化;接着采用双向动态规划算法搜索航迹节点;然后运用提出的航迹优化策略对航迹进行优化;最后将所提算法与模拟退火算法、蚁群算法、传统单向动态规划算法进行仿真比较。仿真结果表明,与其它三种算法相比,所提算法计算速度更快、规划航迹更短、节点更少。

The track planning is the technical guarantee to realize the missile independent flight during missile penetration in battlefield and improve the survivability of the missile. The algorithm of path planning is the core of the track planning. In order to tackle the problems that the unidirectional dynamic programming algorithm consumes much time in anti-ship missile route planning and redundant nodes arise within it,a bidirectional dynamic programming algorithm and a trajectory optimization strategy based on trigonometric inequality are proposed. Based on the mesh of the planning space,the tracks are searched by the bidirectional dynamic programming,and the tract is optimized by the proposed optimization strategy. Finally,the algorithm is compared with simulated annealing algorithm,ant colony algorithm and dynamic programming algorithm. The simulation results show that the proposed algorithm is faster,the planning path is shorter and the nodes are less.