Resolution of redundant manipulators via distance optimization

Abstract

Redundant manipulators are useful in practice as they have freedom in addition to that needed for a specific end-effector position. This additional freedom has to be properly resolved, and such redundancy resolution problems have been actively studied over the past decade. The most common scheme for redundancy resolution is achieved at the joint velocity level and does not take into account the presence of obstacles. This work presents a new scheme for redundancy resolution based on maximizing the shortest distance to obstacles. The aim is to resolve the redundancy by reconfiguring the robot to be at the safest pose or furthest from obstacles. The proposed scheme resolves the redundancy at the joint position level and, hence, has the advantage of ensuring collision-free motion. Several numerical examples in two- and three-dimensional spaces demonstrate the effectiveness of the proposed scheme.

Keywords

redundant manipulator redundancy resolution distance optimization and safest pose

Get full access to this article

View all access options for this article.

References

Nenchev

D. N.

Redundancy resolution through local optimization: A review. J. Robotic Sys., 1989, 6(6), 769–798.

Nakamura

Advanced Robotics: Redundancy and Optimization, 1991 (Addison-Wesley).

Nakamura

Hanafusa

Yoshikawa

Task-priority based redundancy control of robot manipulators. Int. J. Robotics Res., 1987, 6, 3–14.

Maciejewski

A. A.

Klein

C. A.

Obstacle avoidance for kinematically redundant manipulators in dynamically varying environments. Int. J. Robotics Res., 1985, 4(3), 109–117.

Baillieul

Avoiding obstacles and resolving kinematic redundancy. In Proceedings of IEEE International Conference on Robotics and Automation, San Francisco, California, 1986, pp. 1698–1704.

Cheng

F. T.

Chen

T. H.

Wang

Y. S.

Sun

Y. Y.

Obstacle avoidance for redundant manipulators using the Compact QP method. In Proceedings of IEEE International Conference on Robotics and Automation, Atlanta, Georgia, 1993, Vol. 3, pp. 262–269.

Sezgin

Seneviratne

L. D.

Earles

S. W. E.

Redundancy utilization for obstacle avoidance of planar robot manipulators. Proc. Instn Mech. Engrs, Part C, Journal of Mechanical Engineering Science, 1997, 211(C6), 463–475.

Burdick

Kinematic analysis and design of redundant robot manipulators. PhD thesis, Department of Mechanical and Production Engineering, Stanford University, 1988.

Gilbert

E. G.

Johnson

D. W.

Distance functions and their application of robot path planning in the presence of obstacles. IEEE J. Robotics and Automn, 1985, RA-1(1), 21–30.

10.

Ong

C. J.

On the quantification of penetration between general objects. Int. J. Robotics Res., 1997, 16(3), 400–409.

11.

Gilbert

E. G.

Johnson

D. W.

Keerthi

S. S.

A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE J. Robotics and Automn, 1988, 4(2), 193–203.

12.

Gilbert

E. G.

Foo

C. P.

Computing the distance between general convex objects in three-dimensional space. IEEE Trans. Robotics and Automn, 1990, 6(1.

13.

Fletcher

Practical Methods of Optimization, 2nd edition, 1987 (John Wiley).

14.

J. J.

Wright

S. J.

Optimization Software Guide, 1993 (Society of Industrial and Applied Mathematics).

15.

K. S.

Gonzalez

R. C.

Lee

C. S. G.

Robotics: Control, Sensing, Vision and Intelligence, 1987 (McGraw-Hill).

16.

Bobrow

J. E.

A direct minimization approach for obtaining the distance between convex polyhedra. Int. J. Robotics Res., 1989, 8, 65–76.

17.

Ong

C. J.

Gilbert

E. G.

The Gilbert-Johnson-Keerthi distance algorithm: A fast version for incremental motions. In Proceedings of IEEE International Conference on Robotics and Automation, 1997, pp. 1183–1189.

18.

Cameron

S. A.

A comparison of two fast algorithms for computing the distance between convex polyhedra. IEEE Trans. Robotics and Automn, 1997, 13(6), 915–919.

19.

Lin

M. C.

Canny

J. F.

A fast algorithm for incremental distance calculation. In Proceedings of IEEE International Conference on Robotics and Automation, 1998, pp. 3678–3684.

20.

Schittkowski

NLPQLD: A FORTRAN subroutine solving constrained nonlinear programming problems. Ann. Ops Res., 1985–86, 5, 485–500.