Abstract
There has been a great deal of recent work on new approaches to efficiently generating plans in systems such as Graphplan and SATplan. However, these systems only provide an impoverished representation language compared to other planners, such as UCPOP, ADL, or Prodigy. This makes it difficult to represent planning problems using these new planners. This paper addresses this problem by providing a completely automated set of transformations for converting a UCPOP domain representation into a Graphplan representation. The set of transformations extends the Graphplan representation language to include disjunctions, negations, universal quantification, conditional effects, and axioms. We tested the resulting planner on the 18 test domains and 41 problems that come with the UCPOP 4.0 distribution. Graphplan with the new preprocessor is able to solve every problem in the test set and on the hard problems (i.e., those that require more than one second of CPU time) it can solve them significantly faster than UCPOP. While UCPOP was unable to solve 7 of the test problems within a search limit of 100,000 nodes (which requires 414 to 980 CPU seconds), Graphplan with the preprocessor solved them all in under 15 CPU seconds (including the preprocessing time).
Preview
Unable to display preview. Download preview PDF.
References
Edwin P.D. Pednault. ADL: Exploring the middle ground between STRIPS and the situation calculus. In Proc. 1st. Int. Conf. On Principles of Knowledge Representation and Reasoning, 1989.
Steven Minton, Craig A. Knoblock, D. Koukka, Yolanda Gil, Robert L. Joseph, and Jaime G. Carbonell. Prodigy 2.0: The manual and the tutorial. Technical report, Department of Computer Science, Carnegie Mellon University, 1989.
Daniel S. Weld. An introduction to least commitment planning. AI Magazine, 15(4), 1994.
Avrim L. Blum and Merrick L. Furst. Fast planning through planning graph analysis. Artifical Intelligence, 90(1-2):281–300, 1997.
Jana Koehler, Bernhard Nebel, Jörg Hoffman, and Yannis Dimopoulos. Extending planning graphs to an ADL subset. In Proc. ECP-97, Toulouse, France, 1997.
Henry Kautz and Bart Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proc. AAAI-96, Portland, OR, 1996.
A. Barrett, Dave Christianson, Marc Friedman, Chung Kwok, Keith Golden, Scott Penberthy, Ying Sun, and Daniel Weld. UCPOP user's manual, version 4.0. Technical report, Department of Computer Science and Engineering, University of Washington, 1995.
Richard E. Fikes and Nils J. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2(34):189–208, 1971.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gazen, B.C., Knoblock, C.A. (1997). Combining the expressivity of UCPOP with the efficiency of 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_88
Download citation
DOI: https://doi.org/10.1007/3-540-63912-8_88
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