|
|
Representation Techniques for Evolutionary Design of Cellular Automata
Kovács, Martin ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
The aim of this thesis is to experimentally evaluate the performance of several distinct representations of transition functions for cellular automata. Cellular automata have many potential applications for simulating various phenomena (e.g. natural processes, physical systems, etc.). Parallel computation of cellular automata is based on local cell interactions. Such computation, however, may prove difficult to program the CA, which is the reason for applying evolutionary techniques for the design of cellular automata in many cases. Evolutionary algorithms, based on Darwin's theory of evolution, have been used to find human-competitive solutions to many problems. In order to perform the evolutionary design of cellular automata, special encodings of the candidate solutions are often necessary. For this purpose the performance testing of various representations of the transition functions will be investigated. In particular, table representation, conditionally matching rules, and genetic programming will be treated. The problem of square calculations in cellular automata will be considered as a case study.
|
|
|
Modified Genetic Algorithms for Cellular Automata Design
Magdolen, Matej ; Vašíček, Zdeněk (referee) ; Bidlo, Michal (advisor)
This bachelor’s thesis aims to examine possibilities of designing a transition function enabling a cellular automaton to solve a given problem using a genetic algorithm. It contains an introduction to cellular automata, evolution algorithms and conditionally matching rules, a method of descripting a transition function suitable for evolutionary development. A set of experiments is conducted using the standard version of genetic algorithms to determine its optimal configuration. Additionally, modifications of this standard algorithm are proposed, effect of which on the algorithm’s performance is then evaluated by further experiments.
|
|
|
Advanced Evolutionary Image Filtering
Saranová, Ivana ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
This work aims to use cellular automata with a transition function of conditionally matching rules designed by the evolution strategy for the removal of noises of different types and intensities from digital images. The proposed method improves the original concept of conditionally matching rules by modifying the right side of the rule, extending it from a single value to a selection of functions. Furthermore, various evolution strategy setups were explored, including usage of different noise models for evolution, training on partially damaged images, and other setups, resulting in high-quality filters for each noise model. Comparing these filters to the existing methods shows great improvement from the original approach and the ability to evolutionarily design filters that are placed among the top methods quality-wise.
|
|
|
Representation Techniques for Evolutionary Design of Cellular Automata
Kovács, Martin ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
The aim of this thesis is to experimentally evaluate the performance of several distinct representations of transition functions for cellular automata. Cellular automata have many potential applications for simulating various phenomena (e.g. natural processes, physical systems, etc.). Parallel computation of cellular automata is based on local cell interactions. Such computation, however, may prove difficult to program the CA, which is the reason for applying evolutionary techniques for the design of cellular automata in many cases. Evolutionary algorithms, based on Darwin's theory of evolution, have been used to find human-competitive solutions to many problems. In order to perform the evolutionary design of cellular automata, special encodings of the candidate solutions are often necessary. For this purpose the performance testing of various representations of the transition functions will be investigated. In particular, table representation, conditionally matching rules, and genetic programming will be treated. The problem of square calculations in cellular automata will be considered as a case study.
|
|
|
Modified Genetic Algorithms for Cellular Automata Design
Magdolen, Matej ; Vašíček, Zdeněk (referee) ; Bidlo, Michal (advisor)
This bachelor’s thesis aims to examine possibilities of designing a transition function enabling a cellular automaton to solve a given problem using a genetic algorithm. It contains an introduction to cellular automata, evolution algorithms and conditionally matching rules, a method of descripting a transition function suitable for evolutionary development. A set of experiments is conducted using the standard version of genetic algorithms to determine its optimal configuration. Additionally, modifications of this standard algorithm are proposed, effect of which on the algorithm’s performance is then evaluated by further experiments.
|
guest ::
