|
|
Traveling Salesman Problem
Šůstek, Martin ; Snášelová, Petra (referee) ; Zbořil, František (advisor)
This thesis is focused on modification of known principles ACO and GA to increase their performance. Thesis includes two new principles to solve TSP. One of them can be used as an initial population generator. The appendix contains the implementation of the application in Java. The description of this application is also part of the thesis. One part is devoted to optimization in order to make methods more efficient and produce shorter paths. In the end of the thesis are described experiments and their results with different number of places from 101 up to 3891.
|
|
|
Editor for Traffic Simulator
Malaník, Michal ; Snášelová, Petra (referee) ; Rozman, Jaroslav (advisor)
The aim of this work is to create an editor of intersections with a graphical user interface for Brno traffic simulator. As an input of the editor is used file of geographic data, which is downloaded from the freely available database of server OpenStreetMap. At first are in downloaded geographic data detected intersections. The detection is performed using a detector, which was also created within this work. Editor then allows to edit the intersections to be as much as possible accurate. This process involves modeling the number of lanes, layout and types of traffic lights and also traffic detectors and many other real-world objects. The edited data are then made available in the form of an output file in XML format and are hereby provided for the traffic simulator.
|
|
|
Manager for Desk Games with Parallel Tournament Playing
Čížek, Tomáš ; Snášelová, Petra (referee) ; Rozman, Jaroslav (advisor)
The theme of this work is to design and realize an application for organizing classic board game tournaments played by computer programs. The application is based on already existing Manager of board games and extends it, so there is a possibility of parallel playing games within the tournament, among other things. At the beginning I describe existing Manger of board games. Subsequently, I focus on theory of programing parallel and portable applications. The rest of the text summarizes the design and implementation of the target application.
|
|
|
Global Robot Localization Using GPS, Compass and Map
Snášelová, Petra ; Orság, Filip (referee) ; Herman, David (advisor)
The goal of this bachelor thesis is design of a global localization method for robots combining data provided by GPS, compass and maps. The purpose of such a method is to achieve more precise and reliable localization. The thesis is introducing senzor systems and global navigation. Furthermore it is focused on basic principles of Kalman's filtration applied to the designed localization method. The developed aplication ensures the localization of robot in the map and simulation of its move after maps in OSM or RNDF format and the trace record in XML format were loaded to the application.
|
|
|
Neural Networks and Genetic Algorithm
Karásek, Štěpán ; Snášelová, Petra (referee) ; Zbořil, František (advisor)
This thesis deals with evolutionary and genetic algorithms and the possible ways of combining them. The theoretical part of the thesis describes genetic algorithms and neural networks. In addition, the possible combinations and existing algorithms are presented. The practical part of this thesis describes the implementation of the algorithm NEAT and the experiments performed. A combination with differential evolution is proposed and tested. Lastly, NEAT is compared to the algorithms backpropagation (for feed-forward neural networks) and backpropagation through time (for recurrent neural networks), which are used for learning neural networks. Comparison is aimed at learning speed, network response quality and their dependence on network size.
|
|
|
Editor for Traffic Simulator
Malaník, Michal ; Snášelová, Petra (referee) ; Rozman, Jaroslav (advisor)
The aim of this work is to create an editor of intersections with a graphical user interface for Brno traffic simulator. As an input of the editor is used file of geographic data, which is downloaded from the freely available database of server OpenStreetMap. At first are in downloaded geographic data detected intersections. The detection is performed using a detector, which was also created within this work. Editor then allows to edit the intersections to be as much as possible accurate. This process involves modeling the number of lanes, layout and types of traffic lights and also traffic detectors and many other real-world objects. The edited data are then made available in the form of an output file in XML format and are hereby provided for the traffic simulator.
|
|
|
Manager for Desk Games with Parallel Tournament Playing
Čížek, Tomáš ; Snášelová, Petra (referee) ; Rozman, Jaroslav (advisor)
The theme of this work is to design and realize an application for organizing classic board game tournaments played by computer programs. The application is based on already existing Manager of board games and extends it, so there is a possibility of parallel playing games within the tournament, among other things. At the beginning I describe existing Manger of board games. Subsequently, I focus on theory of programing parallel and portable applications. The rest of the text summarizes the design and implementation of the target application.
|
|
|
Neural Networks and Genetic Algorithm
Karásek, Štěpán ; Snášelová, Petra (referee) ; Zbořil, František (advisor)
This thesis deals with evolutionary and genetic algorithms and the possible ways of combining them. The theoretical part of the thesis describes genetic algorithms and neural networks. In addition, the possible combinations and existing algorithms are presented. The practical part of this thesis describes the implementation of the algorithm NEAT and the experiments performed. A combination with differential evolution is proposed and tested. Lastly, NEAT is compared to the algorithms backpropagation (for feed-forward neural networks) and backpropagation through time (for recurrent neural networks), which are used for learning neural networks. Comparison is aimed at learning speed, network response quality and their dependence on network size.
|
|
|
Global Robot Localization Using GPS, Compass and Map
Snášelová, Petra ; Orság, Filip (referee) ; Herman, David (advisor)
The goal of this bachelor thesis is design of a global localization method for robots combining data provided by GPS, compass and maps. The purpose of such a method is to achieve more precise and reliable localization. The thesis is introducing senzor systems and global navigation. Furthermore it is focused on basic principles of Kalman's filtration applied to the designed localization method. The developed aplication ensures the localization of robot in the map and simulation of its move after maps in OSM or RNDF format and the trace record in XML format were loaded to the application.
|
|
|
Analysis of Genetic Algorithm
Snášelová, Petra ; Žák, Jakub (referee) ; Zbořil, František (advisor)
This thesis deals with analysis of genetic algorithms. It is focused on various approaches to creation of new populations. A comparison between basic principles of operation of genetic algorithms and processes occurring in living organisms is drawn here. Some methods of application of particular steps of genetic algorithms are introduced and a suitability of the methods to certain types of problems is considered. The main goal in the thesis is to apply genetic algorithms in solving three types of optimization problems, namely the solution of functions with a single major extreme, functions with flat (slight) extreme and also functions with many local extremes.
|
guest ::
