Automatic computation of bending sequences for double-head wire bending machines
Baraldo, Andrea; Bascetta, Luca; Caprotti, Fabrizio; Chourasiya, Sumit; Ferretti, Gianni; Ponti, Angelo; Sakcak, Basak (2024-02-20)
Avaa tiedosto
Sisältö avataan julkiseksi: 20.02.2025
Taylor & Francis
20.02.2024
Baraldo, A., Bascetta, L., Caprotti, F., Chourasiya, S., Ferretti, G., Ponti, A., & Sakcak, B. (2024). Automatic computation of bending sequences for double-head wire bending machines. International Journal of Computer Integrated Manufacturing, 1–12. https://doi.org/10.1080/0951192X.2024.2314788
https://creativecommons.org/licenses/by-nc-nd/4.0/
Copyright © 2024 Informa UK Limited. This is an Accepted Manuscript version of the following article, accepted for publication in International Journal of Computer Integrated Manufacturing. Baraldo, A., Bascetta, L., Caprotti, F., Chourasiya, S., Ferretti, G., Ponti, A., & Sakcak, B. (2024). Automatic computation of bending sequences for double-head wire bending machines. International Journal of Computer Integrated Manufacturing, 1–12. https://doi.org/10.1080/0951192X.2024.2314788. It is deposited under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives License (http://creativecommons.org/licenses/by-nc-nd/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original work is properly cited, and is not altered, transformed, or built upon in any way.
https://creativecommons.org/licenses/by-nc-nd/4.0/
Copyright © 2024 Informa UK Limited. This is an Accepted Manuscript version of the following article, accepted for publication in International Journal of Computer Integrated Manufacturing. Baraldo, A., Bascetta, L., Caprotti, F., Chourasiya, S., Ferretti, G., Ponti, A., & Sakcak, B. (2024). Automatic computation of bending sequences for double-head wire bending machines. International Journal of Computer Integrated Manufacturing, 1–12. https://doi.org/10.1080/0951192X.2024.2314788. It is deposited under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives License (http://creativecommons.org/licenses/by-nc-nd/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original work is properly cited, and is not altered, transformed, or built upon in any way.
https://creativecommons.org/licenses/by-nc-nd/4.0/
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:oulu-202404242922
https://urn.fi/URN:NBN:fi:oulu-202404242922
Tiivistelmä
Abstract
Determining a feasible bending sequence for a double-head bending machine is a challenging and time-consuming task, even for an expert operator. An automatic bending sequence computation algorithm for a single-head bending machine was proposed in a previous work, exploiting A ⋆
graph search algorithm and the representation of the workpiece as an equivalent manipulator. This paper extends that approach to the case of a double-head bending machine, whose complexity, in terms of number of possible solutions to the problem of computing the feasible bending sequences, and of determination of the better sequences, that should exploit parallelism thanks to the execution of simultaneous bends on the two heads, is definitely higher. In this case, the wire has been modelled using two serial-link manipulators with a common base, and the A ⋆ cost function has been modified to promote simultaneous bends. An axes reachability-based path generator and the possibility of partial sequence search have been incorporated as well, to manage the run-time challenges due to an increased number of bends. In this way, an efficient bending sequence computation algorithm for a double-head wire bending machine has been devised, whose performance has been assessed on two industrial test cases, demonstrating its effectiveness and usefulness.
Determining a feasible bending sequence for a double-head bending machine is a challenging and time-consuming task, even for an expert operator. An automatic bending sequence computation algorithm for a single-head bending machine was proposed in a previous work, exploiting A ⋆
graph search algorithm and the representation of the workpiece as an equivalent manipulator. This paper extends that approach to the case of a double-head bending machine, whose complexity, in terms of number of possible solutions to the problem of computing the feasible bending sequences, and of determination of the better sequences, that should exploit parallelism thanks to the execution of simultaneous bends on the two heads, is definitely higher. In this case, the wire has been modelled using two serial-link manipulators with a common base, and the A ⋆ cost function has been modified to promote simultaneous bends. An axes reachability-based path generator and the possibility of partial sequence search have been incorporated as well, to manage the run-time challenges due to an increased number of bends. In this way, an efficient bending sequence computation algorithm for a double-head wire bending machine has been devised, whose performance has been assessed on two industrial test cases, demonstrating its effectiveness and usefulness.
Kokoelmat
- Avoin saatavuus [34262]
Ellei muuten mainita, aineiston lisenssi on https://creativecommons.org/licenses/by-nc-nd/4.0/