Skip to Main content Skip to Navigation
Conference papers

Relaxation of Temporal Planning Problems

Abstract : 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.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (OATAO) Connect in order to contact the contributor
Submitted on : Thursday, April 30, 2015 - 10:08:49 AM
Last modification on : Wednesday, June 1, 2022 - 4:16:29 AM
Long-term archiving on: : Monday, September 14, 2015 - 4:11:30 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads