Aircraft route planning method

Abstract

The invention belongs to the technical field of aircraft route planning, and particularly relates to an aircraft route planning method which comprises the following steps: step 1, discretizing a situation space to obtain a plurality of discrete points; step 2, generating a heuristic factor matrix of each discrete point; step 3, taking the discrete point at a planning starting point as a current planning point; step 4, selecting discrete points meeting the safe flight condition of the aircraft in the current planning point range to form a set of next planning points of the discrete points; step5, judging whether the set is empty or not; step 6, if the set is not empty, selecting a next planning point from the set based on the heuristic factor matrix and the pheromone matrix thereof to update the current planning point; judging whether the current planning point is a discrete point at the planning end point or not, and if not, returning to the step 4; if so, searching to obtain and store a planned route; and step 7, if the set is empty, searching to obtain and store the planned route.

Description

technical field [0001] The application belongs to the technical field of aircraft route planning, and in particular relates to an aircraft route planning method. Background technique [0002] In order to avoid being threatened by threat sources, the aircraft needs to plan its flight route in advance in order to avoid various scattered threat sources effectively. [0003] At present, the flight route of the aircraft is mostly planned based on the A* algorithm. This technical solution has the following defects: [0004] 1) Using the full connection method, the solution space is huge in the three-dimensional situation environment, and the number of pre-generated auxiliary waypoints is large, which is difficult to meet the timeliness requirements of aircraft route planning; [0005] 2) The route planned based on it can only avoid static threat sources, but cannot effectively avoid dynamic threat sources. [0006] The present application is proposed in view of the above-mention...

AI Technical Summary

Problems solved by technology

[0004] 1) Using the full connection method, the solution space is huge in the three-dimensional situation environment, and the number of pre-generated auxiliary waypoints is large, which is difficult to meet the timeliness requirements of aircraft route planning;

[0005] 2) The route planned based on it can only avoid static threat sources, but cannot effectively avoid dynamic threat sources

Images