Detail výsledku
Evolution of Complex Emergent Behaviour in Multi-State Cellular Automata
The paper presents 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 emergent behaviour. The square calculation in one-dimensional cellular automata and problem of designing replicating loops in two-dimensional cellular automata will be treated as case studies. It will be shown that the evolutionary algorithm in combination with the conditionally matching rules is able to successfully solve these tasks and provide some innovative results in comparison with the existing solutions.
cellular automaton; transition function; conditional rule; evolutionary algorithm
@inproceedings{BUT130968,
author="Michal {Bidlo}",
title="Evolution of Complex Emergent Behaviour in Multi-State Cellular Automata",
booktitle="Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion",
year="2016",
pages="157--158",
publisher="Association for Computing Machinery",
address="New York",
doi="10.1145/2908961.2930947",
isbn="978-1-4503-4323-7",
url="http://dl.acm.org/citation.cfm?id=2930947"
}