[ Prev ] [ Index ] [ Next ]

Sutton mountain car problem

Created Samstag 30 April 2016

Problem Definition


The problem is defined in p.214 of Sutton's book (Reinforcement Learning). In this implementation, the system is a deterministic system.
The goal is to minimize the cost, which is the time needed to go to the target.
The cost is defined as '+1' in entire space of positions and velocities. Except at the target (p >= 0.5), where the cost is defined as '0'.

Solution

The MATLAB code is uploaded to: http://ch.mathworks.com/matlabcentral/fileexchange/39290-sutton-s-mountain-car-problem-with-value-iteration. It can also be downloaded here.

.

References and Attachments


http://www.cs.colostate.edu/~anderson/cs680/vi.ps