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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Aircraft taxiing route planning based on multi-agent system


    Contributors:
    Fu Chen (author)


    Publication date :

    2016-10-01


    Size :

    943026 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    AIRCRAFT TAXIING SYSTEM

    KRACKE JEREMY A G | European Patent Office | 2016

    Free access

    Aircraft taxiing system

    KRACKE JEREMY A G | European Patent Office | 2016

    Free access

    Aircraft taxiing system

    NICOLAS YANN / TATRY PHILIPPE / BRADIER MATTHIEU et al. | European Patent Office | 2017

    Free access

    Aircraft taxiing route guiding system and method thereof

    SU YIJIE | European Patent Office | 2022

    Free access