A Learning-Based Assembly Sequence Planning Method Using Neural Combinatorial Optimization With Satisfactory Generalization Ability

IF 6.4 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS IEEE Transactions on Automation Science and Engineering Pub Date : 2024-11-13 DOI:10.1109/TASE.2024.3493617
Ruiming Hou;Sheng Xu;Chenguang Yang;Jianghua Duan;Xinyu Wu;Tiantian Xu
{"title":"A Learning-Based Assembly Sequence Planning Method Using Neural Combinatorial Optimization With Satisfactory Generalization Ability","authors":"Ruiming Hou;Sheng Xu;Chenguang Yang;Jianghua Duan;Xinyu Wu;Tiantian Xu","doi":"10.1109/TASE.2024.3493617","DOIUrl":null,"url":null,"abstract":"This paper proposes a specific and effective real-time sequence planning method using robot manipulators to complete complex assembly tasks. Many previous studies developed different traversal methods to obtain the optimal assembly sequence. Besides, a number of algorithms were proposed to enhance flexibility when the conditions or rules were changed in various sequence optimization problems. However, these state-of-the-art (STOA) methods necessarily require modifications when task details are changed. Consequently, to further improve the generalization ability and improve the performance of the sequence optimization, a neural combinatorial optimization algorithm combined with a self-learning strategy is proposed for assembly sequence planning. In addition, obstacle avoidance and the non-collision constraints between workpieces in the assembly process are considered. According to the experiment results, the new method is superior to the STOA methods in terms of optimization efficiency. More importantly, the proposed method has satisfactory generalization ability for different assembly tasks.Note to Practitioners—This paper studies assembly sequence planning problems for different real-world applications in industrial and home service fields. Many assembly sequence planning solutions have been widely utilized before. However, the generalization ability of the previous methods is not satisfactory since the re-adjust process is required when the workpiece number or collision condition changes in different tasks.Motivated by the above reasons, this paper develops a learning-based assembly sequence planning solution to resolve complex assembly problems without parameter re-adjustment processes. Users can directly apply the developed workpiece identification and localization method to obtain the sensing information. Then, the newly designed collision-free cost function should be programmed as the core of the assembly sequence optimization. Next, the proposed neural combinatorial optimization (NCO) with the sensing information and target configuration as inputs can provide the optimal assembly sequence by self-learning. The learned NCO-based method can be directly applied to diverse planning tasks, even with different workpiece numbers. Users can also refer to the experimental examples in this paper for the extension of the proposed method to their own applications.","PeriodicalId":51060,"journal":{"name":"IEEE Transactions on Automation Science and Engineering","volume":"22 ","pages":"8952-8964"},"PeriodicalIF":6.4000,"publicationDate":"2024-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Automation Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10752093/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposes a specific and effective real-time sequence planning method using robot manipulators to complete complex assembly tasks. Many previous studies developed different traversal methods to obtain the optimal assembly sequence. Besides, a number of algorithms were proposed to enhance flexibility when the conditions or rules were changed in various sequence optimization problems. However, these state-of-the-art (STOA) methods necessarily require modifications when task details are changed. Consequently, to further improve the generalization ability and improve the performance of the sequence optimization, a neural combinatorial optimization algorithm combined with a self-learning strategy is proposed for assembly sequence planning. In addition, obstacle avoidance and the non-collision constraints between workpieces in the assembly process are considered. According to the experiment results, the new method is superior to the STOA methods in terms of optimization efficiency. More importantly, the proposed method has satisfactory generalization ability for different assembly tasks.Note to Practitioners—This paper studies assembly sequence planning problems for different real-world applications in industrial and home service fields. Many assembly sequence planning solutions have been widely utilized before. However, the generalization ability of the previous methods is not satisfactory since the re-adjust process is required when the workpiece number or collision condition changes in different tasks.Motivated by the above reasons, this paper develops a learning-based assembly sequence planning solution to resolve complex assembly problems without parameter re-adjustment processes. Users can directly apply the developed workpiece identification and localization method to obtain the sensing information. Then, the newly designed collision-free cost function should be programmed as the core of the assembly sequence optimization. Next, the proposed neural combinatorial optimization (NCO) with the sensing information and target configuration as inputs can provide the optimal assembly sequence by self-learning. The learned NCO-based method can be directly applied to diverse planning tasks, even with different workpiece numbers. Users can also refer to the experimental examples in this paper for the extension of the proposed method to their own applications.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种基于学习的装配序列规划方法,采用神经组合优化,具有令人满意的泛化能力
本文提出了一种具体有效的利用机器人机械手完成复杂装配任务的实时序列规划方法。为了获得最优装配序列,前人的研究发展了不同的遍历方法。此外,在各种序列优化问题中,为了提高条件或规则变化时的灵活性,提出了许多算法。然而,当任务细节发生变化时,这些最先进的(STOA)方法必然需要修改。因此,为了进一步提高序列优化的泛化能力和性能,提出了一种结合自学习策略的神经组合优化算法用于装配序列规划。此外,还考虑了装配过程中工件间的避障约束和不碰撞约束。实验结果表明,新方法在优化效率上优于STOA方法。更重要的是,该方法对不同的装配任务具有令人满意的泛化能力。从业人员注意:本文研究了工业和家庭服务领域中不同实际应用的装配顺序规划问题。许多装配顺序规划方法已经得到了广泛的应用。然而,由于不同任务中工件数量或碰撞条件发生变化时需要重新调整过程,以往方法的泛化能力不理想。基于以上原因,本文提出了一种基于学习的装配序列规划方法,以解决不需要参数调整过程的复杂装配问题。用户可以直接应用开发的工件识别和定位方法来获取传感信息。然后,对新设计的无碰撞代价函数进行编程,作为装配序列优化的核心。其次,以感知信息和目标构型为输入的神经组合优化(NCO)可以通过自学习提供最优装配序列。学习到的基于nco的方法可以直接应用于不同工件数量的规划任务。用户也可以参考本文的实验实例,将所提出的方法扩展到自己的应用中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Automation Science and Engineering
IEEE Transactions on Automation Science and Engineering 工程技术-自动化与控制系统
CiteScore
12.50
自引率
14.30%
发文量
404
审稿时长
3.0 months
期刊介绍: The IEEE Transactions on Automation Science and Engineering (T-ASE) publishes fundamental papers on Automation, emphasizing scientific results that advance efficiency, quality, productivity, and reliability. T-ASE encourages interdisciplinary approaches from computer science, control systems, electrical engineering, mathematics, mechanical engineering, operations research, and other fields. T-ASE welcomes results relevant to industries such as agriculture, biotechnology, healthcare, home automation, maintenance, manufacturing, pharmaceuticals, retail, security, service, supply chains, and transportation. T-ASE addresses a research community willing to integrate knowledge across disciplines and industries. For this purpose, each paper includes a Note to Practitioners that summarizes how its results can be applied or how they might be extended to apply in practice.
期刊最新文献
Automated Action Generation based on Action Field for Robotic Garment Smoothing and Alignment Reinforcement learning-based distributed secondary frequency control and active power sharing in islanded microgrids with bandwidth-conscious memory-event-triggered mechanism Toward Reliable Imitation Learning with Limited Expert Demonstrations via Search-based Inverse Dynamic Learning C-CBF: Communication-Aware Control Barrier Functions for Resilient Multi-Robot Connectivity Extended State Observer-Based Predefined Time Composite Anti-Disturbance Control for Hydraulic Cutting Arm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1