University of Oulu

Andrea Baraldo, Luca Bascetta, Fabrizio Caprotti, Sumit Chourasiya, Gianni Ferretti, Angelo Ponti & Basak Sakcak (2022) Automatic computation of bending sequences for wire bending machines, International Journal of Computer Integrated Manufacturing, 35:12, 1335-1351, DOI: 10.1080/0951192X.2022.2043563

Automatic computation of bending sequences for wire bending machines

Saved in:
Author: Baraldo, Andrea1; Bascetta, Luca2; Caprotti, Fabrizio1;
Organizations: 1BLM SPA - BLM GROUP, via Selvaregina 30, 22063 Cantù (CO), Italia
2Politecnico di Milano, Dipartimento di Elettronica, Informazione e Bioingegneria, Piazza Leonardo da Vinci 32, 20133 Milano, Italia
3Center of Ubiquitous Computing, Faculty of Information Technology and Electrical Engineering, University of Oulu, Finland
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 1.9 MB)
Persistent link: http://urn.fi/urn:nbn:fi-fe2023032733289
Language: English
Published: Informa, 2022
Publish Date: 2023-03-27
Description:

Abstract

Determining a feasible bending sequence, i.e., ensuring absence of wire self-collisions and wire-machine collisions, or even an optimal bending sequence, i.e., minimising time or energy required to perform it, is a difficult and time-consuming task for complex workpieces, even for expert operators. Introducting algorithms for the computation of wire-bending sequences is thus crucial to increase productivity and production flexibility, and to decrease production costs. This work proposes an algorithm to automatically determine an appropriate bending sequence for a given workpiece, bending tool, and machine 3D CAD model, which leverages on a representation of the wire as a robotic manipulator and of a bending sequence as a tree, and on the adoption of A* as graph search algorithm. A cost and a heuristic function, suitable for the wire-bending problem, and an approach to parallelise the execution of A* are introduced, as well. In this way, a computationally simple and efficient wire-bending sequence computation algorithm is devised, able to determine a solution in an amount of time less or equal to the time used by an expert operator, without the need of high computational power. The effectiveness of this algorithm is assessed on two different test cases, relevant to industrial workpieces.

see all

Series: International journal of computer integrated manufacturing
ISSN: 0951-192X
ISSN-E: 1362-3052
ISSN-L: 0951-192X
Volume: 35
Issue: 12
Pages: 1335 - 1351
DOI: 10.1080/0951192X.2022.2043563
OADOI: https://oadoi.org/10.1080/0951192X.2022.2043563
Type of Publication: A1 Journal article – refereed
Field of Science: 213 Electronic, automation and communications engineering, electronics
Subjects:
Copyright information: © 2022 Authors. This is an Accepted Manuscript version of the following article, accepted for publication in International Journal of Computer Integrated Manufacturing. Andrea Baraldo, Luca Bascetta, Fabrizio Caprotti, Sumit Chourasiya, Gianni Ferretti, Angelo Ponti & Basak Sakcak (2022) Automatic computation of bending sequences for wire bending machines, International Journal of Computer Integrated Manufacturing, 35:12, 1335-1351, DOI: 10.1080/0951192X.2022.2043563. It is deposited under the terms of the Creative Commons Attribution-NonCommercial License (http://creativecommons.org/licenses/by-nc/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
  https://creativecommons.org/licenses/by-nc/4.0/