Delete-free Reachability Analysis for Temporal and Hierarchical Planning - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Delete-free Reachability Analysis for Temporal and Hierarchical Planning

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

Dates and versions

hal-01344083 , version 1 (19-07-2016)

Identifiers

  • HAL Id : hal-01344083 , version 1

Cite

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⟩
196 View
98 Download

Share

Gmail Mastodon Facebook X LinkedIn More