Skip to main content

Search and Inference in AI Planning

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNPSE,volume 3709)

Abstract

While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more established empirical methodology. In this invited talk, I will focus on Optimal Planning where these new ideas can be understood along two dimensions: branching and pruning. Both heuristic search planners, and SAT and CSP planners can be understood in this way, with the latter branching on variables and pruning by constraint propagation, and the former branching on actions and pruning by lower bound estimations. The two formulations, however, have a lot in common, and some key planners such as Graphplan can be understood in either way: as computing a lower bound function and searching backwards from the goal, or as performing a precise, bounded form of variable elimination, followed by backtracking. The main limitation of older, so-called Partial Ordered Causal Link (POCL) planners, is that they provide smart branching schemes, in particular for temporal planning, but weak pruning rules. Indeed, the computation and even the formulation of good lower bounds for POCL plans is far from trivial. However, the pruning that cannot be obtained by the use of good monolithic lower bounds, can often be achieved by simple propagation rules over a suitable constraint-based formulation. We show this to be the case for CPT, currently the best domain-independent temporal planner, and then explore briefly further branching and pruning variations in parallel and conformant planning.

Keywords

  • Planning Graph
  • Heuristic Function
  • Planning Theory
  • Temporal Planning
  • Variable Elimination

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/11564751_1
  • Chapter length: 4 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   149.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-32050-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   189.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Geffner, H.: Perspectives on AI Planning. In: Proc. AAAI 2002, pp. 1013–1023 (2002)

    Google Scholar 

  2. Haslum, P., Geffner, H.: Admissible heuristics for optimal planning. In: Proc. AIPS 2000, pp. 70–82 (2000)

    Google Scholar 

  3. Kautz, H., Selman, B.: Pushing the envelope: Planning, propositional logic, and stochastic search. In: Proc. AAAI 1996, pp. 1194–1201 (1996)

    Google Scholar 

  4. Kautz, H., Selman, B.: Unifying SAT-based and Graph-based planning. Proc. IJCAI 1999, pp. 318–327 (1999)

    Google Scholar 

  5. Blum, A., Furst, M.: Fast planning through planning graph analysis. In: Proceedings of IJCAI 1995, Morgan Kaufmann, pp. 1636–1642. Morgan Kaufmann, San Francisco (1995)

    Google Scholar 

  6. Dechter, R.: Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113, 41–85 (1999)

    MATH  CrossRef  MathSciNet  Google Scholar 

  7. Geffner, H.: Planning graphs and knowledge compilation. In: Proc. KR 2004, pp. 662–672 (2004)

    Google Scholar 

  8. Weld, D.S.: An introduction to least commitment planning. AI Magazine 15 (1994)

    Google Scholar 

  9. Smith, D., Frank, J., Jonsson, A.: Bridging the gap between planning and scheduling. Knowledge Engineering Review 15, 61–94 (2000)

    CrossRef  Google Scholar 

  10. Vidal, V., Geffner, H.: Branching and pruning: An optimal temporal POCL planner based on constraint programming. In: Proc. AAAI 2004, pp. 570–577 (2004)

    Google Scholar 

  11. Vidal, V., Geffner, H.: Solving simple planning problems with more inference and no search. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 682–696. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  12. Hoffmann, J., Geffner, H.: Branching matters: Alternative branching in graphplan. In: Proc. ICAPS 2003, pp. 22–31 (2003)

    Google Scholar 

  13. Palacios, H., Bonet, B., Darwiche, A., Geffner, H.: Pruning conformant plans by counting models on compiled d-DNNF representations. In: Proc. ICAPS 2005 (2005)

    Google Scholar 

  14. Darwiche, A.: Decomposable negation normal form. J. ACM 48, 608–647 (2001)

    MATH  CrossRef  MathSciNet  Google Scholar 

  15. Dechter, R.: Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence 41, 273–312 (1990)

    CrossRef  MathSciNet  Google Scholar 

  16. Bonet, B., Geffner, H.: Learning in DFS: A unified approach to heuristic search in deterministic, non-deterministic, probabilistic, and game tree settings (2005)

    Google Scholar 

  17. Dechter, R.: AND/OR Search spaces for Graphical models. TR (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Geffner, H. (2005). Search and Inference in AI Planning. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_1

Download citation

  • DOI: https://doi.org/10.1007/11564751_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29238-8

  • Online ISBN: 978-3-540-32050-0

  • eBook Packages: Computer ScienceComputer Science (R0)