Lookahead and latent learning in ZCS

作者: Larry Bull

DOI:

关键词:

摘要: Learning Classifier Systems use reinforcement learning, evolutionary computing and/or heuristics to develop adaptive systems. This paper extends the ZCS System improve its internal modelling capabilities. Initially, results are presented which show performance in a traditional learning task incorporating lookahead within rule structure. Then mechanism for effective without external reward is examined enables simple system build full map of task. That is, shown learn under latent scenario using scheme. Its ability form maps tasks then considered.

参考文章(34)
Hugo Terashima-Marín, Manuel Valenzuela-Rendón, Peter Ross, Evolution of Constraint Satisfaction strategies in examination timetabling genetic and evolutionary computation conference. pp. 635- 642 ,(1999)
Rick L. Riolo, Lookahead planning and latent learning in a classifier system simulation of adaptive behavior. pp. 316- 326 ,(1991)
Pierre Gérard, Olivier Sigaud, YACS: Combining Dynamic Programming with Generalization in Classifier Systems IWLCS '00 Revised Papers from the Third International Workshop on Advances in Learning Classifier Systems. pp. 52- 69 ,(2000) , 10.1007/3-540-44640-0_5
Martin V. Butz, David E. Goldberg, Wolfgang Stolzmann, Introducing a genetic generalization pressure to the Anticipatory Classifier System - part 1: theoretical approach genetic and evolutionary computation conference. pp. 34- 41 ,(2000)
Pier Luca Lanzi, Martin V. Butz, Tim Kovacs, Stewart W. Wilson, How XCS evolves accurate classifiers genetic and evolutionary computation conference. pp. 927- 934 ,(2001)
Wolfgang Stolzmann, An Introduction to Anticipatory Classifier Systems Lecture Notes in Computer Science. pp. 175- 194 ,(2000) , 10.1007/3-540-45027-0_9
Ian P. Gent, Heuristic Solution of Open Bin Packing Problems Journal of Heuristics. ,vol. 3, pp. 299- 304 ,(1998) , 10.1023/A:1009678411503