Adaptive Discretization using Voronoi Trees for Continuous POMDPs
Marcus Hoerger, Hanna Kurniawati, Dirk Kroese, Nan Ye

TL;DR
This paper introduces ADVT, an adaptive discretization method using Voronoi trees for efficient online solving of high-dimensional continuous POMDPs, improving sampling and action selection.
Contribution
It proposes a novel Voronoi tree-based adaptive discretization combined with Monte Carlo Tree Search for continuous POMDPs, handling high-dimensional spaces effectively.
Findings
ADVT scales better to high-dimensional action spaces.
It outperforms existing solvers in experimental tests.
Efficiently handles continuous observation spaces.
Abstract
Solving continuous Partially Observable Markov Decision Processes (POMDPs) is challenging, particularly for high-dimensional continuous action spaces. To alleviate this difficulty, we propose a new sampling-based online POMDP solver, called Adaptive Discretization using Voronoi Trees (ADVT). It uses Monte Carlo Tree Search in combination with an adaptive discretization of the action space as well as optimistic optimization to efficiently sample high-dimensional continuous action spaces and compute the best action to perform. Specifically, we adaptively discretize the action space for each sampled belief using a hierarchical partition called Voronoi tree, which is a Binary Space Partitioning that implicitly maintains the partition of a cell as the Voronoi diagram of two points sampled from the cell. ADVT uses the estimated diameters of the cells to form an upper-confidence bound on the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference · Machine Learning and Data Classification · Bayesian Methods and Mixture Models
