A Model Approximation Scheme for Planning in Partially Observable Stochastic Domains
<|reference_start|>A Model Approximation Scheme for Planning in Partially Observable Stochastic Domains: Partially observable Markov decision processes (POMDPs) are a natural model for planning problems where effects of actions are nondeterministic and the state of the world is not completely observable. It is difficult to solve POMDPs exactly. This paper proposes a new approximation scheme. The basic idea is to transform a POMDP into another one where additional information is provided by an oracle. The oracle informs the planning agent that the current state of the world is in a certain region. The transformed POMDP is consequently said to be region observable. It is easier to solve than the original POMDP. We propose to solve the transformed POMDP and use its optimal policy to construct an approximate policy for the original POMDP. By controlling the amount of additional information that the oracle provides, it is possible to find a proper tradeoff between computational time and approximation quality. In terms of algorithmic contributions, we study in details how to exploit region observability in solving the transformed POMDP. To facilitate the study, we also propose a new exact algorithm for general POMDPs. The algorithm is conceptually simple and yet is significantly more efficient than all previous exact algorithms.<|reference_end|>
@article{zhang1997a,
    title={A Model Approximation Scheme for Planning in Partially Observable
  Stochastic Domains},
    author={N. L. Zhang, W. Liu},
    journal={Journal of Artificial Intelligence Research, Vol 7, (1997),
  199-230},
    year={1997},
    archivePrefix={arXiv},
    eprint={cs/9711103},
    primaryClass={cs.AI}
}