caa a22 4500 445869682 CHVBK 20180317145507.0 cr unu---uuuuu 170323e20110801xx s 000 0 eng 10.1007/s00236-011-0140-0 doi (NATIONALLICENCE)springer-10.1007/s00236-011-0140-0 Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games [Elektronische Daten] [Markus Rabe, Sven Schewe] We establish the existence of optimal scheduling strategies for time-bounded reachability in continuous-time Markov decision processes, and of co-optimal strategies for continuous-time Markov games. Furthermore, we show that optimal control does not only exist, but has a surprisingly simple structure: the optimal schedulers from our proofs are deterministic and timed positional, and the bounded time can be divided into a finite number of intervals, in which the optimal strategies are positional. That is, we demonstrate the existence of finite optimal control. Finally, we show that these pleasant properties of Markov decision processes extend to the more general class of continuous-time Markov games, and that both early and late schedulers show this behaviour. Springer-Verlag, 2011 Rabe Markus Universität des Saarlandes, Saarbrücken, Germany aut Schewe Sven University of Liverpool, Liverpool, UK aut Acta Informatica Springer-Verlag 48/5-6(2011-08-01), 291-315 0001-5903 48:5-6<291 2011 48 236 https://doi.org/10.1007/s00236-011-0140-0 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s00236-011-0140-0 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Rabe Markus Universität des Saarlandes, Saarbrücken, Germany aut NATIONALLICENCE 700 1- Schewe Sven University of Liverpool, Liverpool, UK aut NATIONALLICENCE 773 0- Acta Informatica Springer-Verlag 48/5-6(2011-08-01), 291-315 0001-5903 48:5-6<291 2011 48 236 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer