Approximate Dynamic Programming via a Smoothed Linear Program

Details Approximate Dynamic Programming via a Smoothed Linear Program Approximate Dynamic Programming via a Smoothed Linear Program

2009-08-04

arxiv.org/abs/0908.0506v2

Mathematics

Optimization and Control

Scientific paper

We present a novel linear program for the approximation of the dynamic programming cost-to-go function in high-dimensional stochastic control problems. LP approaches to approximate DP have typically relied on a natural `projection' of a well studied linear program for exact dynamic programming. Such programs restrict attention to approximations that are lower bounds to the optimal cost-to-go function. Our program--the `smoothed approximate linear program'--is distinct from such approaches and relaxes the restriction to lower bounding approximations in an appropriate fashion while remaining computationally tractable. Doing so appears to have several advantages: First, we demonstrate substantially superior bounds on the quality of approximation to the optimal cost-to-go function afforded by our approach. Second, experiments with our approach on a challenging problem (the game of Tetris) show that the approach outperforms the existing LP approach (which has previously been shown to be competitive with several ADP algorithms) by an order of magnitude.

Affiliated with

Also associated with

No associations

Rating

Approximate Dynamic Programming via a Smoothed Linear Program 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 Approximate Dynamic Programming via a Smoothed Linear Program, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate Dynamic Programming via a Smoothed Linear Program will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-557592