使用Dijkstra算法的攻击机初始航迹研究

现代作战条件下,攻击机初始航迹的研究是为了保证攻击机在低空突防攻击时的安全,提高其综合作战能力.Dijkstra算法是图论中求解最短路径的一种算法,具有分析速度快、工程实现能力强的优点.运用改进Dijkstra算法的A*算法,将攻击机初始航迹规划问题转化成有向图中求最短路径的问题,减少无关顶点的运算,提高查询与规划最短路径的运算效率.侧重于复杂条件下的威胁建模的研究,明确各种威胁模型的系统效能,设置其危险系数,提出针对初始航迹的仿真程序流程图,设计了仿真程序代码.通过具体事例仿真,分析其初期航迹图,验证了算法的有效性与实用性,得到符合实战需要的最优的初始航迹.

Research on initial trajectories of attack aircraft based on Dijkstra algorithm

In order to ensure the safety of attack aircraft in low altitude penetration,the initial trajectories of the attack aircraft is studied to improve its integrated combat capacities under the modern warfare conditions.Dijkstra algorithm is used for finding the shortest-path in the graph theory,which has the advantages of rapid analysis speed and easly engineering implementation.In order to reduce the calculation of irrespective nodes and improve the effectiveness of shortest-path search and planning,we used t...