arrow
Return

A discrete Keplerian optimization algorithm with Q-learning for human-robot collaborative partial disassembly line balancing problem

delete2025-12-09
delete0
PRE
AI
Z
Z.C. Tan
S
Shunsheng Guo
J
Jun Guo
B
Baigang Du
K
Kaipu Wang
DOI:10.1016/j.asoc.2025.114406delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• Human-Robot collaborative partial disassembly is considered in DLBP. • An improved Keplerian optimization algorithm is proposed for HRC-PDLBP. • A Q-learning strategy is presented to adjust the local search operators. • The effectiveness of the algorithm is verified by comparison experiments.

Journal

Applied Soft Computing cover
Applied Soft Computing
IF:
6.6
Papers:
1.4W
Citations:
4.8W

Organization

W
Wuhan University of Technology
Scholars:
3.4W
Papers: 2.4W
Citations: 4.4W