Monotone Temporal Planning: Tractability, Extensions and Applications - Archive ouverte HAL Access content directly
Journal Articles Journal of Artificial Intelligence Research Year : 2014

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.
Fichier principal
Vignette du fichier
Cooper_13037.pdf (757.05 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01118794 , version 1 (20-02-2015)

Identifiers

Cite

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

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More