By Topic

Very fast collision detection for practical motion planning. II. The parallel algorithm

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

3 Author(s)
Perez-Francisco, M. ; Dept. of Comput. Sci., Jaume-I Univ., Castellon, Spain ; del Pobil, A.P. ; Martinez-Salvador, B.

Practical robot motion planning for multiple moving objects in large complex scenarios requires very fast collision detection. We present an efficient algorithm for collision detection between multiple moving objects intended to be used for robot motion planning. It is based on our spherical representation for non-convex and curved object that are not partitioned into convex ones. We present results that show the stability of the approach with respect to the number of polygons used to model the scene. Numerical evidence of the efficiency of the algorithm is also shown by several experiments, in which we obtain average intersection detection times of around one millisecond using 8 or 11 processors for two closely moving robots involving 1,900 polygons

Published in:

Robotics and Automation, 1998. Proceedings. 1998 IEEE International Conference on  (Volume:1 )

Date of Conference:

16-20 May 1998