next up previous contents
Next: 4. Dynamic Programming Up: Book Previous: 3.11 Bibliographical and Historical   Contents

II. Elementary Solution Methods

In this part of the book we describe three fundamental classes of methods for solving the reinforcement learning problem: dynamic programming, Monte Carlo methods, and temporal-difference learning. All of these methods solve the full version of the problem, including delayed rewards.

Each class of methods has its strengths and weaknesses. Dynamic programming methods are well developed mathematically, but require a complete and accurate model of the environment. Monte Carlo methods don't require a model and are conceptually simple, but are not suited for step-by-step incremental computation. Finally, temporal-difference methods require no model and are fully incremental, but are more complex to analyze. The methods also differ in several ways with respect to their efficiency and speed of convergence. In the third part of the book we explore how these methods can be combined so as to obtain the best features of each of them.


Mark Lee 2005-01-04