On-line path planning with optimal C-space discretization

  • This paper is based on a path planning approach we reported earlier for industrial robot arms with 6 degrees of freedom in an on-line given 3D environment. It has on-line capabilities by searching in an implicit and descrete configuration space and detecting collisions in the Cartesian workspace by distance computation based on the given CAD model. Here, we present different methods for specifying the C-space discretization. Besides the usual uniform and heuristic discretization, we investigate two versions of an optimal discretization for an user-predefined Cartesian resolution. The different methods are experimentally evaluated. Additionally, we provide a set of 3- dimensional benchmark problems for a fair comparison of path planner. For each benchmark, the run-times of our planner are between only 3 and 100 seconds on a Pentium PC with 133 MHz.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Dominik Henrich, Christian Wurll, Heinz Wörn
URN (permanent link):urn:nbn:de:hbz:386-kluedo-9703
Document Type:Article
Language of publication:English
Year of Completion:1998
Year of Publication:1998
Publishing Institute:Technische Universität Kaiserslautern
Tag:AG-RESY ; PARO ; SKALP ; discretization; industrial robots ; on-line algorithms ; path planning ; search algorithms
Faculties / Organisational entities:Fachbereich Informatik
DDC-Cassification:004 Datenverarbeitung; Informatik
Collections:AG RESY

$Rev: 12793 $