Optimizing the wiring sequence based on a Constraint Satisfaction Problem for robot-based manufacturing of solderless wrapped connections

Hefner F, Schmidbauer S, Franke J (2022)


Publication Type: Conference contribution

Publication year: 2022

Journal

Publisher: Elsevier B.V.

Book Volume: 112

Pages Range: 203-208

Conference Proceedings Title: Procedia CIRP

Event location: Naples IT

DOI: 10.1016/j.procir.2022.09.073

Abstract

The manufacturing of solderless wrapped connections in traceable and reproducible high quality requires an automated manufacturing process. However, one key challenge for robot-based wiring is the definition of wiring sequence, as the proximity of the array-oriented wrapposts exacerbates tool accessibility. In this research, we optimize the wiring sequence by treating it as a constraint satisfaction problem, whereby a solution is indispensable, even if the constraints are not fulfilled. Experiments on a pilot plant for robot-based manufacturing of wrapped connections show that the percentage of automatically wired connections can be significantly increased with the developed approach.

Authors with CRIS profile

How to cite

APA:

Hefner, F., Schmidbauer, S., & Franke, J. (2022). Optimizing the wiring sequence based on a Constraint Satisfaction Problem for robot-based manufacturing of solderless wrapped connections. In Roberto Teti, Doriana D'Addona (Eds.), Procedia CIRP (pp. 203-208). Naples, IT: Elsevier B.V..

MLA:

Hefner, Florian, Simon Schmidbauer, and Jörg Franke. "Optimizing the wiring sequence based on a Constraint Satisfaction Problem for robot-based manufacturing of solderless wrapped connections." Proceedings of the 15th CIRP Conference on Intelligent Computation in Manufacturing Engineering, ICME 2021, Naples Ed. Roberto Teti, Doriana D'Addona, Elsevier B.V., 2022. 203-208.

BibTeX: Download