Open AccessImproved approach for time‐based taxi trajectory planning towards conflict‐free, efficient and fluent airport ground movement
Author(s) -
Zhang Tianci,
Ding Meng,
Zuo Hongfu
Publication year - 2018
Publication title -
iet intelligent transport systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.579
H-Index - 45
eISSN - 1751-9578
pISSN - 1751-956X
DOI - 10.1049/iet-its.2018.5193
Subject(s) - tree traversal , computer science , time constraint , trajectory , operations research , interval (graph theory) , constraint (computer aided design) , takeoff , time limit , real time computing , fluent , iterated local search , taxis , path (computing) , mathematical optimization , simulation , transport engineering , engineering , artificial intelligence , algorithm , local search (optimization) , mathematics , computer simulation , automotive engineering , physics , astronomy , mechanical engineering , systems engineering , combinatorics , political science , law , programming language
The ever‐growing air traffic demand arouses an urgent need for improved airport ground movement efficiency. New operational concepts are emerging which use time‐based taxi trajectories to reduce uncertainty and make more efficient use of the airport resource. In this study, an improved approach is proposed for time‐based taxi trajectory planning, which is formulated as the shortest path problem with time windows and the maximum traversal time constraint. With the introduction of the taxi time in the cost and the maximum traversal time constraint to limit the waiting time, more efficient and fluent ground movement of aircraft can be realised. An A*‐based solution algorithm is developed for the investigated problem, which utilises the arrival time interval and dominance‐based comparison to search for the best solution. Experimental results on real‐world problem instances demonstrate the effectiveness of the proposed approach as well as its advantages over the existing approach.