Relaxation of Temporal Planning Problems - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Relaxation of Temporal Planning Problems


Relaxation is ubiquitous in the practical resolution of combinatorial problems. If a valid relaxation of an instance has no solution then the original instance has no solution. A tractable relaxation can be built and solved in polynomial time. The most obvious application is the efficient detection of certain unsolvable instances. We review existing relaxation techniques in temporal planning and propose an alternative relaxation inspired by a tractable class of temporal planning problems. Our approach is orthogonal to relaxations based on the ignore-all-deletes approach used in non-temporal planning. We show that our relaxation can even be applied to non-temporal problems, and can also be used to extend a tractable class of temporal planning problems.
Fichier principal
Vignette du fichier
Cooper_12548.pdf (492.37 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01147301 , version 1 (30-04-2015)


  • HAL Id : hal-01147301 , version 1
  • OATAO : 12548


Martin Cooper, Frédéric Maris, Pierre Régnier. Relaxation of Temporal Planning Problems. International Symposium on Temporal Representation and Reasoning - TIME 2013, Sep 2013, Pensacola, United States. pp. 37-44. ⟨hal-01147301⟩
69 View
123 Download


Gmail Facebook X LinkedIn More