Fast Motion Planning by Parallel Processing – a Review

  • Authors:
  • Dominik Henrich

  • Affiliations:
  • Institute for Real-Time Computer Systems and Robotics, Computer Science Department, University of Karlsruhe, Kaiserstrasse 12, D-76128 Karlsruhe, Germany. e-mail: dHenrich@ira.uka.de

  • Venue:
  • Journal of Intelligent and Robotic Systems
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

One of the many features needed to support the activities of autonomoussystems is the ability to plan motion. This enables robots to move in theirenvironment securely and to accomplish given tasks. Unfortunately, thecontrol loop comprising sensing, planning, and acting has not yet beenclosed for robots in dynamic environments. One reason involves the longexecution times of the motion planning component. A solution for thisproblem is offered by the use of highly parallel computation. Thus, animportant task is the parallelization of existing motion planning algorithmsfor robots so that they are suitable for highly parallel computation. Inseveral cases, completely new algorithms have to be designed, so that aparallelization is feasible. In this survey, we review recent approaches tomotion planning using parallel computation. As a classification scheme, weuse the structure given by the different approaches to the robot’smotion planning. For each approach, the available parallel processingmethods are discussed. Each approach is assigned a unique class. Finally,for each research work referenced, a list of keywords is given.