By Topic

An Algorithm on Collision Detection by Computing the Minimum Distance between Two Convex Polyhedra

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
$31 $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

4 Author(s)
Hanjun Jin ; Dept. of Comput. Sci., Central China Normal Univ., Wuhan ; Yanlin Wang ; Xiaorong Wang ; Jia Fu

The problem of tracking the distance between two convex polyhedra is finding applications in many areas of robotics, including intersection detection, collision detection, and path planning. An algorithm for computing the minimum distance between two convex polyhedra is presented. The algorithm applies to polyhedral objects that can be represented as convex hulls of its vertex value in three-dimensional space. Nonlinear programming techniques are then employed to compute the minimum distance between two convex polyhedra, and according to the minimum distance, it can conclude whether or not the objects has collided at some time. The simulation results demonstrate the performance of this new method

Published in:

Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on  (Volume:2 )

Date of Conference:

0-0 0