An UCT Approach for Anytime Agent-based Planning - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

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

Dates and versions

hal-00981649 , version 1 (22-04-2014)

Identifiers

  • HAL Id : hal-00981649 , version 1

Cite

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. ⟨hal-00981649⟩

Collections

LIPADE UP-SCIENCES
249 View
482 Download

Share

Gmail Facebook Twitter LinkedIn More