Point-based value iteration: An anytime algorithm for POMDPs.

J. Pineau, G. Gordon, and S. Thrun.

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.

The full paper is available in PDF and gzipped Postscript

@INPROCEEDINGS{Pineau03a,
  AUTHOR	= {J. Pineau and G. Gordon and S. Thrun},
  TITLE		= {Point-based Value Iteration: An Anytime Algorithm for {POMDPs}},
  YEAR		= {2003},
  BOOKTITLE     = {Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI)},
  ORGANIZATION	= {IJCAI},
  ADDRESS	= {Acapulco, Mexico}
}