The aircraft landing scheduling problem (ALS) is a typical NP-hard optimization problem and exists in the Air Traffic Control for a long time. Many algorithms have been proposed to solve the problem, and most of them are centralized. With the development of the aerotechnics, the concept of free flight has been proposed. Airplanes could change their flight paths during the flight without approval from a centralized en route control. In order to support free flight, a distributed system based on Multi-Agent System is proposed in this paper. The kernel of the system is semantic agent negotiation mechanism. With the method aircrafts in the system could make landing sequence considering their own states. The Experimental results show that the proposed algorithm is able to obtain an optimal landing sequence and landing time rapidly and effectively. © 2012 Springer-Verlag.
CITATION STYLE
Huang, Z. T., Song, X. Y., Sun, J. Z., & Li, Z. Z. (2012). Aircraft landing scheduling based on semantic agent negotiation mechanism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7389 LNCS, pp. 483–489). https://doi.org/10.1007/978-3-642-31588-6_62
Mendeley helps you to discover research relevant for your work.