This thesis deals with analyses of problems of path planning by means Rapidly-exploring Random Trees (RRT) algorithm. The teoretic part described of basic terms and navigation mobile robots. There are localization, mapping and path planning parts of navigation. Then it is description overview of localization of methods and overview of robot path planning methods. The practical describes implementation of proposed method in Delphi. The best method for path planning of robot using RRT algorithm. For reservation universal communications interface is application creation like dynamic library.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:228220 |
| Date | January 2008 |
| Creators | Novotný, Michal |
| Contributors | Marada, Tomáš, Věchet, Stanislav |
| Publisher | Vysoké učení technické v Brně. Fakulta strojního inženýrství |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0027 seconds