• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
搜索

Author:

Hou, Ruiming (Hou, Ruiming.) | Xu, Sheng (Xu, Sheng.) | Yang, Chenguang (Yang, Chenguang.) | Duan, Jianghua (Duan, Jianghua.) | Wu, Xinyu (Wu, Xinyu.) | Xu, Tiantian (Xu, Tiantian.)

Indexed by:

EI Scopus SCIE

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.

Keyword:

contact matrix Assembly sequence planning (ASP) pointer network neural com- binatorial optimization (NCO) reinforcement learning (RL)

Author Community:

  • [ 1 ] [Hou, Ruiming]Chinese Acad Sci, Guangdong Prov Key Lab Robot & Intelligent Syst, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China
  • [ 2 ] [Xu, Sheng]Chinese Acad Sci, Guangdong Prov Key Lab Robot & Intelligent Syst, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China
  • [ 3 ] [Wu, Xinyu]Chinese Acad Sci, Guangdong Prov Key Lab Robot & Intelligent Syst, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China
  • [ 4 ] [Xu, Tiantian]Chinese Acad Sci, Guangdong Prov Key Lab Robot & Intelligent Syst, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China
  • [ 5 ] [Yang, Chenguang]Univ Liverpool, Dept Comp Sci, Liverpool L69 3BX, England
  • [ 6 ] [Duan, Jianghua]HKUST Shenzhen Hong Kong CollaborativeInnovat Res, Shenzhen 518048, Peoples R China
  • [ 7 ] [Xu, Tiantian]Beijing Univ Technol, Engn Res Ctr Digital Community, Minist Educ, Beijing 100124, Peoples R China

Reprint Author's Address:

  • [Xu, Sheng]Chinese Acad Sci, Guangdong Prov Key Lab Robot & Intelligent Syst, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China

Show more details

Related Keywords:

Source :

IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING

ISSN: 1545-5955

Year: 2024

Volume: 22

Page: 8952-8964

5 . 6 0 0

JCR@2022

Cited Count:

WoS CC Cited Count:

SCOPUS Cited Count:

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 12

Affiliated Colleges:

Online/Total:694/10707906
Address:BJUT Library(100 Pingleyuan,Chaoyang District,Beijing 100124, China Post Code:100124) Contact Us:010-67392185
Copyright:BJUT Library Technical Support:Beijing Aegean Software Co., Ltd.