CTMDPs和连续时间Markov对策中有界可达性的有限最优控制
Finite Optimal Control for Time-Bounded Reachability in CTMDPs and Continuous-Time Markov Games
摘要:
我们建立了连续时间马尔可夫决策过程的时间有界可达性的最优调度策略的存在性,以及连续时间马尔可夫博弈的协同最优策略。此外,我们表明,最优控制不仅存在,但有一个令人惊讶的简单的结构:从我们的证明的最优决策者是确定性的和时间位置,和有界时间可以分为有限数量的区间,其中的最优策略是位置。也就是说,我们证明了有限最优控制的存在性。最后,我们表明,马尔可夫决策过程的这些令人愉快的属性扩展到更一般的类的连续时间马尔可夫游戏,早期和晚期的运动员表现出这种行为。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。