Ant Colony Optimisation for Performing Computational Task in Cellular Automata
Loading...
Files
Date
Authors
Bidlo, Michal
Korgo, Jakub
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Automation and Computer Science, Brno University of Technology
ORCID
Altmetrics
Abstract
A method is presented for the design of cellular automata rules by means of ant algorithms.
In particular, Elitist Ant System and a~modified MAX-MIN Ant System are applied to search for transition functions of 1D cellular automata that are able to calculate squares of given input values.
It will be shown that the proposed MAX-MIN Ant System can perform significantly better than the standard variant of Elitist Ant System.
In particular, in the most advanced case study, the ant algorithm showed an ability to design a~complete set of elementary cellular automata rules that fulfil the required square calculations.
Some selected results will be presented and their features discussed.
Description
Citation
Mendel. 2018 vol. 25, č. 1, s. 147-156. ISSN 1803-3814
https://mendel-journal.org/index.php/mendel/article/view/91
https://mendel-journal.org/index.php/mendel/article/view/91
Document type
Peer-reviewed
Document version
Published version
Date of access to the full text
Language of document
en
Study field
Comittee
Date of acceptance
Defence
Result of defence
Collections
Endorsement
Review
Supplemented By
Referenced By
Creative Commons license
Except where otherwised noted, this item's license is described as Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International license