Dual-Layer Dynamic Path Optimization for Airport Ground Equipment Using Graph Theory and Adaptive Genetic Algorithms
Abstract
With the continuous promotion of smart airport construction, the application of unmanned ground equipment vehicles in airports is becoming increasingly popular. The existing path planning methods rely on manual management, which has problems such as low efficiency and poor ability to respond to unexpected situations. Given this, this study first models the airport path based on graph theory. Secondly, a two-layer dynamic path optimization algorithm is designed by combining the improved dynamic programming Dijkstra algorithm with the introduced genetic algorithm for path conflict identification and avoidance mechanisms. Performance test results showed that the running time of the improved Dijkstra algorithm was shortened by about 48.29% and the number of edges was reduced by 10.07%. The fitness value and variance of the improved genetic algorithm increased by 8.99% and decreased by 66.67%, respectively. In a high-density and high-frequency conflict environment, the path success rate of the proposed model was 90.1%, which was 7.2% higher than the comparative algorithm. In addition, its path smoothness standard deviation was 5.32°, better than 6.68° and 8.47° of the comparative algorithms. The results indicate that the optimized path planning method can reduce the total running time and effectively avoid path conflicts between multiple vehicles, providing certain technical support and new ideas for the safe operation of airport special unmanned equipment vehicles.DOI:
https://doi.org/10.31449/inf.v49i13.7651Downloads
Published
How to Cite
Issue
Section
License
Authors retain copyright in their work. By submitting to and publishing with Informatica, authors grant the publisher (Slovene Society Informatika) the non-exclusive right to publish, reproduce, and distribute the article and to identify itself as the original publisher.
All articles are published under the Creative Commons Attribution license CC BY 3.0. Under this license, others may share and adapt the work for any purpose, provided appropriate credit is given and changes (if any) are indicated.
Authors may deposit and share the submitted version, accepted manuscript, and published version, provided the original publication in Informatica is properly cited.







