Sciweavers

Share
IJCAI
2003

Point-based value iteration: An anytime algorithm for POMDPs

11 years 29 days ago
Point-based value iteration: An anytime algorithm for POMDPs
This paper introduces the Point-Based Value Iteration (PBVI) algorithm for POMDP planning. PBVI approximates an exact value iteration solution by selecting a small set of representative belief points and then tracking the value and its derivative for those points only. By using stochastic trajectories to choose belief points, and by maintaining only one value hyper-plane per point, PBVI successfully solves large problems: we present results on a robotic laser tag problem as well as three test domains from the literature.
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2003
Where IJCAI
Authors Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
Comments (0)
books