This paper proposes a route planning method based on multi-agent system for the NP-hard problem in aircraft taxiing route planning. Route planning is made according to the flight schedule in sequence for one aircraft each time. The post-planned route does not damage the existing one and route planning is made by utilizing the free time window of the taxiing road section. The artificial intelligence algorithm based on multi-agent system is designed to search the free time windows so as to find out the optimal taxiing routes for the aircrafts. The simulation results show that the average taxiing time of aircrafts is significantly reduced by comparing with the fixed pre-selected taxiing path algorithm, and the taxiing time may be saved up to 19.6% at maximum.
Aircraft taxiing route planning based on multi-agent system
2016-10-01
943026 byte
Conference paper
Electronic Resource
English
Aircraft taxiing route guiding system and method thereof
European Patent Office | 2022
|