An Efficient Dynamic Sampling Policy For Monte Carlo Tree Search

2022-04-26 · Gongbo Zhang, Yijie Peng, Yilong Xu

We consider the popular tree-based search strategy within the framework of reinforcement learning, the Monte Carlo Tree Search (MCTS), in the context of finite-horizon Markov decision process. We propose a dynamic sampling tree policy that efficiently allocates limited computational budget to maximize the probability of correct selection of the best action at the root node of the tree. Experimental results on Tic-Tac-Toe and Gomoku show that the proposed tree policy is more efficient than other competing methods.

📄 PDF Abstract BibTeX arXiv:2204.12043

Code (0)

등록된 구현이 없습니다.

Tasks

reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Is Monte Carlo Tree Search Just Every-Visit Monte Carlo Control?

2026-08-28 · Xianyi Wu arxiv

Monte Carlo Tree Search (MCTS) and every-visit Monte Carlo (MC) control are usually presented as different methods. MCTS is described in the language of search (selection, expansion, simulation, and backup), whereas MC c…

Reinforcement Learning

Learning Position Evaluation Functions Used in Monte Carlo Softmax Search

2019-01-30 · Harukazu Igarashi, Yuichi Morioka, Kazumasa Yamamoto

This paper makes two proposals for Monte Carlo Softmax Search, which is a recently proposed method that is classified as a selective search like the Monte Carlo Tree Search. The first proposal separately defines the node…

Position Reinforcement Learning

Bayesian Optimized Monte Carlo Planning

2020-10-07 · John Mern, Anil Yildiz, Zachary Sunberg, Tapan Mukerji 외

Online solvers for partially observable Markov decision processes have difficulty scaling to problems with large action spaces. Monte Carlo tree search with progressive widening attempts to improve scaling by sampling fr…

Bayesian Optimization

Provably Efficient Long-Horizon Exploration in Monte Carlo Tree Search through State Occupancy Regularization

2024-07-07 · Liam Schramm, Abdeslam Boularias

Monte Carlo tree search (MCTS) has been successful in a variety of domains, but faces challenges with long-horizon exploration when compared to sampling-based motion planning algorithms like Rapidly-Exploring Random Tree…

Motion Planning Robot Navigation

Partially Observable Monte-Carlo Graph Search

2025-07-28 · Yang You, Vincent Thomas, Alex Schutz, Robert Skilton 외 arxiv

Currently, large partially observable Markov decision processes (POMDPs) are often solved by sampling-based online methods which interleave planning and execution phases. However, a pre-computed offline policy is more de…