J4 ›› 2008, Vol. 30 ›› Issue (6): 83-85.
• 论文 • 上一篇 下一篇
朱根松[1,2] 周天瑞[1]
出版日期:
发布日期:
Online:
Published:
摘要:
本文研究了蚁群算法在反求工程曲线重建中的实现方法,并对蚁群算法的蚂蚁数量、参数q、解空间及初始信息分布进行了优化,以克服蚁群算法早熟现象,满足反求工程中曲线重建实时快速的要求。经实验验证,用蚁群算法重建的曲线更光顺,能更好地反映点集的形状,但曲线重建的时间复杂度更大。
关键词: 反求工程 蚁群算法 点云数据 曲线重建
Abstract:
The paper studies the implementation method of the Ant Colony Optimization (ACO) algorithm in the curve reconstruction of reverse engineering. To so lve the shortcomings and satisfy the real-time requests of curve reconstruction, we optimize the number of ants, the q parameter, the solution candidates and the begin-pheromone. Experiments show the conclusion is that the curve reconstructed by the ASO-curve reconstruction is smoother and can reflect t he shape of the scattered points better, but needs more time.
Key words: reverse engineering, ant colony optimization, cloud point, curve reconstruction
朱根松[1,2] 周天瑞[1]. 蚁群算法在反求工程曲线重建中的应用[J]. J4, 2008, 30(6): 83-85.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://joces.nudt.edu.cn/CN/
http://joces.nudt.edu.cn/CN/Y2008/V30/I6/83