Effects of chaotic exploration on reinforcement maze learning

9Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In reinforcement learning, it is necessary to introduce a process of trial and error called an exploration. As a generator for exploration, it seems to be familiar to use the uniform pseudorandom number generator. However, it is known that chaotic source also provides a random-like sequence as like as stochastic source. In this research, we propose an application of the random-like feature of deterministic chaos for a generator of the exploration. As a result, we find that the deterministic chaotic generator for the exploration based on the logistic map gives better performances than the stochastic random exploration generator in a nonstationary shortcut maze problem. In order to understand why the exploration generator based on the logistic map shows the better result, we investigate the learning structures obtained from the two exploration generators. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Morihiro, K., Matsui, N., & Nishimura, H. (2004). Effects of chaotic exploration on reinforcement maze learning. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3213, 833–839. https://doi.org/10.1007/978-3-540-30132-5_112

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free