Login | Register

A New Approach to CNC Programming of Plunge Milling


A New Approach to CNC Programming of Plunge Milling

Abdelkhalek, Sherif Mahmoud Mohamed (2013) A New Approach to CNC Programming of Plunge Milling. PhD thesis, Concordia University.

Text (application/pdf)
Abdelkhalek_PhD_F2013.pdf - Accepted Version


A New Approach to CNC Programming of Plunge Milling
Sherif Abdelkhalek, PhD.
Concordia University, 2013.
In current industrial applications many engineering parts are made of hard materials including dies, mold cavities and aerospace parts. Manufacturing these types of parts is classified as pocket milling. By using the regular machining methods, pocket milling takes a long time accompanied by high cost. Plunge milling, is a new machining strategy that has proven to have an excellent performance in the rough machining of hard materials. In plunge milling, the cutter is fed in the direction of the spindle axis, with the highest structural rigidity which showed a very interesting performance in removing the excess material rapidly in the rough operations. Mainly, according to the previous researchers, two directions are adopted to improve the efficiency of the plunge milling process. First, to reduce the cutting forces and increase chatter stability which attracts the majority of the researchers. Second, to optimize the tool path planning which has less attention.
Therefore, in the first part of the research, a new practical approach is established in optimized procedures to generate the tool paths for plunge milling of pockets, even for these with free-form boundaries and islands. This innovative approach is proposed as follows: (1) fill a pocket with minimum number of specified radii circles which are tangent to each other and/or the pocket boundary without overlapping by building an algorithm using the maximum hole degree (MHD) theory for solving the circle packing problem. (2) cover the areas left between the non-overlapped circles by the same used specified radii. Finally, solve the travelling sales man problem (TSP) for the circles with the same radii by using the simulated annealing algorithm. According to the results, this approach significantly advances the tool path planning technique for pockets plunge milling.
In the second part of the research, a new algorithm is proposed to calculate the global solution for constraint polynomial functions by using subtractive clustering which makes the results more accurate and faster to be obtained. This part is extremely useful to calculate the depth of cut for each plunging place in case of having a polynomial surface as a bottom of the machined pocket with high accuracy, and less calculation time to avoid gauging between the tool and the bottom surface.
The polynomial function can be classified according to the number of variables. In the proposed research, the functions with one and two variables have more importance because they graphically represent curves and surfaces which are the cases under study. Since the polynomial function under study can be represented graphically according to the number of the variables, the change in the function’s shape can be detected by the feature recognition. The feature recognition is done for the function’s shape by calculating the surface or curve curvature at the data points. The main procedure is; (1) identifying the entire features of the objective function which are classified according to the curvature as convex, concave, plane, and hyperbolic, (2) applying the sub-clustering technique for convex and concave regions to find the approximated centers of these regions, and eventually, (3) the clusters’ centers are calculated and used as initial points for local optimization technique which gives the local critical point for each region. The local minima are calculated, the global minimum is the minimum of the local minima.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Mechanical and Industrial Engineering
Item Type:Thesis (PhD)
Authors:Abdelkhalek, Sherif Mahmoud Mohamed
Institution:Concordia University
Degree Name:Ph. D.
Program:Mechanical Engineering
Date:12 September 2013
Thesis Supervisor(s):Chen, Zezhong Chevy
Keywords:Plunge Milling
ID Code:977753
Deposited On:13 Jan 2014 16:17
Last Modified:18 Jan 2018 17:45


1. Li, Y., Liang, S., Petrof, R., and Seth, B., 2000, “Force modeling for cylindrical plunge cutting,” The International Journal of Advanced Manufacturing Technology, Vol. 16, pp. 863 - 870.
2. Wakaokaa, S., Yamane, Y., Sekiya, K., and Narutaki, N., 2002, “High-speed and high-accuracy plunge cutting for vertical walls,” Journal of Materials Processing Technology, Vol. 127, pp. 246 - 250.
3. Ko, J., and Altintas, Y., 2007, “Time domain model of plunge milling operation,” International Journal of Machine Tools and Manufacture, Vol. 47, pp. 1351 - 1361.
4. Damir, A., Ng, E., and Elbestawi, M., 2011, “Forces prediction and stability analysis of plunge milling of systems with rigid and flexible workpiece,” International Journal of Manufacturing Technology, Vol. 54, pp. 853 - 877.
5. Al-Ahmad, M., Acunto, A., and Martin, P., 2007, “Identification of plunge milling parameters to compare with conventional milling,” Advances in Integrated Design and Manufacturing in Mechanical Engineering, Vol. 2, pp. 461 - 474.
6. Ren, J., Yao, C., Zhang, D., Xue, Y., and Liang, Y., 2009, “Research on tool path planning method of four-axis high-efficiency slot plunge milling for open blisk,” International Journal of Manufacturing Technology, Vol. 45, pp. 101 - 109.
7. El-Midany, T., and Elkeran, A., 2006, “Optimal CNC plunger selection and tool point generation for roughing sculptured surfaces cavity,” Journal of Manufacturing Science and Engineering, Vol. 128, pp. 1025 - 1029.
8. Tawfik, H., 2006, “A new algorithm to calculate the optimal inclination angle for filling of plunge milling,” International Journal of CAD/CAM, Vol. 6, pp. 801 - 809.
9. Wenfeng, G., Jianzhong, F., Zhiwei, L., and Yuchun, L., 2010, “Tool-path planning based on iso-scallop for plunge milling in pocket walls manufacture,” Mechanic Automation and Control Engineering (MACE), Vol. 3, pp. 3434 - 3437.
10. George, J., George, J., and Lamar, B., 1995, “Packing different sized circles into a rectangular container,” European Journal of Operational Research, Vol. 84, pp. 693 - 712.
11. Castillo, I., Kampas, F., and Pinter, J., 2008, “Solving circle packing problems by global optimization: Numerical results and industrial applications,” European Journal of Operational Research, Vol. 191, pp. 786 - 802.
12. Huang, W., Li, Y., Li, C., and Xu, R., 2006, “New heuristics for packing unequal circles into a circular container,” Computers and Operations Research, Vol. 33, pp. 2125 - 2142.
13. Huang, W., Li, Y., Akeb, H., and Li, C., 2005, “Greedy algorithms for packing unequal circles into a rectangular container,” Journal of The Operational Research Society, Vol. 56, pp. 539 - 548.
14. Lü, Z., and Huang, W., 2008, “PERM for solving circle packing problem”, Computer and Operation Research, Vol. 35, pp. 1742 - 1755.
15. Kubach, T., Bortfeldt, A., and Gehring, H., 2009, “Parallel greedy algorithms for packing unequal circles into a strip or a rectangle,” Central European Journal of Operation Research (CEJOR), Vol. 17, pp. 461- 477.
16. Akeb, H., Hifi, M., and Hallahd, R., 2009, “A beam search algorithm for the circular packing problem,” Computer and Operation Research, Vol. 36, pp. 1513 - 1528.
17. Akeb, H., Hifi, M., and Negre, S., 2011, “An augmented beam search-based algorithm for the circular open dimension problem”, Computers and Industrial Engineering, Vol. 61, pp. 373 - 381.
18. Visweswaran, and V., Floudas, C., 1992, “Unconstrained and constrained global optimization of polynomial functions in one variable”, Journal of global optimization, Vol. 2, pp. 73 - 99.
19. Lasserre, J., 2001, “Global optimization with polynomial and the problem of moments”, SIAM Journal on optimization, Vol. 11, pp. 796 - 817.
20. Hanzon, B., and Jibetean, D., 2003, “Global minimization of a multivariate polynomial using matrix methods”, Journal of global optimization, Vol. 27, pp. 1-23.
21. Nataraj, P., and Arounassalame, M., 2007, “A new subdivision algorithm for the bernstein polynomial approach to global optimization”, International journal of automation and computing, Vol. 4, pp. 342 - 352.
22. Nataraj, P., and Arounassalame, M., 2011, “Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm”, Journal of global optimization, Vol. 49, pp. 185 - 212.
23. Yager, R., and Filev, D., 1992, “Approximate clustering via the Mountain method”, IEEE transactions on, systems, man, and cybernetic, Vol. 24, pp. 1279 - 1284.
24. Chiu, S., 1994, “Fuzzy model identification based on cluster estimation”, Journal of intelligent and fuzzy systems, Vol. 2, pp. 267 - 278.
25. Bataineh, K., Naji, M., Saqer M., 2011, “A comparison study between various fuzzy clustering algorithms”, Jordan journal of mechanical and industrial engineering, Vol. 5, pp. 335 - 343.
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Back to top Back to top