Mixed Acceleration Techniques for Solving Quickly Stochastic Shortest-Path Markov Decision Processes

in this paper we propose the combination of accelerated variants of value iteration mixed with improved prioritized sweeping for the fast solution of stochastic shortest-path markov decision processes. value iteration is a classical algorithm for solving markov decision processes, but this algorithm and its variants are quite slow for solving considerably large problems. in order to improve the solution time, acceleration techniques such as asynchronous updates, prioritization and prioritized sweeping have been explored in this paper. a topological reordering algorithm was also compared with static reordering. experimental results obtained on finite state and action-space stochastic shortest-path problems show that our approach achieves a considerable reduction in the solution time with respect to the tested variants of value iteration. for instance, the experiments showed in one test a reduction of 5.7 times with respect to value iteration with asynchronous updates.