Abstract
Planning techniques have matured as demonstrated by the performance of automatic planning systems at recent international planning system competitions. Nowadays it seems feasible to apply planning systems to real-world problems. In order to get an idea of what the performance difference between special-purpose techniques and automatic planning techniques is, we applied these techniques to the airport traffic control problem and compared it with a special purpose tool. In addition to a performance assessment, this exercise also resulted in a domain model of the airport traffic control domain, which was used as a benchmark in the 4th International Planning Competition.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bacchus, F.: The AIPS’00 planning competition. The AI Magazine 22(3), 47–56 (2001)
Blum, A.L., Furst, M.L.: Fast planning through planning graph analysis. Artificial Intelligence 90(1-2), 279–298 (1997)
Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence 129(1-2), 5–33 (2001)
Edelkamp, S.: Taming numbers and durations in the model checking integrated planning system. Journal of Artificial Intelligence Research 20, 195–238 (2003)
Edelkamp, S., Hoffmann, J.: PDDL2.2: The language for the classical part of the 4th international planning competition. Technical Report 195, Albert- Ludwigs-Universität, Institut für Informatik, Freiburg, Germany (2004)
Fikes, R.E., Nilsson, N.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2, 189–208 (1971)
Gerevini, A., Saetti, A., Serina, I.: Planning through stochastic local search and temporal action graphs in LPG. Journal of Artificial Intelligence Research 20, 239–290 (2003)
Hatzack, W., Nebel, B.: Solving the operational traffic control problem. In: Cesta, A. (ed.) Recent Advances in AI Planning. 5th European Conference on Planning (ECP 2001), Toledo, Spain, September 2001, Springer, Heidelberg (2001)
Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14, 253–302 (2001)
Koehler, J., Nebel, B., Hoffmann, J., Dimopoulos, Y.: Extending planning graphs to an ADL subset. In: Steel, S. (ed.) ECP 1997. LNCS, vol. 1348, pp. 273–285. Springer, Heidelberg (1997)
McDermott, D., et al.: The PDDL Planning Domain Definition Language. The AIPS-98 Planning Competition Comitee (1998)
Fox, M., Long, D.: The AIPS-2002 international planning competition. In: Proceedings of the 6th International Conference on Artificial Intelligence Planning Systems (AIPS 2002), AAAI Press, Menlo Park (2002)
Pednault, E.P.D.: ADL: Exploring the middle ground between STRIPS and the situation calculus. In: Brachman, R., Levesque, H.J., Reiter, R. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the 1st International Conference (KR 1989), Toronto, ON, May 1989, pp. 324–331. Morgan Kaufmann, San Francisco (1989)
Trüg, S., Hoffmann, J., Nebel, B.: Applying automatic planners to airport ground-traffic control. Technical Report 199, Albert-Ludwigs- Universität, Institut für Informatik, Freiburg, Germany (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trüg, S., Hoffmann, J., Nebel, B. (2004). Applying Automatic Planning Systems to Airport Ground-Traffic Control – A Feasibility Study. In: Biundo, S., Frühwirth, T., Palm, G. (eds) KI 2004: Advances in Artificial Intelligence. KI 2004. Lecture Notes in Computer Science(), vol 3238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30221-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-30221-6_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23166-0
Online ISBN: 978-3-540-30221-6
eBook Packages: Springer Book Archive