Geometry-based Bend Feasibility Matrix for bend sequence planning of sheet metal parts

Abstract

ABSTRACTProcess planning for sheet metal bending involves the determination of a near-optimal bend sequence for a given part. The problem is complex since the search space of possible solutions is factorial with respect to the number of bends. In this paper, a two-stage algorithm is described that allows for the quick identification of a near-optimal bend sequence for a given part and set of tools. In the first stage, a Bend Feasibility Matrix is constructed to map the entire search space by taking a geometric approach to the problem. The matrix helps to quickly establish whether the part can be manufactured using the given set of tools. The second stage uses best-first search (graph) algorithm to identify the bend sequence. During search, infeasible sequences are never evaluated and expensive collision tests are not done since the necessary computations are already done in the first stage. Performance of the proposed algorithm is compared with that of genetic algorithm and it is demonstrated that the best-first search algorithm is better than genetic algorithm (GA) to solve the bend sequencing problem.