Region-Based Approximations for Planning in Stochastic Domains
Abstract
This paper is concerned with planning in stochastic domains by means of partially observable Markov decision processes (POMDPs). POMDPs are difficult to solve. This paper identifies a subclass of POMDPs called region observable POMDPs, which are easier to solve and can be used to approximate general POMDPs to arbitrary accuracy.
- Publication:
-
arXiv e-prints
- Pub Date:
- February 2013
- DOI:
- 10.48550/arXiv.1302.1573
- arXiv:
- arXiv:1302.1573
- Bibcode:
- 2013arXiv1302.1573L
- Keywords:
-
- Computer Science - Artificial Intelligence
- E-Print:
- Appears in Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence (UAI1997)