Obstacle avoidance for kinematically redundant manipulators using polyhedral approximations

Abstract

Collision avoidance is an essential requirement for a manipulator to complete a task in an environment with obstacles. In this paper, a pseudo-distance function is presented for a pair of convex polyhedra, along with the algorithm for calculating its derivative. On this basis, a potential field-based approach for obstacle avoidance of kinematically redundant manipulators is developed, with the manipulator links and the environmental obstacles being geometrically modelled as a set of convex polyhedra. The potential function is differentiable almost everywhere with respect to the joint configuration variables of the manipulator. It is incorporated in the ‘null space projection scheme’ in order to achieve obstacle avoidance. Simulation examples are presented to show the effectiveness of the proposed method.

Keywords

kinematically redundant manipulators obstacle avoidance convex polyhedra pseudo-distance repulsive potential

Get full access to this article

View all access options for this article.

References

Klein

C. A.

Huang

Review of pseudoinverse control for use with kinematically redundant manipulators. IEEE Trans. Systems, Man and Cybernetics, 1983, SMC-13, 245–250.

Baillieul

Avoiding obstacles and resolving kinematic redundancy. In Proceedings of IEEE ICRA, 1986, pp. 1698–1704.

Cao

Dodds

G. I.

Irwin

G. W.

Redundancy resolution and obstacle avoidance for cooperative industrial robots. J. Robotic Systems, 1999, 16, 405–417.

Chen

C. L.

Lin

C. J.

Motion planning of redundant robots. J. Robotic Systems, 1997, 14, 839–850.

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 ICRA, 1991, pp. 262–269.

Guo

Z. Y.

Hsia

T. C.

Joint trajectory generation for redundant robots in an environment with obstacles. J. Robotic Systems, 1993, 10, 199–215.

Liang

T. C.

Liu

J. S.

An improved trajectory planner for redundant manipulators in constrained workspace. J. Robotic Systems, 1999, 16, 339–351.

Hirose

A dynamic approach to real time obstacle avoidance control of redundant manipulators. JMSE Int. J.: Ser. C, 1996, 39, 317–322.

Maciejewski

A. A.

Klein

C. A.

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

10.

McLean

Cameron

The virtual springs method: Path planning and collision avoidance for redundant manipulators. Int. J. Robotics Res., 1996, 15, 300–319.

11.

Nakamura

Hanafusa

Yoshikawa

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

12.

Choi

S. I.

Kim

B. K.

Obstacle avoidance control for redundant manipulators using collidable measure. Robotica, 2000, 18, 143–151.

13.

Goldenberg

A. A.

J. W.

A new method of peak torque reduction with redundant manipulators. IEEE Trans. Robotics and Automn, 1997, RA-13, 845–853.

14.

Deo

A. S.

Walker

I. D.

Minimum effort inverse kinematics for redundant manipulators. IEEE Trans. Robotics and Automn, 1997, RA-13, 767–775.

15.

Ding

Wang

Recurrent neural networks for minimum infinity-norm kinematic control of redundant manipulators. IEEE Trans. Systems, Man and Cybernetics, 1999, SMC-29, 269–276.

16.

Anderson

Angeles

The kinematic inversion of robot manipulators in the presence of redundancies. Int. J. Robotics Res., 1989, 8, 80–97.

17.

Gilbert

E. G.

Johnson

D. E.

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

18.

Gilbert

E. G.

Foo

C. P.

Computing the distance between smooth objects in three dimensional space. In Proceedings of IEEE ICRA, 1989, pp. 158–163.

19.

Tang

W. S.

Liu

C. M. L.

Wang

Kinematic control and obstacle avoidance for redundant manipulators using a recurrent neural network. Lecture Notes in Computer Science, 2001, LNCS2130, p. 922 (Springer).

20.

Megiddo

Linear programming in linear time when the dimension is fixed. J. ACM, 1984, 31 (1), 114–127.

21.

Clarke

F. H.

Optimization and Nonsmooth Analysis, 1983 (John Wiley, New York).

22.

Dantzing

G. B.

Thapa

M. N.

Linear Programming—I: Introduction, 1997 (Springer-Verlag, New York).

23.

Ong

C. J.

Gilbert

E. G.

Growth distance: New measures for object separation and penetration. IEEE Trans. Robotics and Automn, 1996, 12 (6), 888–903.