|
|
Genetic Algorithms Based Game in Unity
Bábek, Radomír ; Beran, Vítězslav (referee) ; Vlnas, Michal (advisor)
This thesis focuses on the areas of game development and genetic algorithms. It describes the design and implementation of the game PlantEVO, which features special fighting plants. The player's task is to understand the workings of the genetic algorithm and to use it as efficiently as possible in breeding his plants. After then the strength of his plants is tested in online battles against other players. The battles are designed in a turn-based strategy combat style. The game uses a client-server architecture. The client is programmed in the Unity game engine, the server uses the REST API architecture.
|
|
|
Study of Fly-over Crossing High Speed Track with Conventional Line Near Vranovice
Drcmánek, Roman ; Beňák, Ľubomír (referee) ; Svoboda, Richard (advisor)
The aim of the work was to design a crossing of the VRT South Moravia with the conventional line of the railway siding Pohořelice - Vranovice. Furthermore, to model the crossing in 3D, which serves as a preparation for BIM. The beginning of the section of the designed siding is located on the outskirts of the village of Vranovice and the end of the section near the village of Přibice. The solution is proposed in 2 variants, which were then compared with the possibility of complete cancellation of the railway siding.
|
|
|
Využití operátoru křížení v kartézském genetickém programování
Bromnik, Petr ; Sekanina, Lukáš (referee) ; Hurta, Martin (advisor)
The aim of this paper is to propose and implement two new crossover methods in Cartesian Genetic Programming (CGP) and compare them with existing approaches. CGP is a type of evolutionary algorithm that uses acyclic graphs to represent executable programs. Most CGP applications use the mutation operator only, but the effort to find a suitable crossover operator is still ongoing. In this paper, the two newly proposed crossover methods are compared on five symbolic regression problems against the standard 1 + lambda procedure based purely on mutation. Experimental results show that these methods find solutions in a similar number of fitness evaluations as 1 + lambda and, in two cases, even significantly earlier.
|
|
| |
|
|
Genetic Algorithm Design for Distribution Network Outfits Optimalization
Ondruš, Tomáš ; Skala, Petr (referee) ; Paar, Martin (advisor)
The work deals with genetic algorithms and their potential use in application software to optimize high voltage switching elements of distribution network. Theoretical part explains the basic concepts of genetic algorithms such as a gene, population and chromosome and basic principles of the development of genetic algorithms.. The main task of the thesis is to design the algorithm that will simulate the distribution of the sectionalizers by telecontrolled section switches or reclosers and analyze how to set the the parameters affecting the convergence speed of genetic algorithm. The basic parameters affecting the convergence of breeding, mutation probability, population size or using of elitism. The second goal is finding a suitable set of input parameters for the selected population sizes without and with using elitism. The results of the work determine the most appropriate settings for each generation and determining the approximate number of generations needed to find the best solution. The genetic algorithm applocation was tested on a less extensive distribution network with six switching elements
|
|
|
Evolutionary algorithms
Haupt, Daniel ; Polách, Petr (referee) ; Honzík, Petr (advisor)
The first part of this work deals with the optimization and evolutionary algorithms which are used as a tool to solve complex optimization problems. The discussed algorithms are Differential Evolution, Genetic Algorithm, Simulated Annealing and deterministic non-evolutionary algorithm Taboo Search.. Consequently the discussion is held on the issue of testing the optimization algorithms through the use of the test function gallery and comparison solution all algorithms on Travelling salesman problem. In the second part of this work all above mentioned optimization algorithms are tested on 11 test functions and on three models of placement cities in Travelling salesman problem. Firstly, the experiments are carried out with unlimited number of accesses to the fitness function and secondly with limited number of accesses to the fitness function. All the data are processed statistically and graphically.
|
|
|
Evolutionary computing
Popelka, Jan ; Smékal, Zdeněk (referee) ; Karásek, Jan (advisor)
The aim of this Bachelor's Thesis was to get acquainted with the Evolutionary Optimization Techniques, mainly with the Genetic Algorithm and Genetic Programming. It was subsequently described the role of optimization problem TSP solved using Genetic Algorithms and other Chapter solving Symbolic Regression using Genetic Programming. This optimalization problems were created in the programming JAVA and there are solved practical part of the thesis.
|
|
|
Discovery of Wireless Sensor Network Topology Using Genetic Algorithms
Dalecký, Štěpán ; Samek, Jan (referee) ; Zbořil, František (advisor)
The thesis deals with a design of the genetic algorithm that is able to discover the wireless sensor network topology using signal strength among particular sensors. At first, the thesis describes the theory of genetic algorithm and wireless sensor network. Subsequently, on the basis of this theory, the genetic algorithm serving for the wireless sensor network topology discovery has been designed. The thesis also describes important features of the algorithm implementation. In conclusion, the outcomes have been reviewed.
|
|
|
Hranice – redefinition of urban structure
Varmužová, Adéla ; Veselá, Markéta (referee) ; Foretník, Jan (advisor)
I think of a library in a small town as a social center rather than a closed institution. It should be seen as part of the public space of the city, an open place with a cultural - educational and social life. Apart from the possibility of concentrated individual study, it should also provide space for group work and social gathering of residents. Authors' readings, lectures and workshops are held in such a library. The library environment should be pleasant and suitable for a long stay with plenty of natural light and contact with the exterior. It includes a literary café, a buffet and an open-air reading room. The library in Hranice is designed as a terraced "house" with walking roofs. The building creates a link between the park and the street of 1. Máje. You can walk through the library from the street to park and vice versa, both through the interior of the library and outside on its roof.
|
|
|
Crossover in Cartesian Genetic Programming
Vácha, Petr ; Vašíček, Zdeněk (referee) ; Sekanina, Lukáš (advisor)
Optimization of digital circuits still attracts much attention not only of researchers but mainly chip producers. One of new the methods for the optimization of digital circuits is cartesian genetic programming. This Master's thesis describes a new crossover operator and its implementation for cartesian genetic programming. Experimental evaluation was performed in the task of three-bit multiplier and five-bit parity circuit design.
|
guest ::
