|
|
Path Finding in the Vector Data in OpenStreetMap Project
Adamček, Adam ; Procházka, Boris (referee) ; Váňa, Jan (advisor)
Pathfinding services are nowadays often used by people to plan a route through an unknown area. This bachelor's thesis deals with designing and implementation of an application which is able to search in free map data provided by the OpenStreetMap project and visualize resulting paths. During the search, not only the way types, but the selected transport type and the attributes of the eventual route will be taken into account as well. The work also contains an analysis of the OSM format and the proposal of a custom, more compact format useful for storing the preprocessed data. Eventually, the implemented application's performance is tested and its output is compared with other commonly used routing solutions.
|
|
|
Mobile robot path planning by means of cellular automata
Holoubek, Tomáš ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This thesis deals with a path planning using cellular automata algorithms in a rectangular grid environment. Theoretical part starts with an overview of commonly used approaches for path planning and later on focuses on existing cellular automata solutions and capabilities in detail. Implemented cellular automata algorithms and the commonly used path planning algorithms are together with a map generator described in the practical part. Conclusion of this thesis contains results completed in a special application.
|
|
|
Probabilistic Localization of Mobile Robot
Kopečný, Tomáš ; Luža, Radim (referee) ; Rozman, Jaroslav (advisor)
Motion control, navigation and sense of orientation of a mobile robot are tied to development of every mobile robot. This work concerns mainly about robot localization in the sense of orientation in space. Nevertheless, nor other aspects of mobile robotics are being omitted. Therefore, the goal of this work is to get familiar with Monte Carlo localization algorithm and apply this algorithm on a real robot.
|
|
|
Mobile robot navigation with obstacle avoidance
Stříteský, Vladimír ; Burian, František (referee) ; Žalud, Luděk (advisor)
Thesis deals with automatic guided mobile robot focused on obstacle avoidance during ride on planned route. There are summaries of usually used obstacle detecting sensors and algorithms used for path finding. Based on this, own solution is designed. It uses waypoints changes to pass obstacle. MATLAB simulation is created for tests of new designed method. This method is implemented to real robot for real world testing. Reached goals and upgrade possibilities are summarized in bottom of thesis.
|
|
|
Pathfinding in Building Map
Marko, Antonín ; Beran, Vítězslav (referee) ; Zachariáš, Michal (advisor)
The majority of large buildings contains static public panels with a building map, which are not well-arranged and it takes long time to find concrete area and find path to it. Subjects of the thesis are design and implementation of an application for 3D demonstration of a building's map and pathfinding in the map.
|
|
|
Artificial Intelligence in Modern Computer Games
Pavliska, Jiří ; Zuzaňák, Jiří (referee) ; Mikolov, Tomáš (advisor)
The aim of this bachelor's thesis is to propose an artificial inteligence that could be used to create a modern computer game. My intention is to introduce the termin Artificial Inteligence to the reader. I include the description of elements and techniques used for determining the behavior of figures that are controlled by a computer. I am also focusing the abilities of the program to search the state space and to find the shortest possible way.
|
|
|
Turtlebot in ROS framework
Bartoš, Pavel ; Šoustek, Petr (referee) ; Hůlka, Tomáš (advisor)
The aim of this work is to create a model of Turtlebot and to test it in the Gazebo environment. The paper presents a series of algorithms that simulate the movement of the robot and its ways of orientation in a selected space. The created solution provides the robot with the ability to create a collision-free course based on the sensor data. The benefit of this work is to introduce the ROS framework and bring an undestandment of its features.
|
|
|
Demonstration of State Space Search Methods
Tureček, Martin ; Drozdová, Martina (referee) ; Zbořil, František (advisor)
This bachelor's thesis describes the issue of state space search methods. Thesis was focused namely on the practical part. Its main goal was to create a demonstration application which should serve as an additional help for Fundamentals of Artificial Intelligence course. The resulting application satisfies this requirement thanks to an easy control, a possibility of steping through the alghoritm and an attractive graphic layout. The application is also implemented as a java applet, so its start should be possible from anywhere.
|
|
|
Interface for Creation of Game Agents in Jason
Rusnák, Jakub ; Samek, Jan (referee) ; Král, Jiří (advisor)
Thesis deals with creation of interface for creating agents in Jason programming language for Unreal Tournament 2004. Reader is introduced to theory of agent systems, UnrealTournament game and GameBots environment. The paper describes design of this interface and it's implementation. It also deals with the problem of finding path for bots in game. It desribes creation of your own bot using this interface. Finally, efficiency of solution is evaluated.
|
|
|
Map Generator and Path Search in a Map for the Strategy Games
Karásek, Štěpán ; Mráček, Štěpán (referee) ; Orság, Filip (advisor)
This thesis consists of two parts. The first part deals with procedural map generation aiming at terrain generation. For the most part, the bases of terrain generation, usable algorithms and the ways of generating other landscape elements are followed up. A terrain generator using diamond-square algorithm is then implemented and integrated into the existing game engine. The second part of the thesis analyses the pathfinding problem, describes usable algorithms and one of them in detail. Furthemore, the post-processing of the path is being solved and possibilities of hierarchical pathfinding algorithms are presented. Pathfinding using A* algorithm is also implemented and integrated into existing game engine. Finally, functioanality of both the algorithms is demonstrated in an interactive application.
|
guest ::
