Generating Loop Patterns with a Genetic Algorithm and a Probabilistic Cellular Automata Rule
Author:
Open Access
- 24 July 2023
- journal article
- research article
- Published by MDPI AG in Algorithms
- Vol. 16 (7) , 352
Abstract
The objective is to find a Cellular Automata (CA) rule that can generate “loop patterns”. A loop pattern is given by ones on a zero background showing loops. In order to find out how loop patterns can be locally defined, tentative loop patterns are generated by a genetic algorithm in a preliminary stage. A set of local matching tiles is designed and checked whether they can produce the aimed loop patterns by the genetic algorithm. After having approved a certain set of tiles, a probabilistic CA rule is designed in a methodical way. Templates are derived from the tiles, which then are used in the CA rule for matching. In order to drive the evolution to the desired patterns, noise is injected if the templates do not match or other constraints are not fulfilled. Simulations illustrate that loops and connected loops can be evolved by the CA rule.Keywords
This publication has 10 references indexed in Scilit:
- Cellular automata rules solving the wireless sensor network coverage problemNatural Computing, 2022
- A cellular automata rule placing a maximal number of dominoes in the square and diamondThe Journal of Supercomputing, 2021
- Parallel Computing Technologies2021
- Hamiltonian Paths in Some Classes of Grid GraphsJournal of Applied Mathematics, 2012
- Genetic algorithmsScholarpedia, 2012
- Structure, Aggregation and Characterization of NanoparticlesReviews in Mineralogy and Geochemistry, 2001
- Genetic algorithms: An overviewComplexity, 1995
- Genetic AlgorithmsScientific American, 1992
- Ueber die stetige Abbildung einer Line auf ein Fl chenst ckMathematische Annalen, 1891
- Sur une courbe, qui remplit toute une aire planeMathematische Annalen, 1890