No 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, can be a difficult and time consuming task for complex workpieces, even for an expert operator. The introduction of algorithms for the computation of wire bending sequences is thus crucial to increase productivity and production flexibility, and to decrease production costs. To this aim, this work proposes an algorithm to automatically determine an appropriate bending sequence for a given workpiece, bending tool, and machine 3D CAD model, that 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 can be 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. Finally, the effectiveness of this algorithm is assessed on two different test cases, relevant to industrial workpieces.