首页 /研究 /Subassembly to Full Assembly: Effective Assembly Sequence Planning Through Graph-Based Reinforcement Learning
MANIPULATION

Subassembly to Full Assembly: Effective Assembly Sequence Planning Through Graph-Based Reinforcement Learning

Chang Shu, Антон Ким, Shinkyu Park

发表年份
2025
引用次数
1

摘要

This paper proposes an assembly sequence planning framework, named Subassembly to Assembly (S2A). The framework is designed to enable a robotic manipulator to assemble multiple parts in a prespecified structure by leveraging object manipulation actions. The primary technical challenge lies in the exponentially increasing complexity of identifying a feasible assembly sequence as the number of parts grows. To address this, we introduce a graph-based reinforcement learning approach, where a graph attention network is trained using a delayed reward assignment strategy. In this strategy, rewards are assigned only when an assembly action contributes to the successful completion of the assembly task. We validate the framework's performance through physics-based simulations, comparing it against various baselines to emphasize the significance of the proposed reward assignment approach. Additionally, we demonstrate the feasibility of deploying our framework in a real-world robotic assembly scenario.

关键词

Reinforcement learningComputer scienceSequence (biology)GraphArtificial intelligenceTheoretical computer science

相关论文

查看 MANIPULATION 分类全部论文