AAAI Publications, Twenty-Second International Joint Conference on Artificial Intelligence

Font Size: 
DetH*: Approximate Hierarchical Solution of Large Markov Decision Processes
Jennifer L. Barry, Leslie Pack Kaelbling, Tomas Lozano-Perez

Last modified: 2011-06-28


This paper presents an algorithm for finding approximately optimal policies in very large Markov decision processes by constructing a hierarchical model and then solving it approximately. It exploits factored representations to achieve compactness and efficiency and to discover connectivity properties of the domain. We provide a bound on the quality of the solutions and give asymptotic analysis of the runtimes; in addition we demonstrate performance on a collection of very large domains. Results show that the quality of resulting policies is very good and the total running times, for both creating and solving the hierarchy, are significantly less than for an optimal factored MDP solver.

Full Text: PDF