Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Damien Pellier Connect in order to contact the contributor
Submitted on : Tuesday, April 22, 2014 - 3:44:39 PM
Last modification on : Saturday, June 25, 2022 - 8:54:24 PM
Long-term archiving on: : Monday, April 10, 2017 - 4:31:11 PM


Files produced by the author(s)


  • HAL Id : hal-00981649, version 1


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⟩



Record views


Files downloads