Sutton's Mountain Car Problem with Value Iteration: snapToGrid(val, minVal, maxVal, gridSize) - File Exchange

Code covered by the BSD License

Highlights from
Sutton's Mountain Car Problem with Value Iteration

mountainCarSim(p, v, u)
mountainCarValIter ... This function will do the value iteration process to find the optimal
snapToGrid(val, minVal, maxVa... This function will convert a given value to closest integer ranging
traceBack(predecessorP, prede... This function will trace back the predecessor and the policy matrix for
visualizeMountainCar(gridPos,... This function will do visualization and animation of the mountain car.
main.m
replay.m
View all files

from Sutton's Mountain Car Problem with Value Iteration by Auralius Manurung
Implementation of Sutton's mountain car problem using value iteration.

snapToGrid(val, minVal, maxVal, gridSize)

function snappedVal = snapToGrid(val, minVal, maxVal, gridSize)

% This function will convert a given value to closest integer ranging 
% from 1 to gridSize + 1.
% For example, minVal will be converted to 1 and maxVal will be
% converted to gridSize + 1.

    range = maxVal - minVal;
    snappedVal = round((val - minVal) / range * gridSize + 1);

Highlights from Sutton's Mountain Car Problem with Value Iteration

Highlights from
Sutton's Mountain Car Problem with Value Iteration