A symbiosis between cellular automata and genetic algorithms

被引:10
|
作者
Cerruti, Umberto [1 ]
Dutto, Simone [1 ]
Murru, Nadir [1 ]
机构
[1] Univ Torino, Dept Math G Peano, Turin, Italy
关键词
Cellular automata; Genetic algorithms; Game of life; Prisoner's dilemma; CONWAYS GAME;
D O I
10.1016/j.chaos.2020.109719
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Cellular automata are systems which use a rule to describe the evolution of a population in a discrete lattice, while genetic algorithms are procedures designed to find solutions to optimization problems inspired by the process of natural selection. In this paper, we introduce an original implementation of a cellular automaton whose rules use a fitness function to select for each cell the best mate to reproduce and a crossover operator to determine the resulting offspring. This new system, with a proper definition, can be both a cellular automaton and a genetic algorithm. We show that in our system the Conway's Game of Life can be easily implemented and, consequently, it is capable of universal computing. Moreover two generalizations of the Game of Life are created and also implemented with it. Finally, we use our system for studying and implementing the prisoner's dilemma and rock-paper-scissors games, showing very interesting behaviors and configurations (e.g., gliders) inside these games. (C) 2020 Elsevier Ltd. All rights reserved.
引用
收藏
页数:11
相关论文
共 50 条
  • [31] Generating test cases for constraint automata by genetic symbiosis algorithm
    Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran
    不详
    Lect. Notes Comput. Sci., 2006, (478-493):
  • [32] Generating test cases for constraint automata by genetic symbiosis algorithm
    Tasharofi, Samira
    Ansari, Sepand
    Sirjani, Marjan
    FORMAL METHODS AND SOFTWARE ENGINEERING, PROCEEDINGS, 2006, 4260 : 478 - 493
  • [33] Designing cellular automata-based scheduling algorithms
    Seredynski, F
    Janikow, CZ
    GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 1999, : 587 - 594
  • [34] Optoelectronic implementation of cellular automata for complex vision algorithms
    Chavel, P
    Cassinelli, A
    Glaser, I
    ROMOPTO 2000: SIXTH CONFERENCE ON OPTICS, 2000, 4430 : 442 - 450
  • [35] Research of complex forms in cellular automata by evolutionary algorithms
    Sapin, E
    Bailleux, O
    Chabrier, JJ
    ARTIFICIAL EVOLUTION, 2004, 2936 : 357 - 367
  • [36] The Review of Cellular Automata Algorithms for Placement and Routing Problems
    Zapletina, Mariya A.
    Zhukov, Denis, V
    PROCEEDINGS OF THE 2021 IEEE CONFERENCE OF RUSSIAN YOUNG RESEARCHERS IN ELECTRICAL AND ELECTRONIC ENGINEERING (ELCONRUS), 2021, : 2771 - 2776
  • [37] Artistic Image Processing with Cellular Automata and Evolutionary Algorithms
    Tseng, Hsuan-wen
    Chen, Ying-ping
    2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 2153 - 2159
  • [38] Evolutionary Algorithms and Cellular Automata Towards Image Reconstruction
    Seredynski, Franciszek
    Skaruz, Jaroslaw
    2012 THIRD INTERNATIONAL CONFERENCE ON EMERGING APPLICATIONS OF INFORMATION TECHNOLOGY (EAIT), 2012, : 283 - 286
  • [39] Research of Complexity in Cellular Automata through Evolutionary Algorithms
    Sapin, Emmanuel
    Bailleux, Olivier
    Chabrier, Jacqueline
    COMPLEX SYSTEMS, 2007, 17 (03): : 231 - 241
  • [40] Automatic Design of FPGA Processor for the Backtracking of DNA Sequences Evolution Using Cellular Automata and Genetic Algorithms
    Sirakoulis, Georgios Ch.
    CELLULAR AUTOMATA, PROCEEDINGS, 2008, 5191 : 522 - 530