arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1006.5103cs.FL
收藏

CTMDP和Markov对策的最优时间抽象算法

Optimal Time-Abstract Schedulers for CTMDPs and Markov Games

Markus Rabe, Sven Schewe

摘要:

我们研究时间抽象调度类的连续时间马尔可夫决策过程的时间有界可达性。这种可达性问题在可靠性分析和制造与装配系统的建模中起着至关重要的作用。因此,他们的分析已被深入研究,和技术的近似最优控制是很好的理解。然而,从数学的观点来看,与最优控制是否存在的基本问题相比,近似问题是次要的。我们证明了所有CTMDPs的时间抽象调度程序类的最优调度器的存在。我们的证明是建设性的:我们展示了如何计算最佳的时间抽象策略与有限的内存。事实证明,这些最优调度器具有惊人的简单结构-它们在有限数量的步骤之后收敛到易于计算的无记忆调度策略。最后,我们表明,我们的论点可以很容易地提升到马尔可夫博弈:我们表明,双方球员有一个同样简单的最优策略,在这些更一般的结构。

英文摘要:

We study time-bounded reachability in continuous-time Markov decision processes for time-abstract scheduler classes. Such reachability problems play a paramount role in dependability analysis and the modelling of manufacturing and queueing systems. Consequently, their analysis has been studied intensively, and techniques for the approximation of optimal control are well understood. From a mathematical point of view, however, the question of approximation is secondary compared to the fundamental question whether or not optimal control exists. We demonstrate the existence of optimal schedulers for the time-abstract scheduler classes for all CTMDPs. Our proof is constructive: We show how to compute optimal time-abstract strategies with finite memory. It turns out that these optimal schedulers have an amazingly simple structure - they converge to an easy-to-compute memoryless scheduling policy after a finite number of steps. Finally, we show that our argument can easily be lifted to Markov games: We show that both players have a likewise simple optimal strategy in these more general structures.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑