Heuristic motion planning with many degrees of freedom
Thomas Chadzelek, Hotz, Günter, Elmar Schömer · 1995
Rotation 36 Some Selected Examples the path search strategy is universally applicable, but it certainly shows the limits of the programme. Figure A.4 presents the computed solution; the simple search for minimal recursion depth was used here. The individual steps of the motion are shown from left to right and top to bottom with every single picture showing a top and a front view of the room. A wire frame representation is used and the translational part of the path can be seen, too. This path can be shortened, yielding a surprisingly elegant solution. It is pictured in A.2.2 as a perspective view from the front, elevated slightly, with some transparent walls. A.2 Motion Planning For Polyhedra 35 Figure A.3: Putting a Cube Into a Box 34 Some Selected Examples closest to the centre of (a; z). The results are given in table A.4. It shows that a random point acts quite similar as the corresponding