Military transport aircraft route planning method based on grey wolf optimization algorithm

Abstract

The invention discloses a military transport aircraft route planning method based on a grey wolf optimization algorithm. According to the method, an aviation network model is built based on graph theory related knowledge, and related data are collected to lay a foundation for the subsequent modeling and solving. On the basis of the constructed aviation network, the military transport aircraft route planning method based on the GWO algorithm is provided. The result shows that the GWO algorithm is feasible when being used for solving the route planning problem of the military transport aircraft,and the solving of the military air route planning can be well completed. The method is used for solving the shortest path between the aviation network nodes in the Beijing area, and the shortest path is compared with a Dijkstra algorithm and a Floyd algorithm, so that the practicability and effectiveness of the method are verified. In the future research, more factors influencing the flight of the military transport aircraft can be considered, and an objective function is re-established to scientifically and reasonably plan the air route.

Description

technical field [0001] The invention relates to the field of aviation technology, in particular to a route planning method for military transport aircraft based on gray wolf optimization algorithm. Background technique [0002] Military transport aircraft are responsible for important transportation tasks and play a pivotal role in military operations. The route planning of a transport aircraft refers to planning the shortest route between takeoff and landing airports from the chart under the premise of comprehensively considering the influence of various factors. In a large number of air routes, it is a complicated process to choose a scientific planning method to find the shortest route from the start point to the end point, so the problem of transport aircraft route planning can be reduced to the shortest path problem. [0003] Existing route planning methods can usually be classified into three categories: one is traditional methods, such as Voronoi diagram method, grid...

AI Technical Summary

Problems solved by technology

The traditional algorithm has relatively ideal requirements for obstacles, and the actual terrain has a great influence on the planning results

The characteristic of the intelligent optimization algorithm is that it is not restricted by function derivation, and has advantages in global search and stability, but it also has the disadvantages of low efficiency, slow speed, and inapplicability to dynamic maps

Other algorithms, such as dynamic programming algorithms, can achieve the optimal value on local paths and are also suitable for dynamic maps, but cannot ensure the global optimal value

Images