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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
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)
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)
Bylander, T.: The Computational Complexity of Propositional STRIPS Planning. Artificial Intelligence 69, 165–204 (1994)
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)
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)
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)
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)
Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis. Society for Industrial and Applied Mathematics (2009)
Young, R.C.: The Algebra of Many-valued Quantities. Mathematische Annalen 104, 260–290 (1931)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)