Efficient Solution Algorithms for Factored MDPs

Details Efficient Solution Algorithms for Factored MDPs Efficient Solution Algorithms for Factored MDPs

2011-06-09

arxiv.org/abs/1106.1822v1

Journal Of Artificial Intelligence Research, Volume 19, pages 399-468, 2003

Computer Science

Artificial Intelligence

Scientific paper

10.1613/jair.1000

This paper addresses the problem of planning under uncertainty in large Markov Decision Processes (MDPs). Factored MDPs represent a complex state space using state variables and the transition model using a dynamic Bayesian network. This representation often allows an exponential reduction in the representation size of structured MDPs, but the complexity of exact solution algorithms for such MDPs can grow exponentially in the representation size. In this paper, we present two approximate solution algorithms that exploit structure in factored MDPs. Both use an approximate value function represented as a linear combination of basis functions, where each basis function involves only a small subset of the domain variables. A key contribution of this paper is that it shows how the basic operations of both algorithms can be performed efficiently in closed form, by exploiting both additive and context-specific structure in a factored MDP. A central element of our algorithms is a novel linear program decomposition technique, analogous to variable elimination in Bayesian networks, which reduces an exponentially large LP to a provably equivalent, polynomial-sized one. One algorithm uses approximate linear programming, and the second approximate dynamic programming. Our dynamic programming algorithm is novel in that it uses an approximation based on max-norm, a technique that more directly minimizes the terms that appear in error bounds for approximate MDP algorithms. We provide experimental results on problems with over 10^40 states, demonstrating a promising indication of the scalability of our approach, and compare our algorithm to an existing state-of-the-art approach, showing, in some problems, exponential gains in computation time.

Affiliated with

Also associated with

No associations

Rating

Efficient Solution Algorithms for Factored MDPs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Solution Algorithms for Factored MDPs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Solution Algorithms for Factored MDPs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-580354