Extending planning graphs to an ADL subset

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1348 LNAI, Issue , 1997, Pages 273-285

  Koehler, Jana ^a   Nebel, Bernhard ^a   Hoffmann, Jörg ^a   Dimopoulos, Yannis ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

GRAPHPLAN; PLANNING GRAPHS;

ARTIFICIAL INTELLIGENCE;

EID: 84898681853     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63912-8_92     Document Type: Conference Paper

References (10)

1. A. Blum and M. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90(l-2):279-298, 1997.
2. E. Fink and M. Veloso. Prodigy planning algorithm. Technical Report CMU-94-123, Carnegie Mellon University, 1994.
3. B. Gazen and C. Knoblock. Combining the expressivity of UCPOP with the effi'ciency of Graphplan. In Steel [10].
4. H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In AAAI-96, pages 1194-1201.
5. J. Koehler, B. Nebel, J. Hoffmann, and Y. Dimopoulos. Extending planning graphs to an ADL subset. Technical report, 1997. http://www.informatik.uni- freiburg.de/" koehler/ipp.html.
6. D. McDermott. A heuristic estimator for means-ends analysis in planning. In AIPS-96, pages 142-149.
7. B. Nebel, Y. Dimopoulos, and J. Koehler. Ignoring irrelevant facts and operators in plan generation. In Steel [10].
8. E. Pednault. ADL: Exploring the middle ground between STRIPS and the Situa'tion Calculus. In KR-89, Morgan Kaufman, pages 324-332.
9. J. Penberthy and D. Weld. UCPOP: A sound, complete, partial order planner for ADL. In KR-92, Morgan Kaufman, pages 103-113.
10. S. Steel, editor. Proceedings of the 4th European Conference on Planning, LNAI. Springer, 1997.