Skip to content
naulon
Not checkedNot checked for notices yet.

Optimisation of manufacturing process parameters for variable component geometries using reinforcement learning

Clemens Zimmerling, Christian Poppe, Oliver Stein and 1 more

Materials & Design · 2022

doi:10.1016/j.matdes.2022.110423 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Tailoring manufacturing processes to optimum part quality often requires numerous resource-intensive trial experiments in practice. Physics-based process simulations in combination with general-purpose optimisation algorithms allow for an a priori process optimisation and help concentrate costly trials on the most promising variants. However, considerable computation times are a significant barrier, especially for iterative optimisation. Surrogate-based optimisation often helps reduce the computational effort but surrogate models are typically case-specific and cannot adapt to different manufacturing situations. Consequently, even minor problem variations e.g. geometry adaptions invalidate the surrogate and require resampling of data and retraining of the surrogate. Reinforcement Learning aims at inferring optimal actions in variable situations. In this work, it is used to train a neural network to estimate optimal process parameters (“actions”) for variable component geometries (“situations”). The use case is fabric forming in which pressure pads are positioned to optimise the material intake. After training, the network is found to give meaningful parameter estimations even for new geometries not considered during training. Thus, it extracts reusable information from generic process samples and successfully applies it to new, non-generic components. Since data is reused rather than resampled, the approach is deemed a promising option for lean part and process development.

Abstract licence: CC BY-NC

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.