Related
Ontology
Subjects/Areas/Topics:Artificial Intelligence
;
Bio-inspired Hardware and Networks
;
Computational Intelligence
;
Evolutionary Computing
;
Genetic Algorithms
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Representation Techniques
;
Soft Computing

Abstract: The paper deals with the design of uniform multi-state one-dimensional cellular automata using an evolutionary algorithm and their application to solve the problem of generic square calculations. The key idea is based on the representation of the transition functions for the automata, which utilises the concept of conditionally matching rules. This technique allows us to design complex cellular automata for which the conventional representations have failed. A study is proposed with various settings of the experimental system, which concerns the way of evaluating the candidate solutions, the number of cell states and the number of conditional rules of the transition functions. It is shown that various generic solutions for the square calculation can be obtained in one-dimensional cellular automata using local interactions of cells only. The results presented demonstrates an ability of the evolution to discover innovative solutions both from the view of complexity of the cellular automaton and the number of steps needed to calculate the results in comparison with the known solution.(More)

The paper deals with the design of uniform multi-state one-dimensional cellular automata using an evolutionary algorithm and their application to solve the problem of generic square calculations. The key idea is based on the representation of the transition functions for the automata, which utilises the concept of conditionally matching rules. This technique allows us to design complex cellular automata for which the conventional representations have failed. A study is proposed with various settings of the experimental system, which concerns the way of evaluating the candidate solutions, the number of cell states and the number of conditional rules of the transition functions. It is shown that various generic solutions for the square calculation can be obtained in one-dimensional cellular automata using local interactions of cells only. The results presented demonstrates an ability of the evolution to discover innovative solutions both from the view of complexity of the cellular automaton and the number of steps needed to calculate the results in comparison with the known solution.

*Limit of Downloads ExceededJoin SciTePress now to download more papers for free and get access to over
full text papers.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Bidlo M. (2016). Evolution of Generic Square Calculations in Cellular Automata.In Proceedings of the 8th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2016) ISBN 978-989-758-201-1, pages 94-102. DOI: 10.5220/0006064800940102

@conference{ecta16, author={Michal Bidlo}, title={Evolution of Generic Square Calculations in Cellular Automata}, booktitle={Proceedings of the 8th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2016)}, year={2016}, pages={94-102}, publisher={SciTePress}, organization={INSTICC}, doi={10.5220/0006064800940102}, isbn={978-989-758-201-1}, }

TY - CONF

JO - Proceedings of the 8th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2016) TI - Evolution of Generic Square Calculations in Cellular Automata SN - 978-989-758-201-1 AU - Bidlo M. PY - 2016 SP - 94 EP - 102 DO - 10.5220/0006064800940102