Thesis Details

Testování plánování cesty pro úplné pokrytí prostoru

Bachelor's Thesis Student: Krajňák Damián Academic Year: 2020/2021 Supervisor: Rozman Jaroslav, Ing., Ph.D.
English title
Testing of Coverage Path Planning
Language
Czech
Abstract

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.

Keywords

coverage path planning, path planning algorithms, robot motion, cell decomposition, adjacency graph, visualization of algorithms, testing of algorithms, robot properties

Department
Degree Programme
Information Technology
Files
Status
defended, grade E
Date
15 June 2021
Reviewer
Committee
Zbořil František, doc. Ing., Ph.D. (DITS FIT BUT), předseda
Hradiš Michal, Ing., Ph.D. (DCGM FIT BUT), člen
Kekely Lukáš, Ing., Ph.D. (DCSY FIT BUT), člen
Rogalewicz Adam, doc. Mgr., Ph.D. (DITS FIT BUT), člen
Veselý Vladimír, Ing., Ph.D. (DIFS FIT BUT), člen
Citation
KRAJŇÁK, Damián. Testování plánování cesty pro úplné pokrytí prostoru. Brno, 2021. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2021-06-15. Supervised by Rozman Jaroslav. Available from: https://www.fit.vut.cz/study/thesis/24068/
BibTeX
@bachelorsthesis{FITBT24068,
    author = "Dami\'{a}n Kraj\v{n}\'{a}k",
    type = "Bachelor's thesis",
    title = "Testov\'{a}n\'{i} pl\'{a}nov\'{a}n\'{i} cesty pro \'{u}pln\'{e} pokryt\'{i} prostoru",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2021,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/24068/"
}
Back to top