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.

Download full text files

Export metadata

Additional Services

Search Google Scholar
Metadaten
Author:Dominik Henrich, Xiaoqing Cheng
URN:urn:nbn:de:hbz:386-kluedo-9625
Document Type:Article
Language of publication:English
Year of Completion:1992
Year of first Publication:1992
Publishing Institution:Technische Universität Kaiserslautern
Date of the Publication (Server):2000/03/29
Tag:AG-RESY; CODET; PARO; SKALP
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