Research on Taxiing Path Planning of Hub Airport Based on Dijkstra Algorithm

<div class="section abstract"><div class="htmlview paragraph">Aiming at the problem of insufficient capacity of taxiways in hub airports, which combine the safety interval, conflict resolution and fair principles, a taxiway planning model is established by taking the shortest taxiway as the optimisation goal, considering fuel consumption and exhaust emissions. Dijkstra algorithm is used to transform the taxiing path into an adjacency matrix, and conflict resolution is carried out in a weighted way. Under the premise of ensuring zero conflict of taxiways, the total taxiing distance is reduced. Based on actual operational data from a hub airport in China, the results show that the proposed taxiing path planning method is feasible, shortening the aircraft taxiing distance and improving the surface taxiing efficiency.</div></div>