Acceleration Operators in the Value Iteration Algorithms for Average Reward Markov Decision Processes

Details Acceleration Operators in the Value Iteration Algorithms for Average Reward Markov Decision Processes Acceleration Operators in the Value Iteration Algorithms for Average Reward Markov Decision Processes

2008-06-02

arxiv.org/abs/0806.0320v1

Mathematics

Optimization and Control

34 pages, 3 figures

Scientific paper

One of the most widely used methods for solving average cost MDP problems is the value iteration method. This method, however, is often computationally impractical and restricted in size of solvable MDP problems. We propose acceleration operators that improve the performance of the value iteration for average reward MDP models. These operators are based on two important properties of Markovian operator: contraction mapping and monotonicity. It is well known that the classical relative value iteration methods for average cost criteria MDP do not involve the max-norm contraction or monotonicity property. To overcome this difficulty we propose to combine acceleration operators with variants of value iteration for stochastic shortest path problems associated average reward problems.

Affiliated with

Also associated with

No associations

Rating

Acceleration Operators in the Value Iteration Algorithms for Average Reward Markov Decision Processes 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 Acceleration Operators in the Value Iteration Algorithms for Average Reward Markov Decision Processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Acceleration Operators in the Value Iteration Algorithms for Average Reward Markov Decision Processes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-632436