Evolutionary Algorithms for Reinforcement Learning (1999)
Cached
Download Links
- [www.cs.washington.edu]
- [www.science.gmu.edu]
- [www.cs.cmu.edu]
- [ftp.aic.nrl.navy.mil]
- DBLP
Other Repositories/Bibliography
| Venue: | Journal of Artificial Intelligence Research |
| Citations: | 76 - 1 self |
BibTeX
@ARTICLE{Moriarty99evolutionaryalgorithms,
author = {David E. Moriarty and Alan C. Schultz and John J. Grefenstette},
title = {Evolutionary Algorithms for Reinforcement Learning},
journal = {Journal of Artificial Intelligence Research},
year = {1999},
volume = {11},
pages = {241--276}
}
Years of Citing Articles
OpenURL
Abstract
There are two distinct approaches to solving reinforcement learning problems, namely, searching in value function space and searching in policy space. Temporal difference methods and evolutionary algorithms are well-known examples of these approaches. Kaelbling, Littman and Moore recently provided an informative survey of temporal difference methods. This article focuses on the application of evolutionary algorithms to the reinforcement learning problem, emphasizing alternative policy representations, credit assignment methods, and problem-specific genetic operators. Strengths and weaknesses of the evolutionary approach to reinforcement learning are presented, along with a survey of representative applications. 1. Introduction Kaelbling, Littman, and Moore (1996) and more recently Sutton and Barto (1998) provide informative surveys of the field of reinforcement learning (RL). They characterize two classes of methods for reinforcement learning: methods that search the space of value fu...







