|
|
Postal robot navigation
Jež, Radek ; Richter, Miloslav (referee) ; Janáková, Ilona (advisor)
This work deals with algorithms for postal robot control. It solves problems with finding shortest path and possible problems incurred during navigation of robot. Work includes description of used data structures and algorithms for autonomous activity. Next includes description of user interface of main control application and two supplement applications. Sequel is description of testing work in real environment and evaluation of results. At the end there are summarized information followed from testing and recommendations for next testing.
|
|
| |
|
|
Systems for remote measurement in power engineering
Hudec, Lukáš ; Mlýnek, Petr (referee) ; Mišurec, Jiří (advisor)
The work deals with the measurement and management in power. Provides an introduction to the problems of remote meter reading, management, and describes the current situation in the field of modern technologies Smart metering and Smart grids. It also analyzed the issue of collection of networks and data collection from a large number of meters over a wide area. For the purpose of data transmission are described GPRS, PLC, DSL, ... Further, there are given options to streamline communication. This area is used hierarchical aggregation. Using k-means algorithm is a program designed to calculate the number of concentrators and their location in the group of meters. The finished program is written in Java. It has a graphical interface and shows how the calculation is conducted. To verify the results of the optimization program is given simulation model in OPNET Modeler tool. Audited results are described in the conclusion and can deduce that using the optimization program is to streamline communications.
|
|
|
Graph theory - implementation of selected problems
Stráník, František ; Rajmic, Pavel (referee) ; Koutný, Martin (advisor)
This work is intended on identification with basic problems from the graphs theory area. There are the basic conceptions as well more complicated problems described. The one part of this work is specialized in working of individual types of graphs. It starts with single linked list through double linked list after as much as trees which represented the simplest graphs textures. The other part of this work devotes to the whole graph and describes more complicated problems and their resolution from the theory graphs area. Among these problems belongs to searching in graphs help by Depth First Search and Breadth First Search methods. Then searching the shortest way help by the specific algorithms as are: Dijkstra´s algorithm, Floyd-Warshall´s algorithm and Bellman-Ford´s algorithm. The last part is devoted to problems with searching minimal frames of graphs with usage Kruskal´s algorithm, Jarnik´s algorithm and Boruvka´s algorithm methods.
|
|
|
GPS Navigation system for cement technology
Mináč, Ján ; Zemánek, Pavel (referee) ; Zezulka, František (advisor)
This diploma work deals with proposal and implementation GPS navigation system. Work includes described basic types of cement quarry and proposal to create mathematical and software model of quarry. Then work is devoted to possibilities of basic described algorithms for searching the shortest way in graph and two algorithms are described. They are Floyd-Warshall and Dikjstra algorithms. The work describe implementation of Dijkstra algorithm to model of quarry and description of the programs Autec RouteEditor and AQL Control Library. MINÁČ, J. GPS navifgation system for cement for cement technology. Brno: Brno university of technology, Faculty of electrical engineering and communication, 2009. 90 p. Supervisor prof. Ing. František Zezulka, CSc.
|
|
|
Cellular Network Coverage Model
Unzeitig, Lubomír ; Mikulka, Jan (referee) ; Gleissner, Filip (advisor)
This work deals with a mobile signal propagation in electromagnetic wave form in a real environment of city microcell. The electromagnetic wave passing through the city environment is affected by many kinds of mechanism. It includes especially diffraction along vertical edges of buildings, diffraction across building roofs and buildings or ground refraction. These mechanisms are time variable. If we want to predicate them, we have to use sort of approached model. For an experimental part of this work, the Berg’s recursive model with a possibility of path loses or signal level prediction in a selected microcellular system is chosen. The software for a cellular network coverage is created on the basis of this fact. Its advantage is a possibility of up to five base stations placing and many kinds of settings, e.g. operating frequency, base station transmitting power, base and mobile station antennas height etc. There is a possibility of system GSM 900, GSM 1800 or UMTS choice. The Berg’s recursive model features are checked by simulations on experimental and real maps of build-up area.
|
|
| |
|
|
Application of Voronoi Diagrams in Robot Motion Planning
Chaloupka, Luděk ; Dvořák, Jiří (referee) ; Šeda, Miloš (advisor)
This bachelor thesis is focused on the theme of robot motion planning. The motion of dimensionless (i.e. point) robot without any restriction of motion and on the stage with static obstacles (also point) forms the fundamental issue of the thesis. The thesis also contains the implementation of presented algorithm of given level of exercises and definition of appropriate method.
|
|
|
Využití grafové databáze pro hledání vlakových spojů
Vachler, Michal
Vachler, M. Use of graph database for train connections search. Bachelor thesis. Brno: Mendel University, 2014. This bachelor's thesis addresses a design of alternative solution of train connecti-ons search for website kj.cz. Individual database systems and graph algorithms are presented in the theoretical part. The practical part then focuses on the de-sign of the application itself and its testing.
|
|
| |
guest ::
