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

马尔可夫决策过程中的随机最短路与权有界性

Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes

Christel Baier, Nathalie Bertrand, Clemens Dubslaff, Daniel Gburek, Ocan Sankur

摘要:

本文讨论了有限状态马尔可夫决策过程(MDP)的整数权重分配给每个状态动作对。提出了新的算法来分类端组件根据其限制行为相对于累积的权重。这些算法被用来提供两种类型的整数加权MDPs的基本问题的解决方案。首先,一个多项式时间算法的经典随机最短路问题,推广已知的结果,特殊类的加权MDPs。其次,定性概率约束的重量有界(重复)的可达性条件的解决。其中,它示出的问题,以决定是否一个析取的重量有界的可达性条件下,几乎肯定持有一些调度属于$\textrm{NP}\cap \textrm{coNP}$,是可解的伪多项式时间,是至少一样难,解决两个球员的平均支付游戏,而相应的问题,泛量化的竞争对手是可解的多项式时间。

英文摘要:

The paper deals with finite-state Markov decision processes (MDPs) with integer weights assigned to each state-action pair. New algorithms are presented to classify end components according to their limiting behavior with respect to the accumulated weights. These algorithms are used to provide solutions for two types of fundamental problems for integer-weighted MDPs. First, a polynomial-time algorithm for the classical stochastic shortest path problem is presented, generalizing known results for special classes of weighted MDPs. Second, qualitative probability constraints for weight-bounded (repeated) reachability conditions are addressed. Among others, it is shown that the problem to decide whether a disjunction of weight-bounded reachability conditions holds almost surely under some scheduler belongs to $\textrm{NP}\cap \textrm{coNP}$, is solvable in pseudo-polynomial time and is at least as hard as solving two-player mean-payoff games, while the corresponding problem for universal quantification over schedulers is solvable in polynomial time.

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

↑