|
|
Semantic segmentation of aerial images
Pazdera, Jiří ; Králík, Jan (referee) ; Adámek, Roman (advisor)
This work deals with semantic segmentation of aerial images and their subsequent use for route planning. The first part represents an introduction to this issue and a theoretical description of the current state of knowledge. The second part describes testing of available segmentation methods, the development of custom dataset, and the training of an existing neural network model. Finally, the possibility of route planning using an appropriate algorithm is demonstrated.
|
|
|
Application of genetic algorithms for optimisation of agricultural machinery operation in precision farming systems
BUMBÁLEK, Roman
Metaheuristic methods, inspired by physical, biological, chemical, semantic and social phenomena, are used to optimise problems with a large number of possible solutions in a wide range of fields, including agriculture, with a significant part of evolutionary computation, of which genetic algorithms are mainly used for precision agriculture. This paper deals with their implementation in the context of the problem of planning the routes of agricultural machines with the aim of reducing the length of the trajectory of movement both on the headlands and in the inner part of the plot. The developed algorithm consists of several parts, where first the coordinates of the partial routes are calculated and then genetic algorithms are applied to optimise the rotation of the im-plements on the headlands through a suitable combination of their passes with respect to the input parameters, including the turning radius and the tool sweep. The quality of the results obtained is influenced by many factors, such as the size of the population, the number of generations or the type of selection chosen, with better solutions being generated as the number of chromosomes in the population and generations increases, allowing a reduction of more than 37 % in the distance travelled when turning on he-adlands, which can directly translate into savings in working time, fuel and reduced soil compaction.
|
|
|
Optimal path planning for electric vehicles
Horák, Filip ; Šoustek, Petr (referee) ; Kůdela, Jakub (advisor)
This master’s thesis is about optimal route planning for electric vehicles. The first, theoretical part of this work introduces the issue and describes several heuristic methods that have been used to address optimization tasks. A practical part of the thesis is based around software implementation of the methods described earlier. Finally, several experiments and comparisons of obtained results are carried out.
|
|
|
Movement Tracking in Public Transport
Paulovčák, Ján ; Rychlý, Marek (referee) ; Burget, Radek (advisor)
This master’s thesis is dedicated to user’s movement tracking in public transport, as well as to optimize route planning. In the first part, author presents information related to graph theory and graph theory algorithms, including Breadth-First Search, Djikstra’s algorithm and A*. In the second part of this thesis, author describes the design of server and mobile application including description of routing process and how individual parts works.
|
|
| |
|
|
Route Planning in Air Transport
Sychra, Marek ; Krčmář, Radim (referee) ; Křivka, Zbyněk (advisor)
The problem of route planning in air transport (in public transport in general ) is similar to the shortest path problem. The main differences are the time dependency of the input graph and the multicriterial aspect of the path costs . The aim of this thesis was to create a complex system that would be able to load elementary flights from database and then respond to user requests with combined journeys made from single flights . It was achieved using two state of the art algorithms , CSA and RAPTOR , which were adapted for the flight graph. The experiments which were run on real world data showed massive speedup of the algorithms when using the proposed optimisations . The whole system was also tested against an existing proprietary solution .
|
|
|
Online route planning with open-source applications
Matyáš, Jiří ; Schneider, Michal (advisor) ; Brůha, Lukáš (referee)
The goal of this work is to create a route planning web application while using open source tools and applications. In the beginning, tools used to produce such application are briefly introduced. The the process of creating the application is described. This paper describes the proces sof getting, editing and storing data used for route planning. The proces sof creating the web mapping application itself is described, too. Data have been stored using PostgreSQL database system and its extension PostGIS. Route planning is realized using pgRouting library and the resulting route is displayed using OpenLayers library and OpenStreetMap as a base map. The application has been created using PHP and Javascript.
|
|
|
Optimal path planning for electric vehicles
Horák, Filip ; Šoustek, Petr (referee) ; Kůdela, Jakub (advisor)
This master’s thesis is about optimal route planning for electric vehicles. The first, theoretical part of this work introduces the issue and describes several heuristic methods that have been used to address optimization tasks. A practical part of the thesis is based around software implementation of the methods described earlier. Finally, several experiments and comparisons of obtained results are carried out.
|
|
|
Route Planning in Air Transport
Sychra, Marek ; Krčmář, Radim (referee) ; Křivka, Zbyněk (advisor)
The problem of route planning in air transport (in public transport in general ) is similar to the shortest path problem. The main differences are the time dependency of the input graph and the multicriterial aspect of the path costs . The aim of this thesis was to create a complex system that would be able to load elementary flights from database and then respond to user requests with combined journeys made from single flights . It was achieved using two state of the art algorithms , CSA and RAPTOR , which were adapted for the flight graph. The experiments which were run on real world data showed massive speedup of the algorithms when using the proposed optimisations . The whole system was also tested against an existing proprietary solution .
|
|
|
Movement Tracking in Public Transport
Paulovčák, Ján ; Rychlý, Marek (referee) ; Burget, Radek (advisor)
This master’s thesis is dedicated to user’s movement tracking in public transport, as well as to optimize route planning. In the first part, author presents information related to graph theory and graph theory algorithms, including Breadth-First Search, Djikstra’s algorithm and A*. In the second part of this thesis, author describes the design of server and mobile application including description of routing process and how individual parts works.
|
guest ::
