arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1807.09641eess.SYcs.LOcs.SY
收藏

基于部分探索的连续时间马尔可夫决策

Continuous-Time Markov Decisions based on Partial Exploration

Technical University of Munich(慕尼黑工业大学);Saarland University(萨尔兰大学)

Pranav Ashok, Yuliya Butkova, Holger Hermanns, Jan Křetínský

AI总结:

本文提出一种加速连续时间马尔可夫决策过程时间有界可达性分析算法的框架,通过识别并分析子系统实现高效计算,验证了该方法在多个传统算法中的显著加速效果。

摘要:

我们提供了一个框架,用于加速连续时间马尔可夫决策过程的时间有界可达性分析算法。其原理是找到一个较小但几乎等价的子系统,并仅分析该子系统。候选子系统的识别通过模拟并迭代扩大,直到运行在子系统中被高概率表示。该框架因此与抽象细化方法相对。我们通过几种传统算法实例化该框架,并实验验证在许多情况下实现了数量级的加速。

英文摘要:

We provide a framework for speeding up algorithms for time-bounded reachability analysis of continuous-time Markov decision processes. The principle is to find a small, but almost equivalent subsystem of the original system and only analyse the subsystem. Candidates for the subsystem are identified through simulations and iteratively enlarged until runs are represented in the subsystem with high enough probability. The framework is thus dual to that of abstraction refinement. We instantiate the framework in several ways with several traditional algorithms and experimentally confirm orders-of-magnitude speed ups in many cases.

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

↑