Learning Mazes with Aliasing States: An LCS Algorithm with Associative Perception  

Oleh:

Zatuchna, Zhanna V. ; Bagnall, Anthony

Jenis: Article from Journal - e-Journal
Dalam koleksi: Adaptive Behavior vol. 17 no. 1 (Feb. 2009), page 28–57.
Topik: modeling of learning; agents; earning classifier systems; associative perception; aliasing; maze
Fulltext: 28.pdf (754.02KB)

Isi artikel

Learning classifier systems (LCSs) belong to a class of algorithms based on the principle of selforganization and have frequently been applied to the task of solving mazes, an important type of reinforcement learning (RL) problem. Maze problems represent a simplified virtual model of real environments that can be used for developing core algorithms of many real-world applications related to the problem of navigation. However, the best achievements of LCSs in maze problems are still mostly bounded to non-aliasing environments, while LCS complexity seems to obstruct a proper analysis of the reasons of failure. We construct a new LCS agent that has a simpler and more transparent performance mechanism, but that can still solve mazes better than existing algorithms. We use the structure of a predictive LCS model, strip out the evolutionary mechanism, simplify the reinforcement learning procedure and equip the agent with the ability of associative perception, adopted from psychology. To improve our understanding of the nature and structure of maze environments, we analyze mazes used in research for the last two decades, introduce a set of maze complexity characteristics, and develop a set of new maze environments. We then run our new LCS with associative perception through the old and new aliasing mazes, which represent partially observable Markov decision problems (POMDP) and demonstrate that it performs at least as well as, and in some cases better than, other published systems.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali