改进Dijkstra算法在雷达突防中的应用  

Application of an Improved Dijkstra Algorithm to Radar Penetration

作　　者：李雪松[1] 谢军[1] 

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

出　　处：《火力与指挥控制》2009年第11期102-103,107,共3页Fire Control & Command Control

摘　　要：飞行器雷达突防是现代战争中自我保护的重要手段。综合考虑了雷达威胁和航程的影响,建立了关于雷达威胁模型和航程的代价函数。针对传统的Dijkstra算法搜索空间大,搜索效率低的问题,进行了改进,并考虑飞行器的偏航角约束,提出了基于栅格的Dijkstra算法。对简单雷达突防和复杂雷达突防进行了仿真验证。仿真结果表明:该算法不仅能较好地回避雷达威胁,而且较好地提高了搜索速度。The radar penetration is one of the most important technologies to protect the aircraft. This paper establishes the cost function including the radar threat cost and rout cost. Considering the flaws which are big searching spaces and low search efficiency in the traditional Dijkstra algorithm, and also consider the restriction of the yaw angle. This paper gives a new Dijkstra algorithm based on grid, and also give a simulation in simple radar penetration and complex radar penetration. The simulation results show that the new algorithm can not only evade the radar threat, but also can improve the search efficiency.

关 键 词：雷达突防 栅格 DIJKSTRA算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]