Monte Carlo tree search with Boltzmann exploration
Monte-Carlo Tree Search (MCTS) methods, such as Upper Confidence Bound applied to Trees (UCT), are instrumental to automated planning techniques. However, UCT can be slow to explore an optimal action when it initially appears inferior to other actions. Maximum ENtropy Tree-Search (MENTS) incorporate...
Main Authors: | Painter, M, Baioumy, M, Hawes, N, Lacerda, B |
---|---|
Format: | Conference item |
Language: | English |
Published: |
Curran Associates
2023
|
Similar Items
-
Convex Hull Monte-Carlo tree search
by: Painter, M, et al.
Published: (2020) -
Nonasymptotic Analysis of Monte Carlo Tree Search
by: Shah, Devavrat, et al.
Published: (2022) -
Non-Asymptotic Analysis of Monte Carlo Tree Search
by: Shah, Devavrat, et al.
Published: (2022) -
Distributed Monte Carlo Tree Search With Applications To Chip Design
by: Jones, Cooper
Published: (2023) -
Monte Carlo Tree Search Applications to Neural Theorem Proving
by: LaBelle, Ethan
Published: (2024)