By Topic

A fast distance calculation between convex objects by optimization approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zeghloul, S. ; Lab. de Mecanique des Solides, Poitiers Univ., France ; Rambeaud, P. ; Lallemand, J.P.

The authors describe an efficient and fast algorithm for finding the minimum distance between two convex polyhedrons in three-dimensional space. To obtain the minimal distance, the proposed computational scheme is based on a direct approach to minimize the distance function which produces a succession of optimal search directions along the boundary of the objects. This algorithm combines the gradient projection method (Rosen, 1960) and an additional optimal search direction when the gradient projection method leads to a zigzagging phenomenon. In this case, the additional optimal search direction accelerates significantly the convergence of the process. Extensive numerical experiments with convex polyhedra showed the performance of the algorithm when compared with previous approaches

Published in:

Robotics and Automation, 1992. Proceedings., 1992 IEEE International Conference on

Date of Conference:

12-14 May 1992