Národní úložiště šedé literatury Nalezeno 2 záznamů.  Hledání trvalo 0.00 vteřin. 
Computation geometry in robotics.
Pivovarník, Marek ; Pavlík, Jan (oponent) ; Hrdina, Jaroslav (vedoucí práce)
Thesis deals with finding forbiden configuration space for polygonal robot. The aim is to compute an obstacle shape in configuration space. This problem solves Minkowsky Sum. Also thesis deals with Minkowsky sum properties. In the rest of the thesis is mentioned algorithm to compute Minkowsky sum, its debugging and implementation to the C# enviroment.
Computation geometry in robotics.
Pivovarník, Marek ; Pavlík, Jan (oponent) ; Hrdina, Jaroslav (vedoucí práce)
Thesis deals with finding forbiden configuration space for polygonal robot. The aim is to compute an obstacle shape in configuration space. This problem solves Minkowsky Sum. Also thesis deals with Minkowsky sum properties. In the rest of the thesis is mentioned algorithm to compute Minkowsky sum, its debugging and implementation to the C# enviroment.

Chcete být upozorněni, pokud se objeví nové záznamy odpovídající tomuto dotazu?
Přihlásit se k odběru RSS.