Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
Information Technology Journal
Year: 2014  |  Volume: 13  |  Issue: 10  |  Page No.: 1723 - 1729

Hybrid Bounding Volume Hierarchy Tree (HBVHT) Algorithm for Collision Detection of Articulated Model Robot

Lin Chen, Jun Dai, Junjie Feng, Bing Fu and Haihong Pan    

Abstract: To reduce time for collision detection among articulated models, the collision detection algorithm of Hybrid Bounding Volume Hierarchy Tree (HBVHT) was proposed to accelerate the speed of culling away triangles. The HBVHT was composed of two phases: A broad phase and a narrow phase. The broad phase consisted of Axis-Aligned Bounding Box (AABB) and the Bounding Volume (BV) was used to build a Multi-Level Hierarchy Tree (MLHT); the narrow phase was made up of the Oriented Bounding Box (OBB) hierarchy trees and triangles. Furthermore, according to the characteristic of hierarchical structure of the HBVHT, an improved cost function was given to analyze the performance of the HBVHT. Experiments were performed between two 6-DOF robots under the Open GL environment. Two robots with the same number of triangles moved with the same trajectory for the collision experiments. Experimental results show that the efficiency of HBVHT algorithm is higher than that of the RAPID and the other two HBVHTs with different structure. The results indicate that the HBVHT algorithm can effectively improve the efficiency of collision detection among the articulated model robots.

Cited References   |    Fulltext    |   Related Articles   |   Back
   
 
 
 
  Related Articles

 
 
 
 
 
 
 
 
 
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility