Fast motion planning by parallel processing - A review

  • One of the many features needed to support the activities of autonomous systems is the ability of motion planning. It enables robots to move in their environment securely and to accomplish given tasks. Unfortunately, the control loop comprising sensing, planning, and acting has not yet been closed for robots in dynamic environments. One reason involves the long execution times of the motion planning component. A solution for this problem is offered by the use of highly computational parallelism. Thus, an important task is the parallelization of existing motion planning algorithms for robots so that they are suitable for highly computational parallelism. In several cases, completely new algorithms have to be designed, so that a parallelization is feasible. In this survey, we review recent approaches to motion planning using parallel computation. As a classification scheme, we use the structure given by the different approaches to the robot's motion planning. For each approach, the available parallel processing methods are discussed. Each approach is uniquely assigned a class. Finally, for each referenced research work, a list of keywords is given.

Download full text files

Export metadata

Additional Services

Search Google Scholar
Metadaten
Author:Dominik Henrich
URN:urn:nbn:de:hbz:386-kluedo-9642
Document Type:Article
Language of publication:English
Year of Completion:1997
Year of first Publication:1997
Publishing Institution:Technische Universität Kaiserslautern
Date of the Publication (Server):2000/03/29
Tag:AG-RESY; PARO; SKALP; autonomous systems; motion planning; parallel algorithms; parallelism and concurrency; review; robotics
Faculties / Organisational entities:Kaiserslautern - Fachbereich Informatik
DDC-Cassification:0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik
Collections:AG RESY
Licence (German):Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011