On the Complexity of Solving Markov Decision Problems [article]

Michael L. Littman, Thomas L. Dean, Leslie Pack Kaelbling
2013 arXiv   pre-print
Markov decision problems (MDPs) provide the foundations for a number of problems of interest to AI researchers studying automated planning and reinforcement learning. In this paper, we summarize results regarding the complexity of solving MDPs and the running time of MDP solution algorithms. We argue that, although MDPs can be solved efficiently in theory, more study is needed to reveal practical algorithms for solving large problems quickly. To encourage future research, we sketch some
more » ... ive methods of analysis that rely on the structure of MDPs.
arXiv:1302.4971v1 fatcat:s77uwofrtfh3njhgcaqn7bwb4a