Abstract
We describe a polynomially-solvable class of temporal planning problems. Polynomiality follows from two assumptions. Firstly, by supposing that each fluent (fact) can be established by at most one action, we can quickly determine which actions are necessary in any plan. Secondly, the monotonicity of fluents allows us to express planning as an instance of STP ≠ (Simple Temporal Problem with difference constraints). This class includes temporally-expressive problems requiring the concurrent execution of actions, with potential applications in the chemical, pharmaceutical and construction industries. Any (temporal) planning problem has a monotone relaxation, which can lead to the polynomial-time detection of its unsolvability in certain cases. Indeed our relaxation is orthogonal to the relaxation based on ignoring deletes used in classical planning since it preserves deletes and can also exploit temporal information.
This is a summary of the paper Cooper M.C., Maris F., Régnier P., Monotone Temporal Planning: Tractability, Extensions and Applications, JAIR 50, 447-485, 2014. This research is supported by ANR Project ANR-10-BLAN-0210.
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.
References
Bylander, T.: The Computational Complexity of Propositional STRIPS Planning. Artificial Intelligence 69(1-2), 165–204 (1994)
Cooper, M.C., Maris, F., Régnier, P.: Tractable monotone temporal planning. In: Proceedings ICAPS 2012, pp. 20–28 (2012)
Cooper, M.C., Maris, F., Régnier, P.: Relaxation of Temporal Planning Problems. In: International Symposium on Temporal Representation and Reasoning (TIME), pp. 37–44 (2013)
Cooper, M.C., Maris, F., Régnier, P.: Monotone Temporal Planning: Tractability, Extensions and Applications. JAIR 50, 447–485 (2014), http://www.irit.fr/publis/ADRIA/MonotoneJAIR.pdf
Cushing, W., Kambhampati, S., Mausam, W.D.S.: When is Temporal Planning Really Temporal? In: Proc. International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 1852–1859 (2007)
Gerevini, A., Cristani, M.: On Finding a Solution in Temporal Constraint Satisfaction Problems. In: Proc. International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 1460–1465 (1997)
Karpas, E., Domshlak, C.: Cost-optimal planning with landmarks. In: Proc. International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 1728–1733 (2009)
Rintanen, J.: Complexity of Concurrent Temporal Planning. In: Proc. 17th International Conference on Automated Planning and Scheduling (ICAPS 2007), pp. 280–287 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Cooper, M.C., Maris, F., Régnier, P. (2014). Monotone Temporal Planning: Tractability, Extensions and Applications. In: O’Sullivan, B. (eds) Principles and Practice of Constraint Programming. CP 2014. Lecture Notes in Computer Science, vol 8656. Springer, Cham. https://doi.org/10.1007/978-3-319-10428-7_69
Download citation
DOI: https://doi.org/10.1007/978-3-319-10428-7_69
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10427-0
Online ISBN: 978-3-319-10428-7
eBook Packages: Computer ScienceComputer Science (R0)