Optimality Of Randomized Trunk Reservation For A Problem With Multiple Constraints
Probability in the Engineering and Informational Sciences
Continuous-Time Markov Decision Processes with Discounted Rewards: The Case of Polish Spaces
Mathematics of Operations Research
Brief paper: Towards the optimal control of Markov chains with constraints
Automatica (Journal of IFAC)
Average Continuous Control of Piecewise Deterministic Markov Processes
SIAM Journal on Control and Optimization
Mathematics of Operations Research
SIAM Journal on Control and Optimization
A characterization of meaningful schedulers for continuous-time markov decision processes
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Stochastic reasoning about channel-based component connectors
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
SIAM Journal on Control and Optimization
Continuous-Time Markov Decision Processes with State-Dependent Discount Factors
Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications
Bisimulation and logical preservation for continuous-time markov decision processes
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games
Theoretical Computer Science
| Hi-index | 0.00 |
This paper introduces and develops a new approach to the theory of continuous time jump Markov decision processes (CTJMDP). This approach reduces discounted CTJMDPs to discounted semi-Markov decision processes (SMDPs) and eventually to discrete-time Markov decision processes (MDPs). The reduction is based on the equivalence of strategies that change actions between jumps and the randomized strategies that change actions only at jump epochs. This holds both for one-criterion problems and for multiple-objective problems with constraints. In particular, this paper introduces the theory for multiple-objective problems with expected total discounted rewards and constraints. If a problem is feasible, there exist three types of optimal policies: (i) nonrandomized switching stationary policies, (ii) randomized stationary policies for the CTJMDP, and (iii) randomized stationary policies for the corresponding SMDP with exponentially distributed sojourn times, and these policies can be implemented as randomized strategies in the CTJMDP.