Improved method for calculating self-motion coordinates for redundant manipulators

摘要

For a redundant manipulator, the objective of redundancy resolution is to follow a specified path in Cartesian space and simultaneously perform another task (for example, maximize an objective function or avoid obstacles) at every point along the path. The conventional methods have several drawbacks: a new function must be defined for each task, the extended Jacobian can be singular, closed cycles in Cartesian space may not yield closed cycles in joint space, and the objective is point-wise redundancy resolution (to determine a single point in joint space for each point in Cartesian space). The author divides the redundancy resolution problem into two parts: (1) calculate self-motion coordinates for all possible positions of a manipulator at each point along a Cartesian path and (2) determination of optimal self-motion coordinates that maximize an objective function along the path. This paper will discuss the first part of the problem. The path-wise approach overcomes all of the drawbacks of conventional redundancy resolution methods: no need to define a new function for each task, extended Jacobian cannot be singular, and closed cycles in extended Cartesian space will yield closed cycles in joint space.