Thesis Details

Optimální plánování pohybu pro robota se všesměrovým podvozkem

Bachelor's Thesis Student: Němec Lukáš Academic Year: 2016/2017 Supervisor: Rozman Jaroslav, Ing., Ph.D.
English title
Optimal Path Planning for Omnidirectional Robot
Language
Czech
Abstract

The work is devoted to planning trips for robot, which is equipped with Mecanum omnidirectional wheels and a square carriage. The theoretical part is devoted omnidirectional wheels and various types of planners With a focus on informed planners, locating the position and movement of optimality. The practical part is devoted to the implementation of selected planners and comparing their results in terms of optimality of movement for omnidirectional robot, optimality check consists of comparing several properties of the proposed path.

Keywords

Robot, path plannig, omnidirectional, Mecanum wheels

Department
Department of Intelligent Systems FIT BUT
Degree Programme
Information Technology
Files
Status
defended, grade B
Date
15 June 2017
Reviewer
Kapinus Michal, Ing.
Committee
Janoušek Vladimír, doc. Ing., Ph.D. (DITS FIT BUT), předseda
Bidlo Michal, doc. Ing., Ph.D. (DCSY FIT BUT), člen
Chudý Peter, doc. Ing., Ph.D. MBA (DCGM FIT BUT), člen
Křivka Zbyněk, Ing., Ph.D. (DIFS FIT BUT), člen
Novák Michal, doc. RNDr., Ph.D. (DMAT FEEC BUT), člen
Citation
NĚMEC, Lukáš. Optimální plánování pohybu pro robota se všesměrovým podvozkem. Brno, 2017. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2017-06-15. Supervised by Rozman Jaroslav. Available from: https://www.fit.vut.cz/study/thesis/19183/
BibTeX 
@bachelorsthesis{FITBT19183,
    author = "Luk\'{a}\v{s} N\v{e}mec",
    type = "Bachelor's thesis",
    title = "Optim\'{a}ln\'{i} pl\'{a}nov\'{a}n\'{i} pohybu pro robota se v\v{s}esm\v{e}rov\'{y}m podvozkem",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2017,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/19183/"
}

Theses

Back to top