Reference:

Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, and Mikko Uusitalo. Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations. In J. Balcázar, F. Bonchi, A. Gionis, and M. Sebag, editors, Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), volume 6323 of Lecture Notes in Computer Science, pages 1–16. Springer Berlin / Heidelberg, 2010.

Abstract:

Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightforward optimization of plans (policies) computationally intractable. To solve this, we introduce an efficient POMDP planning algorithm. Many current methods store the policy partly through a set of "value vectors" which is updated at each iteration by planning one step further; the size of such vectors follows the size of the state space, making computation intractable for large POMDPs. We store the policy as a graph only, which allows tractable approximations in each policy update step: for a state space described by several variables, we approximate beliefs over future states with factorized forms, minimizing Kullback-Leibler divergence to the non-factorized distributions. Our other speedup approximations include bounding potential rewards. We demonstrate the advantage of our method in several reinforcement learning problems, compared to four previous methods.

Suggested BibTeX entry:

@inproceedings{pajarinen10,
    author = {Joni Pajarinen and Jaakko Peltonen and Ari Hottinen and Mikko Uusitalo},
    booktitle = {Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD)},
    editor = {Balc\'azar, J. and Bonchi, F. and Gionis, A. and Sebag, M.},
    pages = {1-16},
    publisher = {Springer Berlin / Heidelberg},
    series = {Lecture Notes in Computer Science},
    title = {{Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations}},
    volume = {6323},
    year = {2010},
}