Efficient approximation of optimal control for continuous-time Markov games
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 3292104 (Why is no real title available?)
- A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
- A survey of recent results on continuous-time Markov decision processes (with comments and rejoinder)
- Continuous-time stochastic games with time-bounded reachability
- Continuous-time stochastic games with time-bounded reachability
- Delayed Nondeterminism in Continuous-Time Markov Decision Processes
- Efficient approximation of optimal control for continuous-time Markov games
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- Finite State Continuous Time Markov Decision Processes with a Finite Planning Horizon
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
- Finite state continuous time Markov decision processes with an infinite planning horizon
- Improving time bounded reachability computations in interactive Markov chains
- Interactive Markov chains. And the quest for quantified quality
- Maximal cost-bounded reachability probability on continuous-time Markov decision processes
- Model Checking Interactive Markov Chains
- Numerical analysis of continuous time Markov decision processes over finite horizons
- On the semantics of Markov automata
- Optimal Control of a Continuous-Time Markov Chain with Periodic Transition Probabilities
- Optimal continuous time Markov decisions
- Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games
- Sliding Window Abstraction for Infinite Markov Chains
- Solving Ordinary Differential Equations I
- Towards Performance Prediction of Compositional Models in Industrial GALS Designs
Cited in
(10)- Continuous-time stochastic games with time-bounded reachability
- An Accelerated Value/Policy Iteration Scheme for Optimal Control Problems and Games
- Optimal decisions for continuous time Markov decision processes over finite planning horizons
- Strategy synthesis for zero-sum neuro-symbolic concurrent stochastic games
- Approximate Time Bounded Reachability for CTMCs and CTMDPs: A Lyapunov Approach
- Optimal continuous time Markov decisions
- Optimal time-abstract schedulers for CTMDPs and Markov games
- A uniformization-based algorithm for continuous-time stochastic games model checking
- Attracting sets of discrete-time Markovian jump delay systems with stochastic disturbances via impulsive control
- Efficient approximation of optimal control for continuous-time Markov games
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)