Hostname: page-component-74656f9884-rdgjk Total loading time: 0 Render date: 2026-11-08T23:28:47.310Z Has data issue: false hasContentIssue false

Data reduction for manipulator path planning

Published online by Cambridge University Press:  24 October 2003

Werner Korb
Affiliation:
University of Heidelberg (Dept. for Maxillofacial Surgery), Im Neuenheimer Feld 400, D-69120 Heidelberg (Germany). werner_korb@med.uni-heidelberg.de
Inge Troch
Affiliation:
Vienna University of Technology (Institüt für Analysis und Technische Mathematik); Wiedner Haupstr. 8–10/114; A-1040 Vienna (Austria). inge.troch@tuwien.ac.at
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Today, in robot applications continuous paths often result from CAD or other planning tools. We present here an approach to the question that has been discussed for a long time, i.e. how to approximate a given path by a second one in such a way that the latter lies in a tube of given radius ε around the first. The approximation should be a (normally cubic) spline with a small number of breakpoints. The strategy is based on algorithms used in “computer aided geometric design” and is applied to examples from industrial and surgical robotics.

Information

Type
Research Article
Copyright
© 2003 Cambridge University Press