Bitte benutzen Sie diese Referenz, um auf diese Ressource zu verweisen: doi:10.22028/D291-25811
Titel: Heuristische Bewegungsplanungsstrategien im IR^3
Verfasser: Eckstein, Jens
Hotz, Günter
Schömer, Elmar
Sprache: Deutsch
Erscheinungsjahr: 1995
SWD-Schlagwörter: Technische Informatik
Freie Schlagwörter: heuristische Bewegungsplanungsstrategie
geometric motion planning
DDC-Sachgruppe: 004 Informatik
Dokumentart : Report (Bericht)
Kurzfassung: Two general heuristic approaches to the geometric motion planning problem are considered. Both heuristics make use of efficient collision detection algorithms and combine motion planning with collision detection to speed up planning or to extend planning facilities. The first approach tries to speed up motion planning by ignoring all obstacles in the scene which do not contribute to the planned collision-free path. In order to obtain such a minimal scene the heuristic computes a collision-free path in a scene and checks the planned paths for collisions with ignored obstacles using standard collision detection algorithms. The heuristic thereby conserves qualitative features of the algorithms used like completeness, computation of most-secure, euclidian-shortest or time-optimal paths. It can be used with any kind of motion planning algorithms like classical ones, algorithms for dynamical environments or multiple moving objects. The advantages of the heuristic are shown for a complete algorithm handling 3-dimensional objects with two translational degrees of freedom using the configuration space approach of Lozano-Perez and Wesley. The second heuristic extends the facilities of algorithms for static environments by classifying the obstacles in the scene in fixed and movable obstacles forming a motion planning problem with many degrees of freedom. The complex problem is decomposed in a series of simple problems which can be solved efficiently by known algorithms and the solutions are combined to a solution for the whole problem. It is shown that together with a problem modification strategy the heuristic nearly always extends and never reduces the facilities of motion planning algorithms in static environments.
Link zu diesem Datensatz: urn:nbn:de:bsz:291-scidok-3667
hdl:20.500.11880/25867
http://dx.doi.org/10.22028/D291-25811
Schriftenreihe: Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes
Band: 1995/05
SciDok-Publikation: 23-Jun-2005
Fakultät: Fakultät 6 - Naturwissenschaftlich-Technische Fakultät I
Fachrichtung: MI - Informatik
Fakultät / Institution:MI - Fakultät für Mathematik und Informatik

Dateien zu dieser Ressource:
Datei Beschreibung GrößeFormat 
diplom.pdf1,04 MBAdobe PDFÖffnen/Anzeigen


Alle Ressourcen in diesem Repository sind urheberrechtlich geschützt.