Éditeur(s) : HAL CCSD
Résumé : International audience
This paper focuses on the study of the influence of a newly implemented mechanism on a Pittsburgh-like classifier system. The Adapted Pittsburgh Classifier System is a learning classifier system that uses genetic algorithms to evolve its ruleset. The new mechanism discussed is inspired from Wilson work on the eXtended Classifier System (XCS): it allows the concerned LCS to adapt its rule set when facing a new signal by modifying an existing rule. This mechanism is called covering mechanism due to the fact that the rule is covered up by a new rule which is sensitive to this new signal. Effects of this covering mechanism are first measured on the performances of APCS on well known multi-step environments: maze-type environments (Woods 101 and E2). In addition, further measures presented in this paper indicate that we could possibly rely on the behavior of this covering mechanism to automate the research of a correct cognitive capacity needed by the APCS to solve a given multistep problem.
2008 Eighth International Conference on Hybrid Intelligent Systems
Barcelone, Spain

hal-00520608
https://hal.archives-ouvertes.fr/hal-00520608
DOI : 10.1109/HIS.2008.105

Éditeur(s) : HAL CCSD ACM New York, NY, USA
Résumé : International audience
This paper focuses on the study of the behavior of a genetic algorithm based classifier system, the Adapted Pittsburgh Classifier System (A.P.C.S), on maze type environments containing aliasing squares. This type of environment is often used in reinforcement learning litterature to assess the performances of learning methods when facing problems containing non markov situations. Through this study, we discuss on the performances of the APCS on maze type environments and also of the efficiency of an improvement of the APCS learning method inspired from the XCS : the covering mechanism. We manage to show that, without any memory mechanism, the APCS is able to build and to keep accurate strategies to produce regular sub-optimal solutions to these maze problem. This statement is shown through a comparison of the results obtained by the XCS, XCSM and XCSMH on distinct maze problems with these obtained by the APCS.
Proceedings of the 2008 GECCO conference companion on Genetic and evolutionary computation
Atlanta, GA, United States

hal-00520607
https://hal.archives-ouvertes.fr/hal-00520607
DOI : 10.1145/1388969.1389013