Skip to Main content Skip to Navigation
Journal articles

Monotone Temporal Planning: Tractability, Extensions and Applications

Abstract : This paper describes a polynomially-solvable class of temporal planning problems. Polynomiality follows from two assumptions. Firstly, by supposing that each sub-goal fluent can be established by at most one action, we can quickly determine which actions are necessary in any plan. Secondly, the monotonicity of sub-goal 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. We also show that any (temporal) planning problem has a monotone relaxation which can lead to the polynomial-time detection of its unsolvability in certain cases. Indeed we show that our relaxation is orthogonal to relaxations based on the ignore-deletes approach used in classical planning since it preserves deletes and can also exploit temporal information.
Complete list of metadata

Cited literature [86 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (OATAO) Connect in order to contact the contributor
Submitted on : Friday, February 20, 2015 - 8:53:29 AM
Last modification on : Wednesday, June 1, 2022 - 4:29:28 AM
Long-term archiving on: : Thursday, May 21, 2015 - 10:27:49 AM


Files produced by the author(s)



Martin Cooper, Frédéric Maris, Pierre Régnier. Monotone Temporal Planning: Tractability, Extensions and Applications. Journal of Artificial Intelligence Research, Association for the Advancement of Artificial Intelligence, 2014, vol. 50, pp. 447-485. ⟨10.1613/jair.4358⟩. ⟨hal-01118794⟩



Record views


Files downloads