Constrained total undiscounted continuous-time Markov decision processes

Xianping Guo, Yi Zhang

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


The present paper considers the constrained optimal control problem with total undiscounted criteria for a continuous-time Markov decision process (CTMDP) in Borel state and action spaces. The cost rates are nonnegative. Under the standard compactness and continuity conditions, we show the existence of an optimal stationary policy out of the class of general nonstationary ones. In the process, we justify the reduction of the CTMDP model to a discrete-time Markov decision process (DTMDP) model based on the studies of the undiscounted occupancy and occupation measures. We allow that the controlled process is not necessarily absorbing, and the transition rates are not necessarily separated from zero, and can be arbitrarily unbounded; these features count for the main technical difficulties in studying undiscounted CTMDP models.

Original languageEnglish
Pages (from-to)1694-1736
Number of pages43
Issue number3
Publication statusPublished - Aug 2017

Bibliographical note

Publisher Copyright:
© 2017 ISI/BS.


  • Constrained optimality
  • Continuous-time Markov decision processes
  • Total undiscounted criteria

ASJC Scopus subject areas

  • Statistics and Probability


Dive into the research topics of 'Constrained total undiscounted continuous-time Markov decision processes'. Together they form a unique fingerprint.

Cite this