Skip to main content
SpringerLink
Log in
Book cover

International Conference on Principles and Practice of Constraint Programming

CP 2007: Principles and Practice of Constraint Programming – CP 2007 pp 651–665Cite as

An LP-Based Heuristic for Optimal Planning

  • Conference paper

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

Abstract

One of the most successful approaches in automated planning is to use heuristic state-space search. A popular heuristic that is used by a number of state-space planners is based on relaxing the planning task by ignoring the delete effects of the actions. In several planning domains, however, this relaxation produces rather weak estimates to guide search effectively. We present a relaxation using (integer) linear programming that respects delete effects but ignores action ordering, which in a number of problems provides better distance estimates. Moreover, our approach can be used as an admissible heuristic for optimal planning.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bäckström, C., Nebel, B.: Complexity results for SAS+ planning. Computational Intelligence 11(4), 625–655 (1995)

    Article  MathSciNet  Google Scholar 

  2. Benton, J., van den Briel, M.H.L., Kambhampati, S.: A hybrid linear programming and relaxed plan heuristic for partial satisfaction planning problems. In: Proceedings of the 17th International Conference on Automated Planning and Scheduling (to appear, 2007)

    Google Scholar 

  3. Blum, A., Furst, M.: Fast planning through planning graph analysis. In: Proceedings of the 14th International Joint Conference on Artificial Inteligence, pp. 1636–1642 (1995)

    Google Scholar 

  4. Bonet, B., Loerincs, G., Geffner, H.: A fast and robust action selection mechanism for planning. In: Proceedings of the 14th National Conference on Artificial Intelligence, pp. 714–719 (1997)

    Google Scholar 

  5. Bonet, B., Geffner, H.: Planning as heuristic search. Aritificial Intelligence 129(1), 5–33 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Botea, A., Müller, M., Schaeffer, J.: Fast planning with iterative macros. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 1828–1833 (2007)

    Google Scholar 

  7. van den Briel, M.H.L., Kambhampati, S., Vossen, T.: Reviving integer programming Approaches for AI planning: A branch-and-cut framework. In: Proceedings of the 15th International Conference on Automated Planning and Scheduling, pp. 310–319 (2005)

    Google Scholar 

  8. Bylander, T.: The computational complexity of propositional STRIPS planning. Artificial Intelligence 26(1-2), 165–204 (1995)

    MathSciNet  Google Scholar 

  9. Bylander, T.: A linear programming heuristic for optimal planning. In: Proceedings of the 14th National Conference on Artificial Intelligence, pp. 694–699 (1997)

    Google Scholar 

  10. Cassandras, C.G., Lafortune, S.: Introduction to Discrete Event Systems. Kluwer Academic Publishers, Dordrecht (1999)

    MATH  Google Scholar 

  11. ILOG Inc.: ILOG CPLEX 8.0 user’s manual. Mountain View, CA (2002)

    Google Scholar 

  12. Haslum, P., Geffner, H.: Admissible heuristics for optimal planning. In: Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (2000)

    Google Scholar 

  13. Helmert, M.: The Fast Downward planning system. Journal of Artificial Intelligence Research 26, 191–246 (2006)

    Google Scholar 

  14. Hoffmann, J.: Where ”ignoring delete lists” works: Local search topology in planning benchmarks. Journal of Artificial Intelligence Research 24, 685–758 (2005)

    MATH  Google Scholar 

  15. Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14, 253–302 (2001)

    MATH  Google Scholar 

  16. Jonsson, P., Bäckström, C.: Tractable plan existence does not imply tractable plan generation. Annals of Mathematics and Artificial Intelligence 22(3), 281–296 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  17. McDermott, D.: A heuristic estimator for means-ends analysis in planning. In: Proceedings of the 3rd International Conference on Artificial Intelligence Planning Systems, pp. 142–149 (1996)

    Google Scholar 

  18. McDermott, D.: Using regression-match graphs to control search in planning. Artificial Intelligence 109(1-2), 111–159 (1999)

    Article  MATH  Google Scholar 

  19. Rintanen, J., Heljanko, K., Niemelä, I.: Planning as satisfiability: parallel plans and algorithms for plan search. Albert-Ludwigs-Universität Freiburg, Institut für Informatik, Technical report 216 (2005)

    Google Scholar 

  20. Vidal, V.: A lookahead strategy for heuristic search planning. In: Proceedings of the 14th International Conference on Automated Planning and Scheduling, pp. 150–159 (2004)

    Google Scholar 

  21. Vossen, T., Ball, B., Lotem, A., Nau, D.S.: On the use of integer programming models in AI planning. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence, pp. 304–309 (1999)

    Google Scholar 

  22. Williams, B.C., Nayak, P.P.: A reactive planner for a model-based executive. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence, pp. 1178–1195 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Arizona State University, Department of Industrial Engineering,  

    Menkes van den Briel

  2. Department of Computer Science and Engineering, Tempe AZ, 85287, USA

    J. Benton & Subbarao Kambhampati

  3. University of Colorado, Leeds School of Business, Boulder CO, 80309, USA

    Thomas Vossen

Authors
  1. Menkes van den Briel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Benton
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Subbarao Kambhampati
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Thomas Vossen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Bessière

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van den Briel, M., Benton, J., Kambhampati, S., Vossen, T. (2007). An LP-Based Heuristic for Optimal Planning. In: Bessière, C. (eds) Principles and Practice of Constraint Programming – CP 2007. CP 2007. Lecture Notes in Computer Science, vol 4741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74970-7_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74970-7_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74969-1

  • Online ISBN: 978-3-540-74970-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation