Detail výsledku
On Routine Evolution of Complex Cellular Automata
The paper deals with a special technique, called conditionally matching rules, for the representation of transition functions of cellular automata and its application to the evolutionary design of complex multi-state cellular automata. The problem of designing replicating loops in two-dimensional cellular automata and the square calculation in one-dimensional cellular automata will be treated as case studies.
It will be shown that the evolutionary algorithm in combination with conditionally matching rules is able to successfully solve these tasks and provide some innovative results compared to existing solutions. In particular, a novel replication scheme will be presented that exhibits a higher replication speed in comparison with the existing replicating loops. As regards the square calculation, some results have been obtained that allow a substantial reduction of the number of steps of the cellular automaton against the currently known solution. The utilisation of the conditionally matching rules in the proposed experiments represents the first case of a successful automatic evolutionary design of complex cellular automata for solving non-trivial problems in which the existing conventional approaches have failed.
cellular automaton, transition function, evolutionary algorithm, square calculation, replicating loop
@article{BUT131024,
author="Michal {Bidlo}",
title="On Routine Evolution of Complex Cellular Automata",
journal="IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION",
year="2016",
volume="20",
number="5",
pages="742--754",
doi="10.1109/TEVC.2016.2516242",
issn="1089-778X",
url="http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7377086"
}