Chaotic Evolutionary Parallel Computation on Intelligent Agents
Naoki Kohata*, Toru Yamaguchi*, Takanobu Baba* and Hideki Hashimoto**
*Department of Information Science, Faculty of Engineering, Utsunomiya University 2753 Ishii-machi, Utsunomiya 321-8585, Japan
**Institute of Industrial Science, University of Tokyo 7-22-1 Roppongi, Minato-ku, Tokyo 106-8558, Japan
Received:April 27, 1998Accepted:August 6, 1998Published:October 20, 1998
Keywords:Evolutionary computation, Chaotic retrieval, Associative memories, Parallel processing
This paper proposes evolutionary computation using chaotic dynamics rather than the conventional genetic algorithm (GA) for such intelligent agents as welfare robots. Proposed evolutionary computation applies chaotic retrieval to associative memory. We applied evolutionary computation to multiagent robots moving side by side in step. Evolutionary computation is basically parallel processing, so we implement its parallel processing algorithm on A-NET (Actors NETwork) parallel objectoriented computer to show usefulness of parallel processing in evolutionary computation.
Cite this article as:N. Kohata, T. Yamaguchi, T. Baba, and H. Hashimoto, “Chaotic Evolutionary Parallel Computation on Intelligent Agents,” J. Robot. Mechatron., Vol.10 No.5, pp. 424-430, 1998.Data files: