The mountain car problem is commonly used as a benchmark reinforcement learning problem to evaluate learning algorithms. The problem places a car in a valley, where the goal is to get the car to drive out of the valley (Fig. 5.1). The car’s engine is not powerful enough for it to drive out of the valley, and the car must instead build up momentum by successively driving up opposing sides of the valley. This chapter explores the mountain car problem using sequential CART and stochastic kriging to understand the parameter space.
Keywords
- Response Surface
- Hide Layer
- Learning Rate
- Reinforcement Learning
- Design Point
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.