Abstract
In this paper we present a new, and extremely fast, algorithm for the inverse kinematics of discretely actuated manipulator arms with many degrees of freedom. Our only assumption is that the arm is macroscopically serial in structure, meaning that the overall structure is a serial cascade of units with each unit having either a serial or parallel kinematic structure. Our algorithm builds on previous works in which the authors and coworkers have used the workspace density function in a breadth-first search for solving the inverse kinematics problem. The novelty of the method presented here is that only the 'mean' of this workspace density function is used. Hence the requirement of storing a sampled version of the workspace density function (which is a function on a six-dimensional space in the case of a spatial manipulator) is circumvented. We illustrate the technique with both planar revolute and variable-geometry-truss manipulators, and briefly describe a new manipulator design for which this algorithm is applicable.
| Original language | English |
|---|---|
| Pages (from-to) | 225-244 |
| Number of pages | 20 |
| Journal | Advanced Robotics |
| Volume | 15 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2001 |
| Externally published | Yes |
Keywords
- Discrete actuation
- Groups
- Inverse kinematics
- Probability density function
- Rigid-body motion
- Statistics
Fingerprint
Dive into the research topics of 'A new inverse kinematics algorithm for binary manipulators with many actuators'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver