Optimal decisions for continuous time Markov decision processes over finite planning horizons
From MaRDI portal
Publication:1652046
DOI10.1016/j.cor.2016.08.003zbMath1391.90631OpenAlexW2516770623MaRDI QIDQ1652046
Dimitri Scheftelowitsch, Peter Buchholz, Iryna Dohndorf
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.08.003
Queueing theory (aspects of probability theory) (60K25) Optimal stochastic control (93E20) Numerical analysis or methods applied to Markov chains (65C40) Markov and semi-Markov decision processes (90C40)
Related Items (3)
A multi-objective approach for PH-graphs with applications to stochastic shortest paths ⋮ Poisoning finite-horizon Markov decision processes at design time ⋮ Policy Synthesis for Collective Dynamics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient approximation of optimal control for continuous-time Markov games
- Numerical analysis of continuous time Markov decision processes over finite horizons
- On maximal rewards and \(\varepsilon\)-optimal policies in continuous time Markov decision chains
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- On the Numerical Analysis of Inhomogeneous Continuous-Time Markov Chains
- Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
- Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes
- Applying a New Device in the Optimization of Exponential Queuing Systems
- Countable-State, Continuous-Time Dynamic Programming with Structure
- Optimal Control of a Continuous-Time Markov Chain with Periodic Transition Probabilities
- Finite State Continuous Time Markov Decision Processes with a Finite Planning Horizon
This page was built for publication: Optimal decisions for continuous time Markov decision processes over finite planning horizons