|
|
Testing of Coverage Path Planning
Krajňák, Damián ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
The aim of this thesis is to design and implement a program with graphical user interface, designed for algorithm testing and complete coverage of a given area. Problem was solved by decomposition of a 2D space into cells, which were sequentially covered. The areas of individual cells are covered in a way, that is selected based on the selected algorithm. Created solution provides a draft of an optimal pathway for robots intended for complete coverage of space, which are, for example, autonomous vacuum cleaners, cleaning robots, robotic lawn mowers etc.
|
|
|
Path Planning Algorithms Visualisation
Bréda, Márton ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
Cílem tohoto práce je ukázat některé z nejdůležitějších algoritmů používaných při plánování cest. To také popisuje aplikaci, která byla vytvořena, aby umožnila lidem experimentovat s těmito algoritmy. K tomuto účelu využívá knihovnu, kterou v roce 2017 představil Jakub Rusnák, tzn jde o pokračování a možná i rozšíření jeho práce.
|
|
|
Path Planning Algorithms Visualisation
Řepka, Michal ; Uhlíř, Václav (referee) ; Rozman, Jaroslav (advisor)
Finding of collision free path is central in creation of mobile, autonomous robot. Goal of this paper is to show the most important algorithms implementing such solutions. It also describes application that is being created to allow students experiment with these methods. For this purpose it uses library that was introduced by Jakub Rusnák in 2017, which means this is a continuation and possibly extension of his work.
|
|
|
Path Planning for Autonomous Agricultural Machines
Kuchta, Lukáš ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
With the ever-growing human population on Earth, it is necessary to ensure that the agricultural sector also grows in order to ensure enough food for all people. One way to ensure this is to increase automation in this area. Since fewer and fewer people are engaged in agriculture, more or less autonomous devices are being used more often. This work deals with a summary of algorithms that are used for route planning (not only) in the field of agriculture, which is one of the key components of autonomous vehicles. First, the history in this area is summarized, followed by the current state of autonomous vehicles in agriculture. Next, point-to-point algorithms are summarized, followed by coverage routing algorithms. The next part deals with the use of these algorithms in practice. The next part describes the design of the application, which is implemented in the next part of this work. A program is created that creates a coverage map for the specified field and machine. Finally, the results of the work are summarized.
|
|
|
Path Planning Algorithms Visualisation
Bréda, Márton ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
Cílem tohoto práce je ukázat některé z nejdůležitějších algoritmů používaných při plánování cest. To také popisuje aplikaci, která byla vytvořena, aby umožnila lidem experimentovat s těmito algoritmy. K tomuto účelu využívá knihovnu, kterou v roce 2017 představil Jakub Rusnák, tzn jde o pokračování a možná i rozšíření jeho práce.
|
|
|
Testing of Coverage Path Planning
Krajňák, Damián ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
The aim of this thesis is to design and implement a program with graphical user interface, designed for algorithm testing and complete coverage of a given area. Problem was solved by decomposition of a 2D space into cells, which were sequentially covered. The areas of individual cells are covered in a way, that is selected based on the selected algorithm. Created solution provides a draft of an optimal pathway for robots intended for complete coverage of space, which are, for example, autonomous vacuum cleaners, cleaning robots, robotic lawn mowers etc.
|
|
|
Path Planning Algorithms Visualisation
Řepka, Michal ; Uhlíř, Václav (referee) ; Rozman, Jaroslav (advisor)
Finding of collision free path is central in creation of mobile, autonomous robot. Goal of this paper is to show the most important algorithms implementing such solutions. It also describes application that is being created to allow students experiment with these methods. For this purpose it uses library that was introduced by Jakub Rusnák in 2017, which means this is a continuation and possibly extension of his work.
|
guest ::
