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 [Toulouse]
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.
Type de document :
Communication dans un congrès
22nd European Conference on Artificial Intelligence (ECAI), Aug 2016, La Haye, Netherlands. 2016, Proceedings of the 22nd European Conference on Artificial Intelligence
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01344083
Contributeur : Arthur Bit-Monnot <>
Soumis le : mardi 19 juillet 2016 - 11:45:09
Dernière modification le : mardi 10 janvier 2017 - 15:11:47

Fichier

reachability-analysis-ecai.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01344083, version 1

Citation

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. 2016, Proceedings of the 22nd European Conference on Artificial Intelligence. <hal-01344083>

Partager

Métriques

Consultations de
la notice

101

Téléchargements du document

43