XCSR with Computed Continuous Action

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.

[1]  Mengjie Zhang,et al.  Extracting and using building blocks of knowledge in learning classifier systems , 2012, GECCO '12.

[2]  Mengjie Zhang,et al.  Automatically defined functions for learning classifier systems , 2011, GECCO '11.

[3]  Larry Bull,et al.  Learning Classifier Systems , 2002, Annual Conference on Genetic and Evolutionary Computation.

[4]  Larry Bull,et al.  Fuzzy dynamical genetic programming in XCSF , 2011, GECCO.

[5]  Sean Luke,et al.  A Comparison of Bloat Control Methods for Genetic Programming , 2006, Evolutionary Computation.

[6]  Stewart W. Wilson.  Three Architectures for Continuous Action , 2005, IWLCS.

[7]  Stewart W. Wilson.  Classifiers that approximate functions , 2002, Natural Computing.

[8]  Stewart W. Wilson.  Classifier Fitness Based on Accuracy , 1995, Evolutionary Computation.

[9]  Larry Bull,et al.  A Genetic Programming-based Classifier System , 1999, GECCO.

[10]  Martin V. Butz,et al.  Rule-Based Evolutionary Online Learning Systems - A Principled Approach to LCS Analysis and Design , 2006, Studies in Fuzziness and Soft Computing.

[11]  Juan Julián Merelo Guervós,et al.  Bloat Control Operators and Diversity in Genetic Programming: A Comparative Study , 2010, Evolutionary Computation.

[12]  Stewart W. Wilson.  Get Real! XCS with Continuous-Valued Inputs , 1999, Learning Classifier Systems.

[13]  Stewart W. Wilson.  Mining Oblique Data with XCS , 2000, IWLCS.

[14]  Mark Johnston,et al.  Numerical simplification for bloat control and analysis of building blocks in genetic programming , 2009, Evol. Intell..

[15]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[16]  Jason H. Moore,et al.  Learning classifier systems: a complete introduction, review, and roadmap , 2009 .

[17]  Martin V. Butz,et al.  An algorithmic description of XCS , 2000, Soft Comput..

[18]  Mengjie Zhang,et al.  Evolving optimum populations with XCS classifier systems , 2012, Soft Computing.

[19]  Tim Kovacs,et al.  Advances in Learning Classifier Systems , 2001, Lecture Notes in Computer Science.

[20]  Pier Luca Lanzi,et al.  XCS with stack-based genetic programming , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[21]  Cédric Sanza,et al.  XCSF with computed continuous action , 2007, GECCO '07.