An UCT Approach for Anytime Agent-based Planning

Abstract : {In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-based algorithm which gave very good results in computer games, and especially in Computer Go, with heuristic search in order to obtain an anytime planner that provides partial plans before finding a solution plan, and furthermore finding an optimal plan. The algorithm is evaluated in different classical planning problems and compared to some major planning algorithms. Finally, our results highlight the capacity of MHSP to return partial plans which tend to an optimal plan over the time.
Type de document :
Communication dans un congrès
International Conference on Practical Applications of Agents and Multi-Agent Systems, Apr 2010, Salamanca, Spain. 2010
Liste complète des métadonnées

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

https://hal.inria.fr/hal-00981649
Contributeur : Damien Pellier <>
Soumis le : mardi 22 avril 2014 - 15:44:39
Dernière modification le : mercredi 29 novembre 2017 - 14:49:56
Document(s) archivé(s) le : lundi 10 avril 2017 - 16:31:11

Fichier

paams10.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00981649, version 1

Collections

Citation

Damien Pellier, Bruno Bouzy, Marc Métivier. An UCT Approach for Anytime Agent-based Planning. International Conference on Practical Applications of Agents and Multi-Agent Systems, Apr 2010, Salamanca, Spain. 2010. 〈hal-00981649〉

Partager

Métriques

Consultations de la notice

280

Téléchargements de fichiers

133