Constrained total undiscounted continuous-time Markov decision processes

Guo, X and Zhang, Y ORCID: 0000-0002-3200-6306 (2017) Constrained total undiscounted continuous-time Markov decision processes. Bernoulli, 23 (3). pp. 1694-1736.

Text BEJ793.pdf - Author Accepted Manuscript Download (406kB)

Abstract

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.

Item Type:	Article
Uncontrolled Keywords:	constrained optimality, continuous-time Markov decision processes, total undiscounted criteria
Depositing User:	Symplectic Admin
Date Deposited:	24 Sep 2018 10:17
Last Modified:	15 Mar 2024 11:13
DOI:	10.3150/15-BEJ793
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3026667

Available Versions of this Item

• Constrained total undiscounted continuous-time Markov decision processes. (deposited 01 Jul 2016 15:15)
  • Constrained total undiscounted continuous-time Markov decision processes. (deposited 24 Sep 2018 10:17) [Currently Displayed]