Skip to Main content Skip to Navigation
Conference papers

Delete-free Reachability Analysis for Temporal and Hierarchical Planning

Arthur Bit-Monnot 1 David E. Smith 2 Minh Do 2 
1 LAAS-RIS - Équipe Robotique et InteractionS
LAAS - Laboratoire d'analyse et d'architecture des systèmes
Abstract : Reachability analysis is a crucial part of the heuristic computation for many state of the art classical and temporal planners. In this paper, we study the difficulty that arises in assessing the reachability of actions in planning problems containing sets of interdependent actions, notably including problems with required concur-rency as well as hierarchical planning problems. We show the limitation of state-of-the-art techniques and propose a new method suitable for both temporal and hierarchical planning problems. Our proposal is evaluated on FAPE, a constraint-based temporal planner.
Document type :
Conference papers
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download
Contributor : Arthur Bit-Monnot Connect in order to contact the contributor
Submitted on : Tuesday, July 19, 2016 - 11:45:09 AM
Last modification on : Monday, July 4, 2022 - 9:31:38 AM


Files produced by the author(s)


  • HAL Id : hal-01344083, version 1


Arthur Bit-Monnot, David E. Smith, Minh Do. Delete-free Reachability Analysis for Temporal and Hierarchical Planning. 22nd European Conference on Artificial Intelligence (ECAI), Aug 2016, La Haye, Netherlands. ⟨hal-01344083⟩



Record views


Files downloads