XCS with computed prediction in continuous multistep environments

We apply XCS with computed prediction (XCSF) to tackle multistep reinforcement learning problems involving continuous inputs. In essence we use XCSF as a method of generalized reinforcement learning. We show that in domains involving continuous inputs and delayed rewards XCSF can evolve compact populations of accurate maximally general classifiers which represent the optimal solution to the target problem. We compare the performance of XCSF with that of tabular Q-learning adapted to the continuous domains considered here. The results we present show that XCSF can converge much faster than tabular techniques while producing more compact solutions. Our results also suggest that when exploration is less effective in some areas of the problem space, XCSF can exploit effective generalizations to extend the evolved knowledge beyond the frequently explored areas. In contrast, in the same situations, the convergence speed of tabular Q-learning worsens.

• Type: Conference
• Year: 2005
• Where: CEC
• Authors: Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wilson, David E. Goldberg
• Keywords: Artificial Intelligence, CEC 2005, Continuous Inputs, Reinforcement Learning, Reinforcement Learning Problems