|
|
Mobile robot path planning by means of cellular automata
Holoubek, Tomáš ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This thesis deals with a path planning using cellular automata algorithms in a rectangular grid environment. Theoretical part starts with an overview of commonly used approaches for path planning and later on focuses on existing cellular automata solutions and capabilities in detail. Implemented cellular automata algorithms and the commonly used path planning algorithms are together with a map generator described in the practical part. Conclusion of this thesis contains results completed in a special application.
|
|
|
Self-Modifying Cellular Automata
Szabo, Peter ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
This work deals with cellular automata with a concept of self- modification and their comparsion against regular cellular automatons . For this task we constructed a simulator , that lets us define the logic of artificial inteligence, number generator and statistical test, which are used by the automata , on their own . Consequently two experiments are carried out that demonstrate the concept of self- modification .
|
|
|
Procedurally Generated City
Hájíček, Lukáš ; Polok, Lukáš (referee) ; Šolony, Marek (advisor)
This work is about procedural generation of cities. There are defined the different stages of city development and existing methods used to achieve them. The following describes the procedures used to implement a system capable of generating cities. The resulting generator is able to generate cities based on given parameters such as density of streets.
|
|
|
Traffic Modelling Based on Cellular Automata
Hodaňová, Andrea ; Martinek, David (referee) ; Peringer, Petr (advisor)
Among many other fields of science, cellular automata play an important role also in the microsimulations of traffic. In this thesis, we analyze the characteristics of a wide range of cellular automata traffic models from the most simple deterministic ones to complex stochastic automata derived from the pivotal Nagel-Schreckenberg model, which is thoroughly described. As a result of this analysis, a generally usable traffic simulator is designed and implemented in the Java programming language. Its graphical user interface can visualise the state of a road CA to display the key features of the implemented traffic models to the user.
|
|
|
Rendering Clouds in Real Time
Dostál, Radek ; Španěl, Michal (referee) ; Herout, Adam (advisor)
This thesis is about algorithms which render clouds in real time. The theoretical section deals with clouds in real world and also describes some algorithms for modeling and rendering them. The aim of practical section is implement one of these real time algorithms and develop demonstrational application.
|
|
|
Design of Computing Structures in Cellular Automata
Luža, Jindřich ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
The goal of this master thesis is to examine possibilities of realizing comptutational structures in cellular automata. The work describes the fundamental principles of cellular automata and summarizes some ways of how to achive the specified goal. An overview of Turing-complete and other specialized computational tasks is proposed considering both 1D and 2D cellular automata. It is shown that different computational scenarios in cellular automata can be considered with various setups of the input and output arrangements. With regard to showed inputs and outputs arrangement, sets of tests is designed to find solutions of choosen computational structures on cellular automata with use of choosen evolutionary algorithm. Found solutions are compared by computational resources consumption and difficulty of discovery later.
|
|
|
An Implementation of CellMatrix in FPGA
Martinák, Jan ; Bidlo, Michal (referee) ; Sekanina, Lukáš (advisor)
Reconfigurable hardware architecture represents a modern trend in development of the new curcuits. Rising demands on such architecture lead in efforts to create curcuit, that is able to reconfigure itself in parallel and locally. One of such technologies is the Cell Matrix which is based on principles of cellular automata. The purpose of this thesis is to inform the reader about Cell Matrix architecture and to show its advantages, functions and potentialities by implementation in FPGA on FITkit development kit.
|
|
|
Self-Replication in Cellular Automata
Mikeš, Martin ; Bidlo, Michal (referee) ; Žaloudek, Luděk (advisor)
This thesis introduces cellular automata as an environment suitable for simulating complex and massively parallel systems, built from a large number of simple cooperating units. The thesis explores self-replication and self-replicating loops - structures operating within the cellular space, particularly those capable of carrying out useful tasks. The thesis provides a description of implementation of three such loops, executing following tasks: coloring of the space within a loop, construction of letters "MM" and binary addition. A practical usability is discussed at the end.
|
|
|
Acceleration of Particles Tracking on CBM Experiment
Roth, Michael ; Kolář, Martin (referee) ; Musil, Petr (advisor)
The focus of this work is to research various methods of particle track reconstruction in the CBM experiment, and the problem of hardware acceleration of these methods. The advantages and disadvantages of the extended methods were discussed and a reconstruction method based on cellular automata and Kalman filters was selected for further study. In particular, the thesis details the development of a simulation model suitable for generating test data to facilitate future implementation of the selected tracking algorithm. Two different particle simulators have been developed and will be used in the following work to calculate the prediction step of the extended Kalman filter and to test the quality of the implemented reconstruction method.
|
|
|
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 ::
