Please use this identifier to cite or link to this item: doi:10.22028/D291-25810
Title: Heuristic motion planning with many degrees of freedom
Author(s): Chadzelek, Thomas
Hotz, Günter
Schömer, Elmar
Language: English
Year of Publication: 1995
SWD key words: Technische Informatik
Free key words: geometric motion planning
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: We present a general heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search strategy which makes inquiries about feasible paths; to answer these, we develop an efficient collision detection scheme that handles translations and rotations of polyhedra to compute all times of collision. The whole algorithm can be easily implemented and universally applied and has been successfully tested in a program for assembly planning.
Link to this record: urn:nbn:de:bsz:291-scidok-3642
Series name: Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes
Series volume: 1995/08
Date of registration: 23-Jun-2005
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14-95-08.pdf483,65 kBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.