Skip to main content
SpringerLink
Log in

Abstraction as a heuristic to guide planning

  • Conference paper
  • First Online:
KI-96: Advances in Artificial Intelligence (KI 1996)

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

Included in the following conference series:

  • 193 Accesses

Abstract

In this paper we propose a novel way how to incorporate abstraction into planning. The approach is robust and complete, i.e. if a solution exists it will be found by our search method. Design criteria for a suitable abstraction function can be derived from formal analysis. Furthermore our approach allows the integration of heuristics formulated at different abstraction levels, thus providing a powerful and convenient tool for problem solving.

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.

References

  1. J. F. Allen, H. A. Kautz, R. N. Pelavin and J. D. Tenenberg. Reasoning about Plans. Morgan Kaufmann Publishers, 1991.

    Google Scholar 

  2. M. Contzen. Hierarchisches Planen. PhD Thesis, to appear, Dept. of Computer Science, Bonn Univ., 1996.

    Google Scholar 

  3. L. Chrisman. Reasoning about Probabilistic Actions at Multiple Levels of Granularity. Working Notes AAAI Spring Symposium Series, Stanford University, 1994.

    Google Scholar 

  4. J. Frings, K. Möller, C. Reiner and M. Contzen. MARC: Eine Implementierungsplattform für Robotersysteme. in C. Cap (ed.) SIWORK'96, vdf, Zürich.

    Google Scholar 

  5. R. E. Fikes and N. J. Nilsson. STRIPS: a new approch to the application of theorem proving to problem solving. Artificial Intelligence 2(3/4): 189–208.

    Google Scholar 

  6. J. Hertzberg. Planen: Einführung in die Planerstellungsmethoden der Künstlichen Intelligenz. BI-Verlag, 1989.

    Google Scholar 

  7. C. A. Knoblock. Automatically generating abstractions for planning. Artificial Intelligence 68(2): 243–302, 1994.

    Google Scholar 

  8. J. Pearl. Heuristics. Addison-Wesley, 1984.

    Google Scholar 

  9. E. D. Sacerdoti. Planning in a hierarchy of abstraction spaces. Artificial Intelligence 5(2): 115–135, 1974.

    Google Scholar 

  10. D. E. Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann Publishers, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science I, Bonn University, Römerstr. 164, D-53117, Bonn, FRG

    Michael Contzen & Knut Möller

Authors
  1. Michael Contzen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Knut Möller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Günther Görz Steffen Hölldobler

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Contzen, M., Möller, K. (1996). Abstraction as a heuristic to guide planning. In: Görz, G., Hölldobler, S. (eds) KI-96: Advances in Artificial Intelligence. KI 1996. Lecture Notes in Computer Science, vol 1137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61708-6_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-61708-6_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61708-2

  • Online ISBN: 978-3-540-70669-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation