CASIA OpenIR  > 09年以前成果
An improved Gilbert algorithm with rapid convergence
Chang, L; Qiao, H; Wan, AH; Keane, J
2006
Conference NameIEEE/RSJ International Conference on Intelligent Robots and Systems
Source Publication2006 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-12
Conference DateOCT 09-13, 2006
Conference PlaceBeijing, PEOPLES R CHINA
AbstractGilbert algorithm is a very popular algorithm in collision detection in robotics and also in classification in pattern recognition. However, the major drawback of Gilbert algorithm is that in many cases it becomes very slow as it approaches the final solution and the vertices selection vibrates in these cases.

In this paper,

a) We prove theoretically that when the selection of vertices vibrates among several points, the algorithm will converge to the hyperplane determined by these points.

b) Based on the above results, an improved Gilbert algorithm for computing the distance between two convex polytopes is presented. The algorithm can avoid the slow convergence of the original one. Numerical simulation results demonstrate the effectiveness and advantage of the improved algorithm.
KeywordGilbert Algorithm Nearest Point Collision Detection
Document Type会议论文
Identifierhttp://ir.ia.ac.cn/handle/173211/12854
Collection09年以前成果
Corresponding AuthorChang, L
Recommended Citation
GB/T 7714
Chang, L,Qiao, H,Wan, AH,et al. An improved Gilbert algorithm with rapid convergence[C],2006.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Chang, L]'s Articles
[Qiao, H]'s Articles
[Wan, AH]'s Articles
Baidu academic
Similar articles in Baidu academic
[Chang, L]'s Articles
[Qiao, H]'s Articles
[Wan, AH]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Chang, L]'s Articles
[Qiao, H]'s Articles
[Wan, AH]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.