Reinforcement Learning-Based Selective Disassembly Sequence Planning for the End-of-Life Products With Structure Uncertainty

Selective disassembly sequence planning (SDSP) is regarded as an efficient strategy to determine optimal disassembly sequences for extracting target parts (TP) from complex end-of-life (EOL) products. Previous research assumes that all EOL products have the same structure and the optimal selective d...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE robotics and automation letters 2021-10, Vol.6 (4), p.7807-7814
Hauptverfasser: Zhao, Xikun, Li, Congbo, Tang, Ying, Cui, Jiabin
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Selective disassembly sequence planning (SDSP) is regarded as an efficient strategy to determine optimal disassembly sequences for extracting target parts (TP) from complex end-of-life (EOL) products. Previous research assumes that all EOL products have the same structure and the optimal selective disassembly sequences are given before the EOL products are removed. However, the products have different operation states during their use stage, which results in high structure uncertainty of EOL products. The structure uncertainty of EOL products often makes the predetermined selective disassembly sequences impractical for minimizing disassembly time and maximizing disassembly profit. This letter undertakes this challenge by integrated reinforcement learning (RL) to determine the optimal disassembly sequences adaptive to the structure uncertainty of the EOL products. Firstly, a multi-level selective disassembly hybrid graph model (MSDHGM) is developed to illustrate the contact, precedence, and level relationships among parts. Then, the SDSP is formulated as a finite Markov Decision Process and a deep Q-network based selective disassembly sequence planning (DQN-SDSP) is proposed. Finally, extensive comparative experiments are conducted to verify the proposed method compared with NSGA-II and ABC algorithms.
ISSN:2377-3766
2377-3766
DOI:10.1109/LRA.2021.3098248