Abstract
We provide a reconstruction of Blum and Furst's Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstruction, the process of growing the planning-graph and inferring mutex relations corresponds to doing forward state-space refinement over disjunctively represented plans. The backward search phase of Graphplan corresponds to solving a binary dynamic constraint satisfaction problem. Our reconstruction sheds light on the sources of strength of Graphplan. We also use the reconstruction to explain how Graphplan can be made goal-directed, how it can be extended to handle actions with conditional effects, and how backward state-space refinement can be generalized to apply to disjunctive plans. Finally, we discuss how the backward search phase of Graphplan can be improved by applying techniques from CSP literature, and by teasing apart planning and scheduling (resource allocation) phases in Graphplan.
This research is supported in part by the NSF NYI award IRI-9457634, the ARPI Initiative grant F30602-95-C-0247 and the ARPA AASERT grant DAAH04-96-1-0231. We would like to thank Avrim Blum and Dan Weld for helpful discussions on Graphplan, and Mark Peot and David Smith for making their Lisp implementation of Graphplan available to us.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barrett, A. and Weld, D. 1994. Partial Order Planing: Evaluating possible efficiency gains. Artificial Intelligence, 67(1):71–112.
Blum, A. and Furst, M. 1995. Fast planning through planning graph analysis. In Proc. IJCAI-95 (Extended version appears in Artificial Intelligence, 90(1–2))
Bayardo, R. and Schrag, R. 1997. Using CSP look-back techniques to improve real-word SAT instances. In Proc. AAAI-97.
Frost, D and Dechter, R. 1994. In search of best constraint satisfaction search. In Proc. AAAI-94.
Drummond, M. 1989. Situated control rules. In Proceedings of the First International Conference on Knowledge Representation and Reasoning, 103–113. Morgan Kau fmann.
Kambhampati, S., Knoblock, C., and Yang, Q. 1995. Planning as refinement search: A unified framework for evaluating design tradeoffs in partial order planning. Artificial Intelligence, 76(12):167–238.
Kambhampati, S. and Yang, X. 1996, On the role of disjunctive representations and constraint propagation in refinement planning. In Proceedings of the fifth International Conference on Principles of Knowledge Representation and Reasoning. 35–147.
Kambhampati, S. 1997a. Challenges in bridging plan synthesis paradigms. In Proc. UCAI-97.
Kambhampati, S. 1997b. On the relations between intelligent backtracking and explanation-based learning in planning and constraint satisfaction. rakaposhi.eas.asu.edu/pub/rao/jour-ddb.ps.
Kambhampati. S. 1997c. Refinement planning as a unifying framework for plan synthesis. AI Magazine. 8(2).
Kautz, H. and Selman, B. 1996. Pushing the envelope: Planning Propositional Logic and Stochastic Search. In Proceedings of National Conference on Artificial Intelligence. 1194–11201
McDermott, D. 1996. A Heuristic estimator for means-ends analysis in planning. In: Proceedings of 3 rd International Conference on AI Planning Systems. AAAI Press. 142–149.
Mittal, S. and Falkenhainer, B. 1990. Dynamic Constraint Satisfaction Problems. In Proc. AAAI-90.
Parker, E and Kambhampati, S. 1997. Making Graphplan goal-directed. Forthcoming.
Reisig, W. 1982. Petrie Nets: An Introduction. Springer-Verlag.
Smith, D and Peot, M. 1996. Suspending recursion in partial order planning. In Proc. 3 rd Intl. Conference on AI Planning Systems.
Srivastava, B and Kambhampati, S. 1997. Teasing apart planning and scheduling in Graphplan. Forthcoming.
Tsang, E. Constraint Satisfaction. Academic Press. 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kambhampati, S., Parker, E., Lambrecht, E. (1997). Understanding and extending Graphplan. In: Steel, S., Alami, R. (eds) Recent Advances in AI Planning. ECP 1997. Lecture Notes in Computer Science, vol 1348. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63912-8_91
Download citation
DOI: https://doi.org/10.1007/3-540-63912-8_91
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63912-1
Online ISBN: 978-3-540-69665-0
eBook Packages: Springer Book Archive