Fast Distance Computation for On-line Collision Detection with Multi-Arm Robots

  • For the online collision detection with a multi-arm robot a fast method for computing the so-called collision vector is presented. Manipulators and obstacles are modelled by sets of convex polytopes. Known distance algorithms serve as a foundation. To speed up the collision detection dynamic obstacles are approximated by geometric primitives and organized in hierarchies. On-line, the here introduced Dynamic Hierarchies are adjusted to the current arm configuration. A comparison with previous methods shows an increased acceleration of the computations.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Dominik Henrich, Xiaoqing Cheng
URN (permanent link):urn:nbn:de:hbz:386-kluedo-9625
Document Type:Article
Language of publication:English
Year of Completion:1992
Year of Publication:1992
Publishing Institute:Technische Universität Kaiserslautern
Tag:AG-RESY ; CODET; PARO ; SKALP
Faculties / Organisational entities:Fachbereich Informatik
DDC-Cassification:004 Datenverarbeitung; Informatik
Collections:AG RESY

$Rev: 12793 $