An efficient method for computing the forward kinematics of binary manipulators
Authors:
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (10504729) , 1012-1017
Abstract
Binary actuators have only two discrete states (denoted '0' and '1'), both of which are stable without feedback. As a result, manipulators built with binary actuators have a finite number of states. Compared to a manipulator built with continuous actuators, a binary manipulator provides good performance, and is also relatively inexpensive. However, the number of states of a binary manipulator grows exponentially with the number of actuators. While this makes the calculation of its inverse kinematics quite difficult, the discrete nature of a binary manipulator makes it possible to compute its forward kinematics more efficiently than for a continuously actuated manipulator. By pre-computing all possible configurations of each module of a binary manipulator (a finite and usually small number) it is possible to compute the forward kinematics from a set of joint parameters without using any transcendental functions.Keywords
This publication has 9 references indexed in Scilit:
- Inverse kinematics of discretely actuated hyper-redundant manipulators using workspace densities2002
- A combinatorial approach to trajectory planning for binary manipulators2002
- A binary paradigm for robotic manipulators2002
- Design and fabrication of micromechanical logic elements2002
- Inverse kinematics of binary manipulators with applications to service robotics2002
- Kinematic Synthesis of Mechanisms and Robotic Manipulators With Binary ActuatorsJournal of Mechanical Design, 1995
- Efficient workspace generation for binary manipulators with many actuatorsJournal of Robotic Systems, 1995
- Orienting polygonal parts without sensorsAlgorithmica, 1993
- An exploration of sensorless manipulationIEEE Journal on Robotics and Automation, 1988