Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Extending planning graphs to an ADL subset

  • Conference paper
  • First Online:
Recent Advances in AI Planning (ECP 1997)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1348))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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 [10].

    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 [10].

    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 

Download references

Author information

Authors and Affiliations

  1. Institute for Computer Science, Albert Ludwigs University, Am Flughafen 17, 79110, Freiburg, Germany

    Jana Koehler, Bernhard Nebel, Jörg Hoffmann & Yannis Dimopoulos

Authors
  1. Jana Koehler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernhard Nebel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jörg Hoffmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yannis Dimopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Sam Steel Rachid Alami

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koehler, J., Nebel, B., Hoffmann, J., Dimopoulos, Y. (1997). Extending planning graphs to an ADL subset. 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_92

Download citation

  • DOI: https://doi.org/10.1007/3-540-63912-8_92

  • 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

Publish with us

Policies and ethics

Search

Navigation