Skip to main content
SpringerLink
Log in

Complexity of Interval Relaxed Numeric Planning

  • Conference paper
  • First Online:
KI 2015: Advances in Artificial Intelligence (KI 2015)

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

Abstract

Automated planning is computationally hard even in its most basic form as STRIPS planning. We are interested in numeric planning with instantaneous actions, a problem that is not decidable in general. Relaxation is an approach to simplifying complex problems in order to obtain guidance in the original problem. We present a relaxation approach with intervals for numeric planning and show that plan existence can be decided in polynomial time for tasks where dependencies between numeric effects are acyclic.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aldinger, J., Mattmüller, R., Göbelbecker, M.: Complexity issues of interval relaxed numeric planning. In: Proceedings of the ICAPS-15 Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP 2015), pp. 4–12 (2015)

    Google Scholar 

  2. Bäckström, C., Nebel, B.: Complexity results for SAS \(^+\) planning. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI 1993), pp. 1430–1435 (1993)

    Google Scholar 

  3. Bofill, M., Arxer, J.E., Villaret, M.: The RANTANPLAN planner: system description. In: Proceedings of the ICAPS-15 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAPS 2015), pp. 1–10 (2015)

    Google Scholar 

  4. Bylander, T.: The Computational Complexity of Propositional STRIPS Planning. Artificial Intelligence 69, 165–204 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  5. Coles, A., Fox, M., Long, D., Smith, A.: A hybrid relaxed planning graph-LP heuristic for numeric planning domains. In: Proceedings of the 20th International Conference on Automated Planning and Search (ICAPS 2008), pp. 52–59 (2008)

    Google Scholar 

  6. Fox, M., Long, D.: PDDL2.1 : An Extension to PDDL for Expressing Temporal Planning Domains. Journal of Artificial Intelligence Research (JAIR) 20, 61–124 (2003)

    MATH  Google Scholar 

  7. Helmert, M.: Decidability and undecidability results for planning with numerical state variables. In: Proceedings of the 6th International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002), pp. 303–312 (2002)

    Google Scholar 

  8. Hoffmann, J.: The Metric-FF Planning System: Translating ‘Ignoring Delete Lists’ to Numeric State Variables. Journal of Artificial Intelligence Research (JAIR) 20, 291–341 (2003)

    MATH  Google Scholar 

  9. Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis. Society for Industrial and Applied Mathematics (2009)

    Google Scholar 

  10. Young, R.C.: The Algebra of Many-valued Quantities. Mathematische Annalen 104, 260–290 (1931)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Für Informatik, Albert-Ludwigs-Universität, 79110, Freiburg, Germany

    Johannes Aldinger, Robert Mattmüller & Moritz Göbelbecker

Authors
  1. Johannes Aldinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert Mattmüller
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Moritz Göbelbecker
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Johannes Aldinger .

Editor information

Editors and Affiliations

  1. Technische Universität Dresden, Dresden, Germany

    Steffen Hölldobler

  2. Technische Universität Dresden, Dresden, Germany

  3. Free University Bozen-Bolzano, Bozen-Bolzano, Italy

    Rafael Peñaloza

  4. Technische Universität Dresden, Dresden, Germany

    Sebastian Rudolph

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Aldinger, J., Mattmüller, R., Göbelbecker, M. (2015). Complexity of Interval Relaxed Numeric Planning. In: Hölldobler, S., , Peñaloza, R., Rudolph, S. (eds) KI 2015: Advances in Artificial Intelligence. KI 2015. Lecture Notes in Computer Science(), vol 9324. Springer, Cham. https://doi.org/10.1007/978-3-319-24489-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24489-1_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24488-4

  • Online ISBN: 978-3-319-24489-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation