Quasi-deterministic partially observable Markov decision processes

Abstract

We study a subclass of pomdps, called quasi-deterministic pomdps (qDet- pomdps), characterized by deterministic actions and stochastic observations. While this framework does not model the same general problems as pomdps, they still capture a number of interesting and challenging problems and, in some cases, have interesting properties. By studying the observability available in this subclass, we show that qDet- pomdps may fall many steps in the complexity classes of polynomial hierarchy. © 2009 Springer-Verlag Berlin Heidelberg.