Selecting optimal tools for arbitrarily shaped pockets

Abstract

As a result of slicing a 3D part into 2D pockets for generating tool paths, pockets are becoming more commonly used. When a pocket is machined, the question of which of the many feasible tools for cutting the pocket is best always arises. Will cutting be more efficient if multi-tools are used? Will the algorithm to choose the optimal tools be timesaving enough? This paper presents a method in which an upper bound O(N) is used to choose the optimal cutting tool combination, where N is the number of feasible tools available. The proposed method is quick and sufficient for computer-aided process planning (CAPP) and computer-aided manufacturing (CAM) environments.