 |
    |
XCSR with Computed Continuous Action
Muhammad Iqbal, Will N. Browne, and Mengjie Zhang
Evolutionary Computation Research Group, School of Engineering and Computer Science, Victoria University of Wellington, PO Box 600, Wellington 6140, New Zealandmuhammad.iqbal@ecs.vuw.ac.nz
will.browne@ecs.vuw.ac.nz
mengjie.zhang@ecs.vuw.ac.nz
Abstract. Wilson extended XCS with interval based conditions to XCSR to handle real valued inputs. However, the possible actions must always be determined in advance. Yet domains such as robot control require numerical actions, so that neither XCS nor XCSR with their discrete actions can yield high performance. In the work presented here, genetic programming-based representation is used for the first time to compute continuous action in XCSR. This XCSR version has been examined on a simple one-dimensional but non-linear testbed problem – the “frog” problem – and compared with two continuous action based systems, GCS and XCSFCA. The proposed approach has consistently solved the frog problem and outperformed GCS and XCSFCA.
Keywords: Learning Classifier Systems, XCS, XCSR, Code Fragment, Computed Action, Continuous Action
LNAI 7691, p. 350 ff.
lncs@springer.com
© Springer-Verlag Berlin Heidelberg 2012