战斗机摆脱跟踪最优路线模型

Based on Large Data Fighter from Tracking Model of Optimal Route

战斗机摆脱跟踪最优路线进行选择的过程中,需要短时间内考虑众多约束条件,导致传统的基于蚂蚁寻径原理的战斗机摆脱跟踪最优路线选择模型,无法快速有效使战斗机摆脱跟踪,为解决上述问题,提出一种大数据分析的战斗机摆脱跟踪最优路线选择模型,战斗机摆脱跟踪最优路线进行选择的过程中,引入因素重要程度处理战斗机对各条路径的区间决策值,将指标重要性以权重的形式体现出来,通过DIJKSTRA算法产生最短路径树,对所有边赋予新的权重,如果最短路径被删除后路线依然连通,则将最优安全路线问题变成最短路径问题;如果最短路径被删除后路线不连通,则将最优安全路线问题变成最小最大问题。仿真结果表明,所提方法为战斗机摆脱跟踪具有很好的高效性。

Fighter out of tracking the process of theoptimal route choice, need to consider many constraints in a short period of time, lead to the traditional fighter on the basis of the principle of ants find diameter out of track the optimal route choice model, due to the optimal route will be regarded as the shortest path, did not consider safe factor, unable to quickly and effectively make fighter get rid of the track, based on a large data analysis of fighter jets from tracking the optimal route choice model, under the analy- sis of large data, fighter out of tracking the process of the optimal route choice, introducing the factors important de- gree of processing fighter on every path interval decision value, will be the importance in the form of weights, convert them to compare the values in the matrix, the importance of each index weight index, the biggest characteristic root judg- ment matrix and weight vector. Through the DIJKSTRA algorithm to generate the shortest path tree, giving new weight to all side, if the shortest path be deleted after the route is still connected, is the optimal safety route problem into the shortest path problem ; If the shortest path be deleted after the line is not connected, the optimal route safety problems into the smallest biggest problem. The simulation results show that the proposed method is of high efficiency.