Algorithms for partially observable Markov decision processes
The thesis develops methods to solve discrete-time finite-state partially observable Markov decision processes. For the infinite horizon problem, only discounted reward case is considered. Several new algorithms for the finite horizon and the infinite horizon problems are developed. For the finite...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
University of British Columbia
2010
|
| Online Access: | http://hdl.handle.net/2429/29073 |