A modal approach to hyper-redundant manipulator kinematics

This paper presents novel and efficient kinematic modeling techniques for “hyper-redundant” robots. This approach is based on a “backbone curve” that captures the robot's macroscopic geometric features. The inverse kinematic, or “hyper-redundancy resolution,” problem reduces to determining the time varying backbone curve behavior. To efficiently solve the inverse kinematics problem, the authors introduce a “modal” approach, in which a set of intrinsic backbone curve shape functions are restricted to a modal form. The singularities of the modal approach, modal non-degeneracy conditions, and modal switching are considered. For discretely segmented morphologies, the authors introduce “fitting” algorithms that determine the actuator displacements that cause the discrete manipulator to adhere to the backbone curve. These techniques are demonstrated with planar and spatial mechanism examples. They have also been implemented on a 30 degree-of-freedom robot prototype

A hyper-redundant manipulator

“Hyper-redundant” manipulators have a very large number of actuatable degrees of freedom. The benefits of hyper-redundant robots include the ability to avoid obstacles, increased robustness with respect to mechanical failure, and the ability to perform new forms of robot locomotion and grasping. The authors examine hyper-redundant manipulator design criteria and the physical implementation of one particular design: a variable geometry truss

The kinematics of hyper-redundant robot locomotion

This paper considers the kinematics of hyper-redundant (or “serpentine”) robot locomotion over uneven solid terrain, and presents algorithms to implement a variety of “gaits”. The analysis and algorithms are based on a continuous backbone curve model which captures the robot's macroscopic geometry. Two classes of gaits, based on stationary waves and traveling waves of mechanism deformation, are introduced for hyper-redundant robots of both constant and variable length. We also illustrate how the locomotion algorithms can be used to plan the manipulation of objects which are grasped in a tentacle-like manner. Several of these gaits and the manipulation algorithm have been implemented on a 30 degree-of-freedom hyper-redundant robot. Experimental results are presented to demonstrate and validate these concepts and our modeling assumptions

A General Numerical Method for Hyper-Redundant Manipulator Inverse Kinematics

Hyper-redundant robots have a very large or infinite degree of kinematic redundancy. A generalized resolved-rate technique for solving hyper-redundant manipulator inverse kinematics using a backbone curve is introduced. This method is applicable even in cases when explicit representation of the backbone curve intrinsic geometry cannot be written in closed form. Problems of end-effector trajectory tracking which were previously intractable can now be handled with this technique. Examples include configurations generated using the calculus of variations. The method is naturally parallelizable for fast digital and/or analog computation

A "Sidewinding" Locomotion Gait for Hyper-Redundant Robots

This paper considers the kinematics of a novel form of hyper-redundant mobile robot locomotion which is analogous to the 'sidewinding' locomotion of desert snakes. This form of locomotion can be generated by a repetitive travel wave of mechanism bending. Using a continuous backbone curve model, we develop algorithms which enable travel in a uniform direction as well as changes in direction

Kinematically optimal hyper-redundant manipulator configurations

“Hyper-redundant” robots have a very large or infinite degree of kinematic redundancy. This paper develops new methods for determining “optimal” hyper-redundant manipulator configurations based on a continuum formulation of kinematics. This formulation uses a backbone curve model to capture the robot's essential macroscopic geometric features. The calculus of variations is used to develop differential equations, whose solution is the optimal backbone curve shape. We show that this approach is computationally efficient on a single processor, and generates solutions in O(1) time for an N degree-of-freedom manipulator when implemented in parallel on O(N) processors. For this reason, it is better suited to hyper-redundant robots than other redundancy resolution methods. Furthermore, this approach is useful for many hyper-redundant mechanical morphologies which are not handled by known methods