A point cloud registration algorithm considering multi-allowance constraints for robotic milling of complex parts

IF 9.1 1区 计算机科学 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Robotics and Computer-integrated Manufacturing Pub Date : 2024-10-01 DOI:10.1016/j.rcim.2024.102885
Jixiang Yang, Jinxian Zhang, Tianshu Song, Han Ding
{"title":"A point cloud registration algorithm considering multi-allowance constraints for robotic milling of complex parts","authors":"Jixiang Yang,&nbsp;Jinxian Zhang,&nbsp;Tianshu Song,&nbsp;Han Ding","doi":"10.1016/j.rcim.2024.102885","DOIUrl":null,"url":null,"abstract":"<div><div>Adaptive allocation of the machining allowance is the crucial factor in ensuring the machining accuracy of complex parts. In this work, we present a multi-objective constraint registration method. First, an improved point cloud segmentation method is developed by combining point search and region data expansion algorithms. Afterward, the machining allowance is accurately calculated by using statistical analysis and multi-point sampling strategies to enhance the calculation accuracy of the point-to-triangular patch distance. Finally, a registration objective function is established by considering the allowance constraints of various geometric regions of the workpiece, and the particle swarm optimization algorithm is used to solve the optimum solution. The proposed multi-constraint registration method realizes optimal allocation of the allowance in different regions, which offers a reference coordinate system for the robotic milling of complex free-formed parts. Simulation and experimental results reveal that the developed method satisfies the minimum registration error while ensuring the allocation of allowance in the robotic milling of the casing cavity compared with other methods.</div></div>","PeriodicalId":21452,"journal":{"name":"Robotics and Computer-integrated Manufacturing","volume":"92 ","pages":"Article 102885"},"PeriodicalIF":9.1000,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Robotics and Computer-integrated Manufacturing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0736584524001728","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Adaptive allocation of the machining allowance is the crucial factor in ensuring the machining accuracy of complex parts. In this work, we present a multi-objective constraint registration method. First, an improved point cloud segmentation method is developed by combining point search and region data expansion algorithms. Afterward, the machining allowance is accurately calculated by using statistical analysis and multi-point sampling strategies to enhance the calculation accuracy of the point-to-triangular patch distance. Finally, a registration objective function is established by considering the allowance constraints of various geometric regions of the workpiece, and the particle swarm optimization algorithm is used to solve the optimum solution. The proposed multi-constraint registration method realizes optimal allocation of the allowance in different regions, which offers a reference coordinate system for the robotic milling of complex free-formed parts. Simulation and experimental results reveal that the developed method satisfies the minimum registration error while ensuring the allocation of allowance in the robotic milling of the casing cavity compared with other methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
考虑多余量约束的点云注册算法,用于复杂零件的机器人铣削
加工余量的自适应分配是确保复杂零件加工精度的关键因素。在这项工作中,我们提出了一种多目标约束注册方法。首先,结合点搜索和区域数据扩展算法,开发了一种改进的点云分割方法。然后,利用统计分析和多点采样策略精确计算加工余量,以提高点到三角形补丁距离的计算精度。最后,考虑工件各几何区域的余量约束,建立注册目标函数,并采用粒子群优化算法求解最优解。所提出的多约束注册方法实现了不同区域的余量优化分配,为复杂自由曲面零件的机器人铣削提供了参考坐标系。仿真和实验结果表明,与其他方法相比,所开发的方法在确保机器人铣削机壳型腔时的余量分配的同时,满足了最小注册误差的要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Robotics and Computer-integrated Manufacturing
Robotics and Computer-integrated Manufacturing 工程技术-工程:制造
CiteScore
24.10
自引率
13.50%
发文量
160
审稿时长
50 days
期刊介绍: The journal, Robotics and Computer-Integrated Manufacturing, focuses on sharing research applications that contribute to the development of new or enhanced robotics, manufacturing technologies, and innovative manufacturing strategies that are relevant to industry. Papers that combine theory and experimental validation are preferred, while review papers on current robotics and manufacturing issues are also considered. However, papers on traditional machining processes, modeling and simulation, supply chain management, and resource optimization are generally not within the scope of the journal, as there are more appropriate journals for these topics. Similarly, papers that are overly theoretical or mathematical will be directed to other suitable journals. The journal welcomes original papers in areas such as industrial robotics, human-robot collaboration in manufacturing, cloud-based manufacturing, cyber-physical production systems, big data analytics in manufacturing, smart mechatronics, machine learning, adaptive and sustainable manufacturing, and other fields involving unique manufacturing technologies.
期刊最新文献
Knowledge extraction for additive manufacturing process via named entity recognition with LLMs Digital Twin-driven multi-scale characterization of machining quality: current status, challenges, and future perspectives A dual knowledge embedded hybrid model based on augmented data and improved loss function for tool wear monitoring A real-time collision avoidance method for redundant dual-arm robots in an open operational environment Less gets more attention: A novel human-centered MR remote collaboration assembly method with information recommendation and visual enhancement
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1