|
|
Interaktivní aplikace pro orientaci a navigaci v kampusu Jihočeské univerzity
BERAN, Pavel
The goal of this thesis is to create an application for the Android operating system, which will provide a helping hand for the orientation and movement of students at the campus of South Bohemian University, will allow users to gain their location, navigate to selected locations, obtain information about university buildings and search for this information. The application will be bilingual. This bachelor thesis contains analysis, design, implementation and testing of this application.
|
|
|
Indoor navigační systém
BARTOŠ, Michal
The topic of this bachelor thesis is to create a mobile application that allows optimal route search inside the buildings of the University of South Bohemia with respect to route parameters. The theoretical part deals with the analysis of requirements, methodology and on the basis of obtained information it selects ideal technologies for the application being developed. The practical part of the thesis describes implementation of selected technologies and subsequent testing of this application. The application implements user scenarios described in the theoretical part of the thesis.
|
|
|
Docking Station for Automatic Charging of Batteries of Robot
Beran, Jan ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
The aim of this thesis is to create a functional docking and charging system for the Trilobot robot, which is improved and modified for use in future projects as a part of this thesis. The theoretical part discusses the path planning methods, battery types and charging methods, types of docking stations and the charging method itself. Also, a robot refurbishment design is presented, which is then implemented, along with the docking station. The refurbished robot has functional control software in the ROS framework, which allows it to perform not only the task of autonomous battery charging. In this thesis, a test of the whole system is also performed and the results are evaluated.
|
|
|
Navigation Mesh for the Virtual Environment of Unreal Tournament 2004
Tomek, Jakub ; Gemrot, Jakub (advisor) ; Krajíček, Václav (referee)
Navigation mesh is a form of representation of a virtual environment, which allows effective navigation of intelligent virtual agents. This thesis deals with the development of a navigation mesh for the intelligent virtual agents in the environment of the computer game Unreal Tournament 2004. Before the development of the navigation mesh, the navigation graph was the only available representation of the environment that the agents could use for navigation. The navigation graph however provides only limited information about the environment. With the use of the navigation mesh the agents are able to navigate in the environment faster and over shorter paths. Creation of the navigation mesh from the environment's geometry extracted from Unreal Tournament 2004 map files is a part of the thesis. Finally, a new navigation module for Pogamut 3 - a platform that allows creation and controlling of intelligent virtual agents, is implemented. The new navigation module consists of the navigation mesh and a set of navigation algorithms Powered by TCPDF (www.tcpdf.org)
|
|
|
How's my connection? An assistent in mass transportation system of Prague
Hrivík, Miroslav ; Skopal, Tomáš (advisor) ; Hoksza, David (referee)
In Prague the fastest way to travel usually is by using public transport. But in such big system of buses, trams, trains, underground trains and even boats one can have difficulties to find the right way to their destination. In order to help people in their daily journeys across the city using public transport there is this application for android smartphones called Prague Transport. It has rich features like navigation, maps of city, carrier news, times of next departures and list of frequently used connections integrated in one application. Powered by TCPDF (www.tcpdf.org)
|
|
|
IVA Movement Quality Improvement for the Virtual Environment of Unreal Tournament 2004
Macháč, Bohuslav ; Gemrot, Jakub (advisor) ; Mráz, František (referee)
Title: IVA Movement Quality Improvement for the Virtual Environment of Unreal Tournament 2004 Author: Bohuslav Macháč Department / Institute: Department of Software and Computer Science Education Supervisor of the master thesis: Mgr. Jakub Gemrot, Department of Software and Computer Science Education Abstract: PogamutUT2004 is an extension of the Pogamut platform designed for developing intelligent virtual agents (IVAs) in Unreal Tournament 2004. Navigation of IVAs in Pogamut is handled by a navigation system, which uses a navigation graph as an environment abstraction. Navigation mesh is a new, more advanced abstraction, but the existing navigation system is not capable of using its advantages. We created a new navigation system, which exploits advantages of the navigation mesh and solves several other issues of the old one. We show that the new navigation system improves the quality of navigation. To demonstrate the quality improvement, an evaluation framework was created for the comparison of navigation systems. Systems were compared in terms of total number of significant paths on the map, which the system is able to follow, length of the path and time of the navigation. We selected 18 different maps for thorough evaluation and we performed the basic evaluation on 58 other maps. The new system is more...
|
|
|
Public transport route searching using moves afoot
Jiráček, Zbyněk ; Babilon, Robert (advisor) ; Foniok, Jan (referee)
Finding the fastest way between two given places is in recent hurried times quite useful thing. According to the complexity of traffic networks in larger cities a route searching engine becomes almost a necessity. Typical programs that focus on this problem usually do not pay attention to paths between individual stops and allow only movement in the scope of a single station. Many people, mostly those who do not know the area well enough, do not realize that in a city they can relatively quickly move by foot. Goal of this project is to design and implement a program which will be able to navigate user in the scope of a given city to a specified destination using means of public transport and walking. Instead of navigating only between stations, any place in map should be accepted.
|
|
|
Mobile robot control
Franěk, Dominik ; Slušný, Stanislav (advisor) ; Kudová, Petra (referee)
The goal of this work is design and realization of an autonomous mobile robot, capable of navigation and map creation, using stereoscopic camera and robotic operation system ROS. ** This is an added text for reaching minimal length needed for uploading into information system. **
|
|
|
Use of dynamic environments in the study of spatial memory
Staňková, Anna ; Svoboda, Jan (advisor) ; Vodička, Martin (referee)
Spatial memory allows movable organisms to orientate and stay therefore alive in an environment. At the beginning of previous century general rules of spatial memory were studied in static experimental conditions. Today's goal is to extend knowledge about its function also in dynamic environment. As a part of declarative memory, spatial memory depends on proper functionality of hippocampus. Hippocampus is considered to be centre of spatial memory not only because of spatial impairment when damaged, but also thanks to presence of place-specific neurons in several areas of hippocampus. In research of spatial memory experimental mazes are used with possibility to manipulate with orientation cues, maze itself and surrounding conditions. It is possible to make one-shot changes or continual changes. It could be rotation of cues and landmarks, transition of maze across the room, rotation of maze etc. Tasks in dynamic environment are more demanding on cognition and so spatial orientation, which makes them more sensitive to damages of spatial memory. This could be the way of using them as a diagnostic method in medicine.
|
|
|
Scalable dynamic graph-based vehicular routing
Polický, Adam ; Kratochvíl, Miroslav (advisor) ; Švancara, Jiří (referee)
Algorithms for finding shortest paths in large graphs form an essential part of many modern navigation and routing systems. In vehicular navigation, the problem is compli- cated by dynamic nature of the network caused by road closures and changes in traffic, preventing application of many common speed-up techniques. The aim of this thesis is to design an algorithm for finding paths in large graphs that gains efficiency and scalability by minimizing the number of visited graph objects in storage. This was achieved by itera- tively simplifying the graph into a multi-layered approximative structure, and developing a modification of Dijkstra's algorithm that allow efficient navigation in the structure. The results show that the proposed method examines 4× less graph objects than A* and 14× less than Dijkstra, achieving better performance at the cost of slightly longer discovered paths. Additionally, the layered structure is able to accommodate changes in the base graph, allowing the algorithm to work on a changing network without costly recomputations. 1
|
guest ::
