Skip to Main content Skip to Navigation
Conference papers

Monte-Carlo Graph Search: the Value of Merging Similar States

Edouard Leurent 1, 2 Odalric-Ambrym Maillard 1 
1 SEQUEL - Sequential Learning
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : We consider the problem of planning in a Markov Decision Process (MDP) with a generative model and limited computational budget. Despite the underlying MDP transitions having a graph structure, the popular Monte-Carlo Tree Search algorithms such as UCT rely on a tree structure to represent their value estimates. That is, they do not identify together two similar states reached via different trajectories and represented in separate branches of the tree. In this work, we propose a graph-based planning algorithm, which takes into account this state similarity. In our analysis, we provide a regret bound that depends on a novel problem-dependent measure of difficulty, which improves on the original tree-based bound in MDPs where the trajectories overlap, and recovers it otherwise. Then, we show that this methodology can be adapted to existing planning algorithms that deal with stochastic systems. Finally, numerical simulations illustrate the benefits of our approach.
Document type :
Conference papers
Complete list of metadata
Contributor : Edouard Leurent Connect in order to contact the contributor
Submitted on : Tuesday, June 15, 2021 - 12:20:25 PM
Last modification on : Thursday, March 24, 2022 - 3:43:05 AM


Files produced by the author(s)


  • HAL Id : hal-03004124, version 2


Edouard Leurent, Odalric-Ambrym Maillard. Monte-Carlo Graph Search: the Value of Merging Similar States. ACML 2020 - 12th Asian Conference on Machine Learning, Nov 2020, Bangkok / Virtual, Thailand. pp.577 - 602. ⟨hal-03004124v2⟩



Record views


Files downloads