OTHER
Point-based value iteration: an anytime algorithm for POMDPs
Joëlle Pineau, Geoff Gordon, Sebastian Thrun
- Year
- 2003
- Citations
- 934
Abstract
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.
Keywords
Markov decision processValue (mathematics)Computer sciencePartially observable Markov decision processMathematical optimizationSet (abstract data type)Point (geometry)AlgorithmMathematicsMarkov process
Related papers
OTHER
📊 26,957 cites
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
PERCEPTION
📊 22,245 cites
Artificial intelligence: a modern approach
1995
OTHER
Open access📊 20,501 cites
Fractional Differential Equations
Igor Podlubný
2025
OTHER
📊 18,993 cites
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991