Skip to main content
SpringerLink
Log in
Book cover

International Conference on Principles and Practice of Constraint Programming

CP 2006: Principles and Practice of Constraint Programming - CP 2006 pp 680–684Cite as

Soft Arc Consistency Applied to Optimal Planning

  • Conference paper

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

Abstract

We show in this article how the Weighted CSP framework can be used to solve an optimisation version of numerical planning. The WCSP finds an optimal plan in the planning graph containing all solution plans of minimum length. Experimental trials were performed to study the impact of soft arc consistency techniques (FDAC and EDAC) on the efficiency of the search for an optimal plan in this graph. We conclude by giving a possible theoretical explanation for the fact that we were able to solve optimisation problems involving several hundred variables.

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. Blum, A., Furst, M.: Fast planning through planning graph analysis. AI 90, 281–300 (1997)

    MATH  Google Scholar 

  2. Cooper, M.C.: Reduction operations in fuzzy and valued constraint satisfaction. Fuzzy Sets and Systems 134, 311–342 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. de Givry, S., Heras, F., Zytnicki, M., Larrosa, J.: Existential arc consistency: Getting closer to full arc consistency in weighted CSPs. In: IJCAI 2005, pp. 84–89 (2005)

    Google Scholar 

  4. Do, M., Kambhampati, S.: Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP. AI 132, 151–182 (2001)

    MATH  MathSciNet  Google Scholar 

  5. Haslum, P., Geffner, H.: Heuristic Planning with Time and Resources. In: European Conference on Planning (2001)

    Google Scholar 

  6. Hoffmann, J.: The Metric-FF Planning System: Translating Ignoring Delete Lists to Numeric State Variables. JAIR 20, 291–341 (2003)

    MATH  Google Scholar 

  7. Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for Weighted CSP. In: IJCAI 2003, pp. 239–244 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRIT, 118 route de Narbonne, 31062 cedex 9, Toulouse, France

    Martin Cooper, Sylvain Cussat-Blanc, Marie de Roquemaurel & Pierre Régnier

Authors
  1. Martin Cooper
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sylvain Cussat-Blanc
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marie de Roquemaurel
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Pierre Régnier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LINA UMR CNRS 6241, University of Nantes,  

    Frédéric Benhamou

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cooper, M., Cussat-Blanc, S., de Roquemaurel, M., Régnier, P. (2006). Soft Arc Consistency Applied to Optimal Planning. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_50

Download citation

  • DOI: https://doi.org/10.1007/11889205_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46267-5

  • Online ISBN: 978-3-540-46268-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation