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

被引:0
作者
Hou, Ruiming [1 ]
Xu, Sheng [1 ]
Yang, Chenguang [2 ]
Duan, Jianghua [3 ]
Wu, Xinyu [1 ]
Xu, Tiantian [1 ,4 ]
机构
[1] Chinese Acad Sci, Guangdong Prov Key Lab Robot & Intelligent Syst, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China
[2] Univ Liverpool, Dept Comp Sci, Liverpool L69 3BX, England
[3] HKUST Shenzhen Hong Kong CollaborativeInnovat Res, Shenzhen 518048, Peoples R China
[4] Beijing Univ Technol, Engn Res Ctr Digital Community, Minist Educ, Beijing 100124, Peoples R China
基金
中国国家自然科学基金;
关键词
Assembly sequence planning (ASP); neural com- binatorial optimization (NCO); contact matrix; pointer network; reinforcement learning (RL); ALGORITHM; GRAPH;
D O I
10.1109/TASE.2024.3493617
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:13
相关论文
共 46 条
  • [1] A review on assembly sequence generation and its automation
    Bahubalendruni, M. V. A. Raju
    Biswal, Bibhuti Bhusan
    [J]. PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART C-JOURNAL OF MECHANICAL ENGINEERING SCIENCE, 2016, 230 (05) : 824 - 838
  • [2] Bello I., 2017, arXiv
  • [3] SIMULATED ANNEALING
    BERTSIMAS, D
    TSITSIKLIS, J
    [J]. STATISTICAL SCIENCE, 1993, 8 (01) : 10 - 15
  • [4] An actor-critic algorithm for constrained Markov decision processes
    Borkar, VS
    [J]. SYSTEMS & CONTROL LETTERS, 2005, 54 (03) : 207 - 213
  • [5] CHEN CLP, 1992, J INTELL MANUF, V3, P251, DOI 10.1007/BF01473902
  • [6] AUTOMATIC ASSEMBLY SEQUENCES GENERATION BY PATTERN-MATCHING
    CHEN, CLP
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1991, 21 (02): : 376 - 389
  • [7] Planning to Build Block Structures With Unstable Intermediate States Using Two Manipulators
    Chen, Hao
    Wan, Weiwei
    Koyama, Keisuke
    Harada, Kensuke
    [J]. IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2022, 19 (04) : 3777 - 3793
  • [8] RAMP: A Benchmark for Evaluating Robotic Assembly Manipulation and Planning
    Collins J.
    Robson M.
    Yamada J.
    Sridharan M.
    Janik K.
    Posner I.
    [J]. IEEE Robotics and Automation Letters, 2024, 9 (01) : 9 - 16
  • [9] Assembly sequence planning using soft computing methods: A review
    Deepak, B. B. V. L.
    Murali, G. Bala
    Bahubalendruni, M. V. A. Raju
    Biswal, B. B.
    [J]. PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART E-JOURNAL OF PROCESS MECHANICAL ENGINEERING, 2019, 233 (03) : 653 - 683
  • [10] Garmendia A.I., 2022, arXiv