摘要
提出了改进A*算法并应用于飞行器航迹规划,该算法把地形平滑技术融合到路径搜索的过程中,使平滑处理只需满足路径选择方向的飞行坡度要求和飞行器过载限制,得到的最优航迹更加贴近地形。在相同的条件下对改进A*算法和传统算法进行仿真比较,传统算法需要35 s左右收敛得到优化航迹并且代价函数为32.15;改进算法能在24 s内找到代价函数最优的飞行器三维航迹且代价函数为28.26,仿真结果表明改进A*算法在收敛速度和最优路径代价函数结果都明显优于传统算法,是一种有效的三维航路规划方法。
The common methods in the path planning for aircraft one optimizing the path inflying surface based on the smoothed digitol terrain, but these methods add the restrained conditions of the digitol terrain. A path planning scheme for aircraft based on improved A^＊ algorithm is presented, which looks quite promising for the path planning problem. The cost function on the base of real terrain threats and fire threats is pnesented, the improved A^＊ algorithm is given, to combine search optimum path and the smooth digital terrain. Finally simulation examples are given. The simulation results show that the improved A^＊ algorithm proposed can get the satisfactory path in 24 seconds. It indicates that the proposed algorithm has better capability compared with traditional A^＊ algorithm, which can satisfy path planning for aircraft.
出处
《系统工程与电子技术》
EI
CSCD
北大核心
2008年第2期324-326,共3页
Systems Engineering and Electronics
基金
军队重点科研项目(KG06085)
空军工程大学工程学院优秀博士学位论文创新基金(BC06003)资助课题
