É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

Éditeur(s) : HAL CCSD springer
Résumé : International audience
This paper focuses on the study of the behavior of a genetic algorithm based classier system, the Adapted Pittsburgh Classier System (A.P.C.S), on maze type environments containing aliasing squares. This type of environment is often used in reinforcement learning literature to assess the performances of learning methods when facing problems containing non markovian situations. Through this study, we discuss on the performance of the APCS upon two mazes (Woods 101 and Maze E2) and also on the eciency 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 solution to these maze problems. This statement is shown through a comparison between the results obtained by the XCS on two specic maze problems and those obtained by the APCS.
Lecture notes in computer science

hal-00542922
https://hal.archives-ouvertes.fr/hal-00542922
DOI : 10.1007/978-3-642-17508-4_8