The Optimal Observability of Partially Observable Markov Decision Processes: Discrete State Space
MetadataShow full item record
We consider autonomous partially observable Markov decision processes where the control action influences the observation process only. Considering entropy as the cost incurred by the Markov information state process, the optimal observability problem is posed as a Markov decision scheduling problem that minimizes the infinite horizon cost. This scheduling problem is shown to be equivalent to minimization of an entropy measure, called estimation entropy which is related to the invariant measure of the information state.
Showing items related by title, author, creator and subject.
Carli, F.; Ferrante, Augusto; Pavon, M.; Picci, G. (2011)Stationary reciprocal processes defined on a finite interval of the integer line can be seen as a special class of Markov random fields restricted to one dimension. Nonstationary reciprocal processes have been extensively ...
Carli, F.; Ferrante, Augusto; Pavon, M.; Picci, G. (2011)The present paper deals with maximum entropy completion of partially specified banded block-circulant matrices. This problem has many applications in signal processing since circulants happen to be covariance matrices of ...
Xia, Jianhong (Cecilia); Zeephongsekul, P. (2009)Tourist movement is a complex process, but it provides very useful information for park managers and tourist operators. This paper aims to establish a sound methodology for modelling the spatial and temporal movement of ...