|
|
Artificial life
Weigl, František ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This bachelor thesis deals with the issue of artificial life. The first part provides a brief overview of the history of artificial life and the current division of artificial life. The second part describes some important software models of artificial life. The last part of the work contains simple experiments with a cellular automaton.
|
|
|
Procedural Generation of Dungeon Type Structures
Šipoš, Marek ; Rychlý, Marek (referee) ; Bartík, Vladimír (advisor)
The main aim of this bachelor thesis was to design and develop a library for procedural generation of dungeons and web application for its practical use. The library offers a configuration interface, output generation according to this configuration and file support. The web application allows the visualization of the obtained input. The implementation was done in Java language.
|
|
|
New Cellular Automata Design Techniques
Baláž, Martin ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
The aim of this master thesis is to introduce a new technique for the design of cellular automata which will provide a better possibilities for the implementation and solving given problems in an environment of non-uniform automata. In this work, the theoretical foundations of cellular automata have been summarized and the possibilities of their design were examined using two evolutionary principles that have commonly been used - genetic algorithm and cellular programming. Two principally different issues were selected on which the possibilities and capabilities of these techniques were proven: the synchronization problem and the system of implementation of logic gates in an environment of cellular automata. Based on a review of the implementation properties and the initial results of usage of these methods a new design method for cellular automata was created - cellular evolution. The cellular evolution with its method of "prediction of the future state of surrounding cells" provides new possibilities in the design of cellular automata since it operates with structured genes which allow the gene to be active for a variety of cellular surroundings. In the conclusion of this work, all three methods were compared on two selected problems and their abilities were summarized in a detailed overview.
|
|
| |
|
|
Calibration of the high-speed traffic microsimulation
Korček, Pavol ; Apeltauer, Tomáš (referee) ; Pospíchal, Jiří (referee) ; Sekanina, Lukáš (advisor)
Tato disertační práce je zaměřena na vysokorychlostní simulace dopravy a jejich přesnou kalibraci pomocí různých typů dopravních dat. Práce se po úvodním popisu motivace pro samotný výzkum nejdříve věnuje současnému stavu poznání, a dále rozdělení simulátorů dopravy, zejména podle typu dat, se kterými se v nich pracuje. Úpravou existujícího řešení je navržen vlastní mikrosimulační model, který je založen na principu celulárního automatu. S tímto novým modelem je pak experimentováno, zpočátku z pohledu rychlosti simulace a další rozšiřitelnosti. Je navržena a popsána technika, kterou je možné navržený model významně akcelerovat a následně provádět simulace rychleji než v reálném čase i pro rozsáhlá území. Práce dále přistupuje k samotné kalibraci modelu, ke které byl využit evoluční přístup. Je představena metoda pro efektivní způsob optimalizace parametrů mikrosimulačního modelu, která nevyžaduje citlivostní analýzu a je schopná nalézt jinak obtížně nastavitelné parametry modelu. Kvalita získaných optimalizovaných modelů byla analyzována jak pomocí makroskopických, tak i mikroskopických dopravních dat, a to i s ohledem na jejich reálné vlastnosti, tj. chybějící vzorky. Dále jsou zhodnoceny výkonnostní a jiné kvalitativní parametry vlastního přístupu v porovnání s existujícími řešeními, přičemž bylo dosaženo významného zlepšení. Nakonec jsou představeny nástroje, které v rámci řešení vznikly. Na závěr je uvedeno další zaměření výzkumu, a to zejména s ohledem na využití výsledků práce v praxi.
|
|
| |
|
|
Optimization Using Ant Algorithms
Válek, Matěj ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
This bachelor thesis will deal with various applications of ant colony optimisation. In particular, Ant Colony System will be applied on the optimisation of traveling salesman problem and the design of rules for the development of cellular automata. The obtained results will be statistically analysed. Moreover, a GUI-based application has been developed which allows to interactively observe the progress of Ant Colony System for the educational purposes.
|
|
|
Logic Game Based on Cellular Automaton
Škopková, Věra ; Trunda, Otakar (advisor) ; Chromý, Miloš (referee)
This thesis is concerned with the usage of cellular automata in development of a logic game. It describes benefits and drawbacks of individual types of cellular automata and its potential for being used in a logic game. It contains detailed description of the game rules and the user interface including the design process. The created game supports one-dimensional cellular automata containing from two up to ten states and is able to work with common and totalistic transition functions. The goal of the game is to uncover values of all cells that were generated by the cellular automaton, according to the rules of the transition function that are known to the user. It is possible to set game and visual parameters variedly. In addition, the game provides two tools for creating new cellular automata. The first is a visual editor, which allows the user to create new automata or correct the existing ones. The second is a generator that can deduce rules and values of the default generation of cells from which the specific picture can be generated.
|
|
|
Using Cellular Automata for Data Compression
Polák, Marek ; Trunda, Otakar (advisor) ; Mráz, František (referee)
In this thesis we research the possibilities of using cellular automata for lossless data compression. We describe the classification of cellular automata and their current usage. We study the properties of various types of elementary cellular automata (i.e. Wolfram rules), describe their equivalence classes, the ways of forward as well as backward simulation, we examine the rules with interesting behavior. The states provided by these rules are evaluated in terms of their orderliness (e.g. the ratio of living cells or approximation of entropy). We implement some standard compression algorithms and compare them in terms of usability for best rated states. By application of acquired knowledge we propose a new compression algorithm, test it on text and image data and compare the results with traditional compression algorithms. Powered by TCPDF (www.tcpdf.org)
|
|
|
Cellular Automata
Amemori, Josef ; Barták, Roman (advisor) ; Mráz, František (referee)
A Cellular automaton is a simple mathematical model that can exhibit a complex behavior. It was introduced by Von Neumann who was trying to find a mathematical description for a self-reproduction. Among well known works about self-reproduction belongs works from Hiroky Sayama. He introduced a model, that was capable of a simple evolution. This work expands Sayama`s evolving model by simple interactions inspired by competitions of specieces. The aim of the work is observe better dynamics than in Sayama`s model.
|
guest ::
