By Topic

A fast collision check algorithm EDGE for moving 3D objects

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)
Kimura, N. ; Dept. of Eng. Inf., Osaka Electro-Commun. Univ., Neyagawa, Japan ; Mori, N. ; Noborio, H.

We propose an octree-based collision check algorithm EDGE for multiple manipulators with many degrees-of-freedom. The manipulator consists of many links, and therefore it should plan a collision-free sequence of motions by a collision check between two moving 3D links. In previous octree-based algorithms, we drop each patch of an object on an octree of another object to investigate their collision. In our proposed algorithm, we drop each edge of an object on an octree of another object to find the collision. With our algorithm, tracing the edge is much faster than covering the patch on the octree. For this purpose, we first develop an efficient algorithm for finding neighbor nodes (cubes) along an edge in an octree. Next, we build a collision check algorithm with the support of the neighbor finding algorithm

Published in:

Intelligent Robots and Systems, 2000. (IROS 2000). Proceedings. 2000 IEEE/RSJ International Conference on  (Volume:3 )

Date of Conference:

2000