Unlock instant, AI-driven research and patent intelligence for your innovation.

Airport taxiway scheduling method based on quantum heuristic algorithm

A heuristic algorithm and scheduling method technology, applied in computing, instrumentation, data processing applications, etc., can solve problems such as inapplicability, achieve good computing power, and solve the effect of conflict-free path planning problems

Active Publication Date: 2021-08-20
NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the multiple feasible paths calculated by this algorithm allow different people to choose the same path for evacuation at the same time, so it is not suitable for the scene requirements of airport dispatching

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Airport taxiway scheduling method based on quantum heuristic algorithm
  • Airport taxiway scheduling method based on quantum heuristic algorithm
  • Airport taxiway scheduling method based on quantum heuristic algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0051] like figure 1 Shown, the present invention is based on the airport taxiway scheduling method of quantum heuristic algorithm, comprises the following steps:

[0052] Step 1. Read various information of the airport and 8 aircrafts; initialize the pheromones, the initial state of all qubits is as follows, set the safety interval d=200 meters; the current number of iterations is 0, and the threshold is 140.

[0053]

[0054] Step 2. Read the information of each aircraft: For example, aircraft 1 knows that the start point is 28, the end point is 26, the departure time is 0:01:10, and the speed is 8.

[0055] Step 3. The path of aircraft 1 is calculated for the first time as 26->17->16->13->15; this calculation successfully finds a feasible path, so the pheromone of each path is updated:

[0056]

[0057] Repeat 14 times to get the better path of aircraft 1. Do the same operation for other aircraft, so as to obtain the taxi sequence of different aircraft in the follow...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses an airport taxiway scheduling method based on a quantum heuristic algorithm, and the method comprises the steps: reading the data of airport nodes and an aircraft takeoff plan, initializing the pheromone of a path between each adjacent node, representing the pheromone of the path by adopting the amplitude of quantum bits, the updating operation of path pheromones is realized by utilizing quantum gate rotation, so that the probability of selecting a better path by later generations is improved, and a better airport taxiway scheduling scheme is finally obtained through head-to-head impact detection, rear-end impact detection and cross impact detection, conflict resolution and continuous iteration. The method has good calculation efficiency and calculation results, and has better calculation capability for common conflict-free path planning problems.

Description

technical field [0001] The invention belongs to the technical field of airport dispatching methods, in particular to an airport taxiway dispatching method based on a quantum heuristic algorithm. Background technique [0002] Existing airport taxiway scheduling mostly relies on manual experience, and rarely uses algorithms for calculation. The existing algorithms for solving combinatorial optimization problems are mainly divided into MILP methods and heuristic algorithms. However, with the development of the transportation industry, the scale of airports continues to increase, and the number of flights increases rapidly. The precise algorithm represented by MILP is difficult to cope with the growing computing needs. However, the existing heuristic algorithms, such as ant colony algorithm, genetic algorithm, particle swarm algorithm, etc., can cope with a large amount of data calculation, but the results obtained are often not ideal, and the average waiting time and overall t...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06Q10/06G06Q10/04G06Q50/30
CPCG06Q10/06311G06Q10/047G06Q50/40
Inventor 李丹钱灵陈旭
Owner NANJING UNIV OF AERONAUTICS & ASTRONAUTICS