BriefGPT.xyz
May, 2022
简化的马尔可夫决策过程：超出时间范围的视角
Reductive MDPs: A Perspective Beyond Temporal Horizons
HTML
PDF
Thomas Spooner, Rui Silva, Joshua Lockhart, Jason Long, Vacslav Glukhov
TL;DR
本文通过分析满足特定漂移条件的随机最短路径问题的子类，引入降低可达性的概念，提出了一种构建并求解随机最短路径问题和马尔可夫决策过程的多项式时间算法，经实验验证效果良好。
Abstract
Solving general
markov decision processes
(MDPs) is a computationally hard problem. Solving
finite-horizon mdps
, on the other hand, is highly tractable with well known polynomial-time algorithms. What drives this
→