Train a Cross-Entropy Method in Policy-Based Methods with OpenAI Gtm's MountainCarContinous environment source from mountain_car.py, MountainCar-v0
A car is on a one-dimensional track, positioned between two "mountains". The goal is to drive up the mountain on the right; however, the car's engine is not strong enough to scale the mountain in a single pass. Therefore, the only way to succeed is to drive back and forth to build up momentum.
The Mountain Car MDP is a deterministic MDP that consists of a car placed stochastically at the bottom of a sinusoidal valley, with the only possible actions being the accelerations that can be applied to the car in either direction. The goal of the MDP is to strategically accelerate the car to reach the goal state on top of the right hill. There are two versions of the mountain car domain in gym: one with discrete actions and one with continuous. This version is the one with discrete actions. This MDP first appeared in Andrew Moore's PhD Thesis (1990)
@TECHREPORT{Moore90efficientmemory-based,
author = {Andrew William Moore},
title = {Efficient Memory-based Learning for Robot Control},
institution = {University of Cambridge},
year = {1990}
}
- The observation is a
ndarray
with shape(2,)
where the elements correspond to the following:
| Num | Observation | Min | Max | Unit |
|-----|-------------------------------------------------------------|--------------------|--------|--------------|
| 0 | position of the car along the x-axis | -Inf | Inf | position (m) |
| 1 | velocity of the car | -Inf | Inf | position (m) |
- There are 3 discrete deterministic actions:
| Num | Observation | Value | Unit |
|-----|-------------------------------------------------------------|---------|--------------|
| 0 | Accelerate to the left | Inf | position (m) |
| 1 | Don't accelerate | Inf | position (m) |
| 2 | Accelerate to the right | Inf | position (m) |
- Given an action, the mountain car follows the following transition dynamics:
velocityt+1 = velocityt + (action - 1) * force - cos(3 * positiont) * gravity
positiont+1 = positiont + velocityt+1
where force = 0.001 and gravity = 0.0025. The collisions at either end are inelastic with the velocity set to 0 upon collision with the wall. The position is clipped to the range
[-1.2, 0.6]
and velocity is clipped to the range[-0.07, 0.07]
.
- The goal is to reach the flag placed on top of the right hill as quickly as possible, as such the agent is penalised with a reward of -1 for each timestep it isn't at the goal and is not penalised (reward = 0) for when it reaches the goal.
- The position of the car is assigned a uniform random value in [-0.6 , -0.4]. The starting velocity of the car is always assigned to 0.
- The episode terminates if either of the following happens:
- The position of the car is greater than or equal to 0.5 (the goal position on top of the right hill)
- The length of the episode is 200.
gym.make('MountainCar-v0')
- Follow the instructions in
MountainCar-v0-CrossEntropy.ipynb
to train and run the agent!
$ git clone https://github.com/bmaxdk/OpenAI-Gym-MountainCar-v0-CrossEntropy.git
$ cd OpenAI-Gym-MountainCar-v0-CrossEntropy
Use jupyter notebook to open MountainCar-v0-CrossEntropy.ipynb