Markovian Decision Processes with Probabilistic Observation of States
Jay Satia, Roy E. Lave
Abstract
Jay Satia, Roy E. Lave
Abstract
This is a study of finite state discrete time discounted Markovian decision process when the states are probabilistically observed. A model of this process is formulated, and an implicit enumeration algorithm is presented which optimizes the total expected discounted reward given the initial state. Several numerical examples are presented.
OpenAlex reports 46 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This is a study of finite state discrete time discounted Markovian decision process when the states are probabilistically observed. A model of this process is formulated, and an implicit enumeration algorithm is presented which optimizes the total expected discounted reward given the initial state. Several numerical examples are presented.
Key concepts: Probabilistic logic, Markov process, Markov decision process, Enumeration, State (computer science), Mathematical optimization, Process (computing), Applied mathematics