Temporal difference and policy search methods for reinforcement learning: an empirical comparison
Matthew Edmund Taylor, Shimon Whiteson, Peter Stone · 2007
Reinforcement learning (RL) methods have become popular in recent years because of their ability to solve complex tasks with minimal feedback. Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving difficult RL problems, but few rigorous comparisons have been conducted. Thus, no general guidelines describing the methods ’ relative strengths and weaknesses are available. This paper summarizes a detailed empirical comparison be-tween a GA and a TD method in Keepaway, a standard RL benchmark domain based on robot soccer. The results from this study help isolate the factors critical to the performance of each learning method and yield insights into their general strengths and weaknesses.