Region-based value iteration for partially observable Markov decision processes


Journal Article

An approximate region-based value iteration (RBVI) algorithm is proposed to find the optimal policy for a partially observable Markov decision process (POMDP). The proposed RBVI approximates the true polyhedral partition of the belief simplex with an ellipsoidal partition, such that the optimal value function is linear in each of the ellipsoidal regions. The position and shape of each region, as well as the gradient (alpha-vector) of the optimal value function in the region, are parameterized explicitly, and are estimated via efficient expectation maximization (EM) and variational Bayesian EM (VBEM), based on a set of selected sample belief points. The RBVI maintains a much smaller number of alpha-vectors than point-based methods and yields a more parsimonious representation that approximates the true value function in the maximum likelihood (ML) sense. The results on benchmark problems show that the proposed RBVI is comparable in performance to state-of-the-art algorithms, despite of the small number of alpha-vectors that are used.

Duke Authors

Cited Authors

  • Li, H; Liao, X; Carin, L

Published Date

  • October 6, 2006

Published In

  • Icml 2006 Proceedings of the 23rd International Conference on Machine Learning

Volume / Issue

  • 2006 /

Start / End Page

  • 561 - 568

Citation Source

  • Scopus