Fast Value Iteration for Goal-Directed Markov Decision Processes

02/06/2013
by   Nevin Lianwen Zhang, et al.
0

Planning problems where effects of actions are non-deterministic can be modeled as Markov decision processes. Planning problems are usually goal-directed. This paper proposes several techniques for exploiting the goal-directedness to accelerate value iteration, a standard algorithm for solving Markov decision processes. Empirical studies have shown that the techniques can bring about significant speedups.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset