Extending planning graphs to an ADL subset
We describe an extension of GRAPHPLAN to a subset of ADL that allows conditional and universally quantified effects in operators in such a way that almost all interesting properties of the original GRAPHPLAN algorithm are preserved.
KeywordsPlanning Graph Planning Problem Effect Condition Action Node Conditional Effect
Unable to display preview. Download preview PDF.
- 1.A. Blum and M. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2):279–298, 1997.Google Scholar
- 2.E. Fink and M. Veloso. Prodigy planning algorithm. Technical Report CMU-94123, Carnegie Mellon University, 1994.Google Scholar
- 3.B. Gazen and C. Knoblock. Combining the expressivity of UCPOP with the efficiency of Graphplan. In Steel .Google Scholar
- 4.H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In AAAI-96, pages 1194–1201.Google Scholar
- 5.J. Koehler, B. Nebel, J. Hoffmann, and Y. Dimopoulos. Extending planning graphs to an ADL subset. Technical report, 1997. http://www.informatik.unifreiburg.de/~koehler/ipp.html.Google Scholar
- 6.D. McDermott. A heuristic estimator for means-ends analysis in planning. In AIPS-96, pages 142–149.Google Scholar
- 7.B. Nebel, Y. Dimopoulos, and J. Koehler. Ignoring irrelevant facts and operators in plan generation. In Steel .Google Scholar
- 8.E. Pednault. ADL: Exploring the middle ground between STRIPS and the Situation Calculus. In KR-89, Morgan Kaufman, pages 324–332.Google Scholar
- 9.J. Penberthy and D. Weld. UCPOP: A sound, complete, partial order planner for ADL. In KR-92, Morgan Kaufman, pages 103–113.Google Scholar
- 10.S. Steel, editor. Proceedings of the 4th European Conference on Planning, LNAL Springer, 1997.Google Scholar