Problem splitting using heuristic search in landmark orderings

Abstract : In this paper, we revisit the idea of splitting a planning problem into subproblems hopefully easier to solve with the help of landmark analysis. While this technique initially proposed in the first approaches related to landmarks has been outperformed by landmark-based heuristics, we believe that it is still a promising research direction. To this end, we propose a new method for problem splitting based on landmarks which has two advantages over the original technique: it is complete (if a solution exists, the algorithm finds it), and it uses the precedence relation over the landmarks in a more flexible way. We lay in this paper the foundations of a meta best-first search algorithm, which explores the landmark orderings to create subproblems and can use any embedded planner to solve subproblems. It opens up avenues for future research: among them are new heuristics for guiding the meta search towards the most promising orderings, different policies for generating subproblems, and influence of the embedded subplanner.
Type de document :
Communication dans un congrès
Francesca Rossi, University of Padova. Twenty-Third International Joint Conference on Artificial Intelligence, Aug 2013, Beijing, China. pp.2401-2407, 2013
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal-onera.archives-ouvertes.fr/hal-01002115
Contributeur : Alain Broc <>
Soumis le : vendredi 6 juin 2014 - 16:44:49
Dernière modification le : mercredi 28 mars 2018 - 14:16:10
Document(s) archivé(s) le : samedi 6 septembre 2014 - 10:58:15

Fichier

ijcai13a.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01002115, version 1

Collections

Citation

S. Vernhes, G. Infantes, V. Vidal. Problem splitting using heuristic search in landmark orderings. Francesca Rossi, University of Padova. Twenty-Third International Joint Conference on Artificial Intelligence, Aug 2013, Beijing, China. pp.2401-2407, 2013. 〈hal-01002115〉

Partager

Métriques

Consultations de la notice

201

Téléchargements de fichiers

351