The paper proves finite-time probabilistic bounds on value estimates for MCTS in both discrete and continuous POMDPs and introduces Voro-POMCPOW with adaptive partitioning for guarantees.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Finite-Time Analysis of MCTS in Continuous POMDP Planning
The paper proves finite-time probabilistic bounds on value estimates for MCTS in both discrete and continuous POMDPs and introduces Voro-POMCPOW with adaptive partitioning for guarantees.