National Repository of Grey Literature 83 records found  previous11 - 20nextend  jump to record: Search took 0.01 seconds. 
Editor and Simulator of Traffic by Cellular Automata
Vašátko, Libor ; Zbořil, František (referee) ; Žák, Jakub (advisor)
This thesis deals with cellular automata, mainly with their application in traffic simulation. Existing simulation models Nagel-Schreckenberg and Brake-light are analyzed, and their extension to simulate intersections is designed. Application for editing and simulating of any intersection is designed and implemented. This application allows to compare different simulation models also allows to add new simulation model created by user. In the end, designed extension for simulation models is tested.
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.
Instruction-Controlled Cellular Automata
Bendl, Jaroslav ; Žaloudek, Luděk (referee) ; Bidlo, Michal (advisor)
The thesis focuses on a new concept of cellular automata control based on instructions. The instruction can be understood as a rule that checks the states of cells in pre-defined areas in the cellular neighbourhood. If a given condition is satisfied, the state of the central cell is changed according to the definition of the instruction. Because it's possible to perform more instructions in one computational step, their sequence can be understood as a form of a short program. This concept can be extended with simple operations applied to the instruction's prescription during interpretation of the instructions - an example of such operation can be row shift or column shift. An advantage of the instruction-based approach lies in the search space reduction. In comparison with the table-based approach, it isn't necessary to search all the possible configurations of the cellular neighbouhood, but only several areas determined by the instructions. While the groups of the inspected cells in the cellular neighbourhood are designed manually on the basis of the analysis of the solved task, their sequence in the chromosome is optimized by genetic algorithm. The capability of the proposed method of cellular automata control is studied on these benchmark tasks - majority, synchronization, self-organization and the design of combinational circuits.
Game for Oculus Quest
Kryštůfek, Jakub ; Novák, Jiří (referee) ; Pomikálek, Jiří (advisor)
The aim of this bachelor thesis is to create a prototype of a videogame in virtual reality for target platform Oculus Quest 2. The game was created with game engine Unity with emphasis on optimalization and extensibility of implemented systems. Within the implemented game was created system of autonomous agents via finite state machines and planning architecture goal-oriented action planning. One of the most insteresting game mechanics is fire propagation system implemented with cellular automaton.
Graphics Intro 64kB Using OpenGL
Milet, Tomáš ; Kubíček, Radek (referee) ; Vlček, Adam (advisor)
This bachelor's thesis describes creating of graphics intro with limited size using OpenGL. It describes methods for generating graphical objects, such as textures and terrain. It deals with particle system and cellular automata.
Microscopic Traffic Simulation Model Calibration
Pokorný, Pavel ; Minařík, Miloš (referee) ; Korček, Pavol (advisor)
This thesis main focus is microscopic traffic sumulation. Part of this work is the design and implementation of microsimulation model based on cellular automaton. Implemented model supports calibration with genetic algorithm. The results of calibration and simulations are included.
Procedural Generation and Simulation of 2D Gaming World
Dubský, Tomáš ; Kocur, Viktor (referee) ; Chlubna, Tomáš (advisor)
Cílem práce je implementace procedurálního generování a simulace dvojdimenzionálního herního světa. Herní svět je tvořen nekonečnou mřížkou malých dlaždic. Tyto dlaždice jsou seskupeny do částí, takže svět je generován a simulován pouze pro ty části, které jsou poblíž hráče. Generovaný terén se skládá z několika biomů a podzemních jeskyní. Kapaliny, plyny nebo třeba růst trávy patří mezi procesy, které jsou simulovány.
Prediction of the Secondary Structure of Proteins by Cellular Automaton
Šalanda, Vojtěch ; Vogel, Ivan (referee) ; Bendl, Jaroslav (advisor)
This thesis presents a new approach to the prediction of the secondary structure of proteins. It employs a new method based on cellular automata and its characteristic properties. The main objective is to increase speed of the prediction even at the cost of slight decrease of overall accuracy. Optimal parameters of cellular automata was found by genetic algorithm using suitable genetic operators. These parameters are incorporated into developed application for prediction. Finally, the results was compared with results of other tools for this purpose.
Interactive simulation by means of Flash technology
Látal, Pavel ; Šedá, Jitka (referee) ; Matoušek, Radomil (advisor)
This bachelor thesis is interested in designing of six interactive simulations by means of Flash technology. The presented interactive simulations are follows: an extended version of Conway’s cellular automata which was realized on orthogonal and hexagonal grid, simulation of 1D cellular automata, demonstration of selected selection principles of evolutionary algorithms, possible graphic representation of 2D Turing machine, and application for demonstration of ant colony behavior.
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.

National Repository of Grey Literature : 83 records found   previous11 - 20nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.