Abstract
This paper proposes a non-propositional representation framework for planning in physical domains. Physical planning problems involve identifying a correct sequence (plan) of object manipulations, transformations and spatial rearrangements to achieve an assigned goal . The problem of the ramification of action effects causes most current (propositional) planning languages to have inefficient encodings of physical domains. A simpler and more efficient representation is proposed, in which actions, goals and world state are modelled using ‘setGraphs’. A set Graph is an abstract data-structure able to capture implicitly the structural and topological constraints of a physical domain. Despite being model-based, the representation also allows the use of types and propositional furmulae to specify additional domain constraints. Experimental results obtained with a specific implementation of the representation indicate significant improvements in performance in all of the domains considered.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Cesta and A. Oddi. DDL.I: A formal description of a constraint representation language for physical domains. In M. Ghallab and A. Milani, editors, New Directions in AI Planning, pages 341–352. IOS Press (Amsterdam), 1996. (Proceedings of the 3rd European Workshop on Planning (EWSP95), Assisi, Italy, September 1995).
M. Fox and D. Long. PDDL2.I: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intell igence Research Special issue on the 3rd International Planning Competition, 2003. (forthcoming).
M. Garagnani and Y. Ding. Model-based planning for objectrearrangement problems. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS-03)-Workshop on PDDL, pages 49–58, 2003.
J.R. Hayes and H.A. Simon. Psychological differences among problem isomorphs. In N.J. Castellan, D.B. Pisoni, and G.R. Potts, editors, Cognitive theory. Erlbaum, 1977.
K. Kotovsky, J.R. Hayes, and H.A. Simon. Why Are Some Problems Hard? Evidence from Tower of Hanoi. Cognitive Psychology, 17:248–294, 1985.
Z. Kulpa. Diagrammatic representation and reasoning. Machine GRAPHICS & VISION, 3(1/2):77–103, 1994.
J.H. Larkin and H.A. Simon. Why a diagram is (sometimes) worth ten thousands words. Cognitive Science, 11:65–99, 1987.
D. Liu and T.L. McCluskey. The OCL Language Manual, Version 1.2. Technical report, Department of Computing and Mathematical Sciences, University of Huddersfield (UK), 2000.
D. Long and M. Fox. Automatic synthesis and use of generic types in planning. In S. Chien, S. Kambhampati, and C.A. Knoblock, editors, Proceedings of the 5th International Conference on AI Planning and Scheduling Systems (AIPS’00), pages 196–205, Breckenridge, CO, April 2000. AAAI Press.
K. Myers and K. Konolige. Reasoning with analogical representations. In B. Xebel, C. Rich, and W. Swartout, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR92), pages 189–200. Morgan Kaufmann Publishers Inc., San Mateo, CA, 1992.
E.P.D. Pednault. Synthesizing plans that contain actions with contextdependent effects. Computational Intelligence, 4(4):356–372, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag London
About this paper
Cite this paper
Garagnani, M. (2004). Model-based Planning in Physical domains using SetGraphs. In: Coenen, F., Preece, A., Macintosh, A. (eds) Research and Development in Intelligent Systems XX. SGAI 2003. Springer, London. https://doi.org/10.1007/978-0-85729-412-8_22
Download citation
DOI: https://doi.org/10.1007/978-0-85729-412-8_22
Publisher Name: Springer, London
Print ISBN: 978-1-85233-780-3
Online ISBN: 978-0-85729-412-8
eBook Packages: Springer Book Archive