基于Dijkstra算法的巡航导弹航迹规划方法研究  

Path Planning Method Research of Cruise Missile Based on Dijkstra Algorithm

作　　者：张同法[1] 于雷[1] 刘文杰[1] 刘栋[1] 

机构地区：[1]空军工程大学工程学院,西安710038

出　　处：《弹箭与制导学报》2008年第4期65-67,共3页Journal of Projectiles,Rockets,Missiles and Guidance

摘　　要：巡航导弹的航迹规划是指依据地形信息和敌情信息,在某些约束条件下,找出导弹从初始点到目标点的最优飞行轨迹。在综合考虑了威胁度大小和航迹长度的约束,并比较了各种算法的情况下,选用Dijkstra算法实现了巡航导弹整体最优水平航迹解算。并给出了仿真实例,验证了算法的有效性和实用性。The path planning of cruise missile generates an optimum path from start point to target point according to terrain and enemy＇s situation and some restrictions. An optimal horizontal path of the cruise missile was obtained based on Dijkstra algorithm after considering the restrictions of threat and the length of fly path and comparing various algorithms. The result of simulation shows that this algorithm is effective and easy to be realized in engineering.

关 键 词：巡航导弹 DIJKSTRA算法 航迹规划 

分 类 号：TJ761.6[兵器科学与技术—武器系统与运用工程]