满足战场需求的实时飞行路径规划

基于启发式A*搜索技术,给出了两种战机飞行路径实时规划算法,通过采用折距替代直线距离,达到减少扩展点和提高搜索速度的目的;通过添加虚拟威胁源,解决了飞机最小转弯半径和飞行目标进入角度限制问题,通过飞行速度和飞行到达时间对应的最大飞行距离来对规划过程中扩展节点的剪枝,可以满足飞行速度、飞行时间等战场需求,提出的算法还保证穿越威胁源飞行飞机的生存性达到最大.仿真结果证实了该算法的有效性以及实时性. 

Real-time flight path planning for combat mission

Based on A * heuristics search algorithms, two efficacious real time methods for combat mission were presented. By instead of direct distance with fold distance, the expanded number could decrease and the searching rate could speed up. Adding virtual threats, the limits of minimize turning radius and entering direction could satisfy. Form flight speed and arriving time of the plane could get the largest distance to the target. In the process of expanding, cutting branch with the largest distance could meet the needs of the flight speed and arriving time. The presented algorithms ensure the survivability of penetrate threat reach the maximization. The simulation results show that the efficiency of the algorithms is rationality.