National Repository of Grey Literature 50 records found  previous11 - 20nextend  jump to record: Search took 0.02 seconds. 
Mobile Robot Navigation
Goldmann, Tomáš ; Luža, Radim (referee) ; Orság, Filip (advisor)
When we look at the eld of robotics we nd that exist a lot of types of robots. Some of tham use location navigation and global navigation for their work. This work aims to map options of location navigation and description of basic technique which used. Especially, we will deal with algorithms which work with optical sensors, for example camera, stereocamera or laser which scan medium. Practise section this work is focused on the proposal and implementacion algorithm which working with local navigation for robot's return to the starting position. All this work is connecting with tracked robot which formed in the framework one of project realization at Faculty of information technology.
Application of distributed and stochastic algorithms in network.
Yarmolskyy, Oleksandr ; Kenyeres, Martin (referee) ; Novotný, Bohumil (advisor)
This thesis deals with the distributed and stochastic algorithms including testing their convergence in networks. The theoretical part briefly describes above mentioned algorithms, including their division, problems, advantages and disadvantages. Furthermore, two distributed algorithms and two stochastic algorithms are chosen. The practical part is done by comparing the speed of convergence on various network topologies in Matlab.
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.
Analysis of Data Flow in the Fly-by-Wire System
Kubínová, Zuzana ; Tomáš, Jan (referee) ; Matoušek, Radomil (advisor)
Software implementovaný v rámci Fly-by-Wire systému firmy Honeywell je složen z mnoha modelů implementovaných v systému Simulink. Tato práce se zabývá hledáním přímých a nepřímých spojitostí mezi jednotlivými signály v systému těchto modelů. Jako vhodný aparát je zvolena teorie grafů. Na základě modelů jsou vygenerovány grafy a úloha nalézt spojitost mezi signály je převedena na úlohu nalézt cestu mezi dvěma vrcholy grafu. Známé algoritmy k vyhledávání cest v grafech určují délku nebo váhu nalezené cesty. Pro tuto aplikaci je ale potřeba rozlišovat cesty primární a sekundární bez ohledu na jejich délku. Proto jsou tyto známé algoritmy upraveny.
Shopping Advisor
Kocourek, Jakub ; Bartík, Vladimír (referee) ; Kolář, Dušan (advisor)
The attached bachelor thesis deals with nding the shortest ways in a shop for the selected purchase. The different technologies of creating web pages are described. As for the state space search algorithms are given for nding the shortest path between two points and for solving the travel salesmen problem. The thesis continues with the description of a design and implementation of application with all used technologies (PHP, Nette, MySQL, JS, JQuery) applying the Dijkstra's algorithm for nding the shortest path and genetic algorithm for solving the travel salesmen problem.
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.
Graphs, Graph Algorithms and their Application
Pavlásek, Ondřej ; Novotná,, Veronika (referee) ; Bobalová, Martina (advisor)
This bachelor thesis represents text focused on graph theory, describes individual graph algorithms and distinguish practical examples of their use. Thesis summarizes advantages and disadvantages each of the algorithm and mention which one is suitable to use in certain situations.
Single Pair Shortest Path on Surface
Mezera, Lukáš ; Švub, Miroslav (referee) ; Šiler, Ondřej (advisor)
Finding the shortest path is a fundamental problem in computational geometry. Optimal solution is computation by force of Dijkstra algorithm. There are many approximation algorithms which we can use for calculate the shortest path.
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.

National Repository of Grey Literature : 50 records found   previous11 - 20nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.