Significant cycle time saving can be achieved in 2.5-D milling by intelligently selecting tool sequences. The problem of finding the optimal tool sequence was formulated as finding the shortest path in a single-source single-sink directed acyclic graph. The nodes in the graph represented the state of the stock after the tool named in the node was done machining and the edges represented the cost of machining. In this paper a novel method for handling tool holder collision in the graph-based algorithm for optimal tool sequence selection has been developed. The method consists of iteratively solving the graph for the shortest path, validating the solution by checking for tool holder collisions and eliminating problematic edges in the graph. Also described is a method to reduce the complexity of building the tool sequence graph in case there are tool holder collisions.
Handling Tool Holder Collision in Optimal Tool Sequence Selection for 2.5-D Pocket Machining
Contributed by the Computer Aided Product Development (CAPD) Committee for publication in the JOURNAL OF COMPUTING AND INFORMATION SCIENCE IN ENGINEERING. Manuscript received July 2002; revised manuscript received January 2003. Associate Editor: D. Dutta.
- Views Icon Views
- Share Icon Share
- Cite Icon Cite
- Search Site
D’Souza, R. M., Wright, P. K., and Se´quin, C. (March 26, 2003). "Handling Tool Holder Collision in Optimal Tool Sequence Selection for 2.5-D Pocket Machining ." ASME. J. Comput. Inf. Sci. Eng. December 2002; 2(4): 345–349. https://doi.org/10.1115/1.1559154
Download citation file:
- Ris (Zotero)
- Reference Manager