An improved Gilbert algorithm with rapid convergence
文献类型：会议论文
| 作者 | Chang, L ; Qiao, H; Wan, AH; Keane, J
|
| 出版日期 | 2006 |
| 会议名称 | IEEE/RSJ International Conference on Intelligent Robots and Systems |
| 会议日期 | OCT 09-13, 2006 |
| 会议地点 | Beijing, PEOPLES R CHINA |
| 关键词 | Gilbert algorithm nearest point collision detection |
| 通讯作者 | Chang, L |
| 英文摘要 | Gilbert 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. |
| 会议录 | 2006 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-12
 |
| 源URL | [http://ir.ia.ac.cn/handle/173211/12854]  |
| 专题 | 自动化研究所_09年以前成果 |
| 推荐引用方式 GB/T 7714 | Chang, L,Qiao, H,Wan, AH,et al. An improved Gilbert algorithm with rapid convergence[C]. 见:IEEE/RSJ International Conference on Intelligent Robots and Systems. Beijing, PEOPLES R CHINA. OCT 09-13, 2006. |
入库方式： OAI收割
来源：自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。