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

Procedia CIRP(2022)

引用 0|浏览0
暂无评分
摘要
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.
更多
查看译文
关键词
Constraint Satisfaction Problem,sorting algorithm,control cabinet,wiring,solderless wrapped connection,automation,lightweight robot
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要