Abstract：This paper presents a fast algorithm for direct calculating the distance between convex polyhedra which is used for task planning in general robot off-line programming and simulation system named HOLPSS. This method of distance calculation is developed by direct calculating the distance between edges of convex polyhedron and using Jo function to solve point location problem. Data structure for representing the convex polyhedron is double connected edge list, which is efficient for implementing this algorithm.
 Bobrow J E. Optimal Robot Path Palnning Using the Minimum-time Criterion. IEEE J of Robotics Automat, 1988,(4):443-450
 Bobrow 1 E. A Direct Minimization Approach for Obtaining the Distance between Convex Polyhedra. Int J Robotics Res.1989,8(3):65-67
 Buchal R O. Cherchas D B. Sassani F. Duncan J P. Simulated off-line Programming of Welding Robots. Int J Robotics Res. 1989,8(3):31-43
 Gilbert E G,Iohnson D W,Keerthi S S. A Fast Procedure for Computing the Distance between Complex Objects in Three-dimensional Space. IEEE J Robotics Automat. 1988 4(2):193-203
 Wang D. Hamam Y. Optimal Trajectory Planning of Manipulators with Collision Detection and Avoidance. Int J Robotics Res. 1992.11(5):460--468
 Zeghloul S. Rambeaud P. A Direct Minimvbtion Approach for Obtaining the Distance between Convex Polyhedra by James E. Bobrow. 1nt J Robotics Res, 1992,11(5):499-501
 Red W E. Minimum Distances for Robot Task Simulation. Robotics,1985,1:231-238