This diploma project is focused on possible applications of computational geometry methods for robot motion planning among static and dynamic obstacles, particularly based on global robot motion planning by means of generalised Voronoi diagrams. The main effort was to convert this complex geometric and analytic problem to graph theory environment where the tasks of planning and searching paths between pairs of the graph vertices are effeciently solvable. The Voronoi diagram is created considering the whole searching space, while edges of this diagram satisfy that the distance from the surrounding obstacles is maximised and the path found along the Voronoi diagram edges is optimised from the point of view of its security (and it is collision-free).
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:227871 |
| Date | January 2008 |
| Creators | Pich, Václav |
| Contributors | Březina, Tomáš, Šeda, Miloš |
| 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.1095 seconds