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.
Skip Nav Destination
e-mail: roshan@kingkong.me.berkeley.edu
e-mail: pwright@robocop.me.berkeley.edu
Article navigation
December 2002
Technical Papers
Handling Tool Holder Collision in Optimal Tool Sequence Selection for 2.5-D Pocket Machining
Roshan M. D’Souza,
e-mail: roshan@kingkong.me.berkeley.edu
Roshan M. D’Souza
Berkeley Manufacturing Institute, University of California, Berkeley, CA 94720
Search for other works by this author on:
Paul K. Wright,
e-mail: pwright@robocop.me.berkeley.edu
Paul K. Wright
Berkeley Manufacturing Institute, University of California, Berkeley, CA 94720
Search for other works by this author on:
Carlo Se´quin
Carlo Se´quin
Department of EECS, Computer Science Division, University of California, Berkeley, CA 94720
Search for other works by this author on:
Roshan M. D’Souza
Berkeley Manufacturing Institute, University of California, Berkeley, CA 94720
e-mail: roshan@kingkong.me.berkeley.edu
Paul K. Wright
Berkeley Manufacturing Institute, University of California, Berkeley, CA 94720
e-mail: pwright@robocop.me.berkeley.edu
Carlo Se´quin
Department of EECS, Computer Science Division, University of California, Berkeley, CA 94720
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.
J. Comput. Inf. Sci. Eng. Dec 2002, 2(4): 345-349 (5 pages)
Published Online: March 26, 2003
Article history
Received:
July 1, 2002
Revised:
January 1, 2003
Online:
March 26, 2003
Citation
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:
Get Email Alerts
Cited By
Deep Learning-Based Residual Useful Lifetime Prediction for Assets with Uncertain Failure Modes
J. Comput. Inf. Sci. Eng
Deep Reinforcement Learning Based Localization and Tracking of Intruder Drone
J. Comput. Inf. Sci. Eng (March 2025)
MODAL-DRN-BL: A Framework for Modal Analysis Based on Dilated Residual Broad Learning Networks
J. Comput. Inf. Sci. Eng (March 2025)
Related Articles
Integrated Process Planning for a Multiaxis Hybrid Manufacturing System
J. Manuf. Sci. Eng (April,2010)
Adaptive Process Planning for Additive/Subtractive Hybrid Manufacturing of Overhang Features
J. Manuf. Sci. Eng (February,2023)
Optimal Tool Orientation for Five-Axis Tool-End Machining by Swept Envelope Approach
J. Manuf. Sci. Eng (November,2005)
Tool Path Generation Using C-Space for 5-Axis Control Machining
J. Manuf. Sci. Eng (February,1999)
Related Proceedings Papers
Related Chapters
On the Effects of ADS Along-Track Position Estimation Errors on Longitudinal Collision Risk (PSAM-0342)
Proceedings of the Eighth International Conference on Probabilistic Safety Assessment & Management (PSAM)
New Approach for Rate Adaptation Mechanism for the IEEE 802.11 MAC Layer
International Conference on Computer Engineering and Technology, 3rd (ICCET 2011)
An Efficient Connection Table in High-Speed Networks
International Symposium on Information Engineering and Electronic Commerce, 3rd (IEEC 2011)