ML Anthology

Point-Based Value Iteration: An Anytime Algorithm for POMDPs

Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
IJCAI 2003 pp. 1025-1032
/ijcai/2003/pineau2003ijcai-point/

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.

PDF Semantic Scholar

Cite

Text

Pineau et al. "Point-Based Value Iteration: An Anytime Algorithm for POMDPs." International Joint Conference on Artificial Intelligence, 2003.

Markdown

[Pineau et al. "Point-Based Value Iteration: An Anytime Algorithm for POMDPs." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/pineau2003ijcai-point/)

BibTeX

@inproceedings{pineau2003ijcai-point,
  title     = {{Point-Based Value Iteration: An Anytime Algorithm for POMDPs}},
  author    = {Pineau, Joelle and Gordon, Geoffrey J. and Thrun, Sebastian},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2003},
  pages     = {1025-1032},
  url       = {https://mlanthology.org/ijcai/2003/pineau2003ijcai-point/}
}