Abstract
This paper presents the parametric system HW[], devised and implemented to perform planning by abstraction. The parameter is an external PDDL-compliant planner, which is exploited to search for solutions at any required level of abstraction including the ground one. To represent abstraction hierarchies an extension to the standard PDDL notation has been devised, which allows one to control communication between adjacent levels by specifying suitable translation rules. Moreover, a novel semi-automatic technique for generating abstract spaces is also described. Five domains -taken from the AIPS 2002, 2000 and 1998 planning competitions- have been selected as test bed. To assess the impact of abstraction techniques on search performances, experiments have been focused on comparing three relevant planners with their hierarchical counterparts. Results put into evidence that the hierarchical approach may significantly speed up the search.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Newell, A., Simon, H.A.: Human Problem Solving. Prentice Hall, Englewood Cliffs (1972)
Sacerdoti, E.D.: Planning in a hierarchy of abstraction spaces. Artificial Intelligence 5, 115–135 (1974)
Yang, Q., Tenenberg, J.: Abtweak: Abstracting a Nonlinear, Least Commitment Planner. In: Proceedings of the 8th National Conference on Artificial Intelligence, Boston, MA, pp. 204–209 (1990)
Christensen, J.: Automatic Abstraction in Planning. PhD thesis, Department of Computer Science, Standford University (1991)
Paul Benjamin, D.: Change of Representation and Inductive Bias. In: Carbonell, J., Knoblock, C.A., Minton, S. (eds.) PRODIGY: An integrated architecture for planning and learning, pp. 125–146. Kluwer Academic Publisher, Dordrecht (1990)
Knoblock, C.A.: Search Reduction in Hierarchical Problem Solving. In: Proceedings of the 9th National Conference on Artificial Intelligence, Anaheim, CA, pp. 686–691 (1991)
McDermott, D., Ghallab, M., Howe, A., Knoblock, C.A., Ram, A., Veloso, M., Weld, D., Wilkins, D.: PDDL–The Planning Domain Definition Language, Technical Report CVC TR-98-003 / DCS TR-1165, Yale Center for Communicational Vision and Control (1998)
Armano, G., Cherchi, G., Vargiu, E.: A Parametric Hierarchical Planner for Experimenting Abstraction Techniques. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), Acapulco, Mexico (2003)
Armano, G., Cherchi, G., Vargiu, E.: An Extension to PDDL for Hierarchical Planning. In: Workshop on PDDL (ICAPS 2003), Trento, Italy (2003)
Korf, R.E.: Planning as Search: A Quantitative Approach. Artificial Intelligence 33(1), 65–88 (1987)
Knoblock, C.A.: Automatically Generating Abstractions for Planning. Artificial Intelligence 68(2), 243–302 (1994)
Giunchiglia, F., Walsh, T.: A theory of Abstraction, Technical Report 9001-14, IRST, Trento, Italy (1990)
Bergmann, R., Wilke, W.: Building and Refining Abstract Planning Cases by Change of Representation Language. Journal of Artificial Intelligence Research (JAIR) 3, 53–118 (1995)
Erol, K., Hendler, J., Nau, D.S.: HTN Planning: Complexity and Expressivity. In: Proceedings of the 12th National Conference on Artificial Intelligence (AAAI 1994), pp. 1123–1128. AAAI Press / MIT Press, Seattle, WA (1994)
Armano, G., Cherchi, G., Vargiu, E.: Experimenting the Performance of Abstraction Mechanisms through a Parametric Hierarchical Planner. In: Proceedings of IASTED International Conference on Artificial Intelligence and Applications (AIA 2003), Innsbruck, Austria (2003)
Armano, G., Vargiu, E.: An Adaptive Approach for Planning in Dynamic environments. In: Proceedings of the International Conference on Artificial Intelligence (IC-AI 2001), Las Vegas, Nevada, pp. 987–993 (2001) (special Session on Learning and Adapting in AI Planning)
Blum, A.L., Furst, M.L.: Fast Planning through Planning Graph Analysis. Artificial Intelligence 90(1-2), 279–298 (1997)
Kautz, H., Selman, B.: BLACKBOX: A New Approach to the Application of Theo-rem Proving to Problem Solving. In: Working notes of the Workshop on Planning as Combinatorial Search, AIPS 1998, Pittsburg, PA, pp. 58–60 (1998)
Gerevini, A., Serina, I.: LPG: A Planner Based on Local Search for Planning Graphs. In: Proceedings of the 6th International Conference on AI Planning and Scheduling. AAAI Press, Menlo Park (2000)
Long, D.: The AIPS-98 Planning Competition. AI Magazine 21(2), 13–33 (1998)
Bacchus, F.: Results of the AIPS 2000 Planning Competition (2000), http://www.cs.toronto.edu/aips2000
Long, D.: Results of the AIPS 2002 Planning Competition (2002), http://www.dur.ac.uk/d.p.long/competition.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Armano, G., Cherchi, G., Vargiu, E. (2003). Planning by Abstraction Using HW[]. In: Cappelli, A., Turini, F. (eds) AI*IA 2003: Advances in Artificial Intelligence. AI*IA 2003. Lecture Notes in Computer Science(), vol 2829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39853-0_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-39853-0_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20119-9
Online ISBN: 978-3-540-39853-0
eBook Packages: Springer Book Archive