Search Results for author:
Found 5 papers, 4 papers with code
A Surprisingly Simple Continuous-Action POMDP Solver: Lazy Cross-Entropy Search Over Policy Trees
At each planning step, our method uses a novel lazy Cross-Entropy method to search the space of policy trees, which provide a simple policy representation.
A Flow-Based Generative Model for Rare-Event Simulation
Solving decision problems in complex, stochastic environments is often achieved by estimating the expected outcome of decisions via Monte Carlo sampling.
Adaptive Discretization using Voronoi Trees for Continuous POMDPs
ADVT uses the estimated diameters of the cells to form an upper-confidence bound on the action value function within the cell, guiding the Monte Carlo Tree Search expansion and further discretization of the action space.
Adaptive Discretization using Voronoi Trees for Continuous-Action POMDPs
A Voronoi tree is a Binary Space Partitioning (BSP) that implicitly maintains the partition of a cell as the Voronoi diagram of two points sampled from the cell.
An On-Line POMDP Solver for Continuous Observation Spaces
Most on-line solvers rely on discretising the observation space or artificially limiting the number of observations that are considered during planning to compute tractable policies.
