Monte-Carlo Graph Search: the Value of Merging Similar States - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

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

Edouard Leurent
  • Function : Author
  • PersonId : 1038135
Odalric-Ambrym Maillard


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

Dates and versions

hal-03004124 , version 1 (13-11-2020)
hal-03004124 , version 2 (15-06-2021)


  • 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⟩
122 View
143 Download


Gmail Facebook Twitter LinkedIn More