Proceedings

Point-based value iteration: An anytime algorithm for POMDPs

Download BibTeX Cite

Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1025-1031.

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_s to~h.astic trajectories to choose belief points, and by mamtammg 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, and Sebastian Thrun. 2003. Point-based value iteration: An anytime algorithm for POMDPs. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03. IJCAI, 1025–1031. https://ijcai.org/proceedings/2003/146
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards