Convex Hull Monte-Carlo tree search
This work investigates Monte-Carlo planning for agents in stochastic environments, with multiple objectives. We propose the Convex Hull Monte-Carlo Tree-Search (CHMCTS) framework, which builds upon Trial Based Heuristic Tree Search and Convex Hull Value Iteration (CHVI), as a solution to multi-objec...
Main Authors: | Painter, M, Lacerda, B, Hawes, N |
---|---|
Format: | Conference item |
Language: | English |
Published: |
AAAI Press
2020
|
Similar Items
-
Monte Carlo tree search with Boltzmann exploration
by: Painter, M, et al.
Published: (2023) -
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)