Efficient approximation of optimal control for continuous-time Markov games
DOI10.1016/J.IC.2015.12.002zbMATH Open1337.91015OpenAlexW2278165153MaRDI QIDQ259052FDOQ259052
John Fearnley, Markus Rabe, Sven Schewe, Lijun Zhang
Publication date: 10 March 2016
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.12.002
Recommendations
- Efficient approximation of optimal control for continuous-time Markov games
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- Optimal time-abstract schedulers for CTMDPs and Markov games
- Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Markov and semi-Markov decision processes (90C40) Stochastic games, stochastic differential games (91A15) Optimal stochastic control (93E20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving Ordinary Differential Equations I
- Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games
- On the semantics of Markov automata
- Continuous-time stochastic games with time-bounded reachability
- Finite state continuous time Markov decision processes with an infinite planning horizon
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- Efficient approximation of optimal control for continuous-time Markov games
- Continuous-time stochastic games with time-bounded reachability
- Improving Time Bounded Reachability Computations in Interactive Markov Chains
- Optimal Continuous Time Markov Decisions
- A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
- Model Checking Interactive Markov Chains
- Delayed Nondeterminism in Continuous-Time Markov Decision Processes
- Towards Performance Prediction of Compositional Models in Industrial GALS Designs
- Sliding Window Abstraction for Infinite Markov Chains
- Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes
- Optimal Control of a Continuous-Time Markov Chain with Periodic Transition Probabilities
- Finite State Continuous Time Markov Decision Processes with a Finite Planning Horizon
- Title not available (Why is that?)
- Numerical analysis of continuous time Markov decision processes over finite horizons
- Interactive Markov chains. And the quest for quantified quality
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
- A survey of recent results on continuous-time Markov decision processes (with comments and rejoinder)
Cited In (6)
- A uniformization-based algorithm for continuous-time stochastic games model checking
- Strategy synthesis for zero-sum neuro-symbolic concurrent stochastic games
- Optimal decisions for continuous time Markov decision processes over finite planning horizons
- An Accelerated Value/Policy Iteration Scheme for Optimal Control Problems and Games
- Approximate Time Bounded Reachability for CTMCs and CTMDPs: A Lyapunov Approach
- Attracting sets of discrete-time Markovian jump delay systems with stochastic disturbances via impulsive control
Uses Software
This page was built for publication: Efficient approximation of optimal control for continuous-time Markov games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259052)
