|
|
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.
|
|
| |
|
|
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.
|
|
|
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.
|
|
|
Game in a Shader
Ivanecký, Ján ; Milet, Tomáš (referee) ; Polok, Lukáš (advisor)
This thesis deals with design and implementation of a simple strategic game using OpenGL, whose game logic is realized by the graphics card and rendering is realized by the graphics card in one shader. It also contains introduction to OpenGL, overview of techniques used for generating procedural textures and overview of rendering methods based on Ray Casting.
|
|
|
Cellular Automata Design Optimization
Jílek, Tomáš ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
Focus of this master's thesis is on evolutionary design of cellular automata and it's optimalization. There are described Evolutionary algorithms and Cellular automata in first part. Thereafter, one of the new ways of transition function representation and its possible evolutionary design is presented. Name of this method is Conditionally Matching Rules. This is followed by description of realized experiments with detailed results. Finally, success with optimalization for some tasks is presented in last chapter along with discussion.
|
|
|
Artificial Life Simulator
Popek, Miloš ; Grulich, Lukáš (referee) ; Martinek, David (advisor)
Area of artificial life is very extensive. Simulations with reactive agents are the target of this work. Simulator of artificial life and language for definition agent's behavior are described in this work. Porposals a results of simulation made are described in this work.
|
|
|
Cellular Automaton in Evolutionary Process
Hejč, Michal ; Herrman, Tomáš (referee) ; Bidlo, Michal (advisor)
The aim of this master's theses it to focuse on the usage of genetic algorithms in combination with a technique of biologically inspired development in cellular automata. The principles of the proposed method is described. The main part of this work deals with the design of combinational logic circuits. The genetic algorithm is utilized to design a nonuniform one-dimensional cellular automaton (in particular, the local transition functions) which serves as a circuit generator. Experiments have been conducted to design of basic types of combinational circuits and polymorphic circuits. Finally, the results are presented and compared with the results obtained in the previous work in which a uniform cellular automaton was applied.
|
|
|
Quantum-Inspired Optimisation Algorithms
Kosík, Dominik ; Sekanina, Lukáš (referee) ; Bidlo, Michal (advisor)
The focus of this work is an implementation of the chosen quantum-inspired optimisation algorithm and its modifications, which will be compared at the end of the work. As the optimisation algorithm was chosen simulated quantum annealing algorithm. The first part of the work will lay the theoretical groundwork of standard optimisation algorithms used in this work, physics from which the inspiration for the simulated quantum annealing originates, and a description of the chosen algorithm. The second part will focus on the implementation of the algorithms on the selected problems. The selected problems are travelling salesman problem, searching rules for cellular automaton and MAX-SAT problem. The last part will contain the proposed modifications of the simulated quantum annealing, a comparison of the basic variant and standard optimisations algorithms, and an evaluation of the results.
|
guest ::
