A decision-making method for assembly sequence planning with dynamic resources

doi:10.1080/00207543.2021.1937748

Return

A decision-making method for assembly sequence planning with dynamic resources

2021-06-14

PRE

Wenbo Wu

黄

黄正东 (Zhengdong Huang) *

Jiani Zeng

Kuan Fan

DOI：10.1080/00207543.2021.1937748

Original

Original request for help

Save

Abstract

En 中文

With the advent of mass customisation, solving the assembly sequence planning (ASP) problem not only involves a non-convex optimisation problem that is hard to solve but also requires a high-speed response to the changes of assembly resources. This paper proposes a deep reinforcement learning (DRL) approach for the ASP problem, aiming at promoting the response speed by exploiting the reusability and expandability of past decision-making experiences. First, the connector-based ASP problem is described in a matrix manner, and its objective function is set to minimise assembly cost under the precedence constraints. Secondly, an instance generation algorithm is developed for policy training, and a mask algorithm is adopted to screen out impracticable assembly operations in each decision-making step. Then, the Monte Carlo sampling method is used to evaluate the ASP policy. The policy is learned from an actor-criticbased DRL algorithm, which contains two networks, policy network and evaluation network. Next, the network structures are introduced and they are trained by a mini-batch algorithm. Finally, four cases are studied to validate this method, and the results are discussed. It is demonstrated that the proposed method can solve the ASP problem accurately and efficiently in the environment with dynamic resource changes.

Keywords:

Deep reinforcement learning

computer-aided assembly planning

combinatorial optimisation

assembly sequence planning

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.