Toward Real-Time Motion Planning

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

We show that parallel search techniques derived from their sequential counterparts can enable the solution of motion planning problems that are computationally impractical on sequential machines. We present a parallel version of a robot motion planning algorithm based on “quasi best first” search with randomized escape from local minima and random backtracking, and discuss its performance on a variety of problems and architectures.

Original languageEnglish (US)
Title of host publicationMachine Intelligence and Pattern Recognition
Pages163-175
Number of pages13
EditionC
DOIs
StatePublished - Jan 1 1994

Publication series

NameMachine Intelligence and Pattern Recognition
NumberC
Volume15
ISSN (Print)0923-0459

Fingerprint Dive into the research topics of 'Toward Real-Time Motion Planning'. Together they form a unique fingerprint.

Cite this