Abstract
The bending stage is the most complex and critical stage in manufacturing sheet metal products. Moreover, the automatic determination of the bending sequence is essential within the framework of process planning. Basic examination of the problem immediately reveals that the determination of the bending sequence is a combinatorial problem. Furthermore, it is coupled with the problem of selection of the bending tools. In this paper, the problem of automatic tool selection and bending sequence determination is formulated as a graph search problem. Heuristics, reduction techniques and search methods based on the A-star search algorithm were used to accelerate the solution. The results are superior to previously published results.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
