Exact Decomposition Approaches for Markov Decision Processes: A Survey

As classical methods are intractable for solving Markov decision processes (MDPs) requiring a large state space, decomposition and aggregation techniques are very useful to cope with large problems. These techniques are in general a special case of the classic Divide-and-Conquer framework to split a large, unwieldy problem into smaller components and solving the parts in order to construct the global solution. This paper reviews most of decomposition approaches encountered in the associated literature over the past two decades, weighing their pros and cons. We consider several categories of MDPs (average, discounted, and weighted MDPs), and we present briefly a variety of methodologies to find or approximate optimal strategies.

¬© 2010 The Authors. Article first published in ‘Advances in Operations Research’, V. (2010) as open access article, distributed under the terms of the Creative Commons Attribution License
http://www.hindawi.com/journals/aor/2010/659432.html

View full Article in PDF

Series Navigation<< Quo Vadis, Artificial Intelligence?On the Measurement of the (Non)linearity of Costas Permutations >>