This paper discusses continuous time Markov decision processes with criterion of expected discounted total rewards, where the state space is countable, the reward rate function is extended real-valued and the discount rate is a real number. Under necessary conditions that the model is well defined, the state space is partitioned into three subsets, on which the optimal value function is positive infinity, negative infinity, or finite, respectively. Correspondingly, the model is reduced into three submodels, by generalizing policies and eliminating some worst actions. Then for the submodel with finite optimal value, the validity of the optimality equation is shown and some its properties are obtained. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Hu, Q., Liu, J., & Yue, W. (2003). Continuous time Markov decision processes with expected discounted total rewards. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2658, 64–73. https://doi.org/10.1007/3-540-44862-4_8
Mendeley helps you to discover research relevant for your work.