Delete-Free Reachability Analysis for Temporal and Hierarchical Planning

Arthur Bit-Monnot, David E. Smith, Minh Do

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 concurrency 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. A long version of this paper was presented at the HSDIP workshop [1].