Submitted:
05 August 2024
Posted:
08 August 2024
You are already at the latest version
Abstract
Keywords:
1. Introduction
- a.
- Introduced an agent-based CNC system architecture, leveraging artificial intelligence technology to enhance the performance and efficiency of CNC systems.
- b.
- Proposed a deep neural network integrating multiple neural network models and linear attention mechanisms for improved feature recognition efficiency.
- c.
-
Employed four mechanisms to improve the COA in order to enhance the smoothness:
- Used the honey badger algorithm to initialize the coati population, enhancing the initial population quality and optimization efficiency.
- Embedded information such as population size, iteration count, and fitness function into the improved path update rules, allowing the new rules to optimize the search process based on the current population status, improving convergence speed.
- Introduced a dynamic multi-population strategy to comprehensively explore the search space and maintain population diversity.
- Proposed a gradient descent fitness-guided strategy to dynamically adjust the learning rate, controlling the magnitude of each path point update for quicker convergence to the optimal solution.
2. Related Work
2.1. Feature Recognition in CNC Machining Based on Deep Learning
2.2. CNC Machining Path Optimization
3. Agent-Based CNC System Architecture
3.1. Intelligent Requirements
3.2. System Model and Structure
- CAD/CAM: The process of design and manufacturing using computer software. This is the input part of the intelligent system, providing design data and manufacturing instructions.
- Learning: Extracting useful information from data to optimize models and manufacturing processes.
- Digital Twin: Providing a virtual environment for testing and optimization, enhancing efficiency and precision.
- Sense: Monitoring various parameters during the manufacturing process, providing real-time feedback to the digital twin and optimization modules.
- Optimization: The process of optimizing system performance based on learning and sensing data, reducing resource consumption, and refining manufacturing processes.
- NC System and Machine Tool: Receiving instructions from the optimization module and performing machining and manufacturing according to CNC system directives.
3.3. Assembly Line Work Mode
4. Mathematical Model
4.1. Machining Path Feature Design
- is the dot product of vectors and .
- and are the Euclidean lengths of vectors and respectively.
| Algorithm 1 |
| Require: A: A set of points {a1, a2,…, an}, where ai = (xi, yi); |
| Ensure: LabelPath: A path with a feature label; |
| The point set A is grouped into groups of 50 points and stored in the Group list: [g1, g2, …, gn], where gi = [p1, p2, …, p50], pi = (xi, yi); |
| for each group g in Group do |
| for each point p in g do |
| Generate initial set of vectors Vi: {v1, v2, …, v9}, where vi = (xi+1 − xi, yi+1 − yi); |
| Compute the local curvature of Vi: ; |
| if LocalCurvature ≤ 1.9 then |
| Label Vi as "Category 1"; |
| else if 1.9 < LocalCurvature < 3.5 then |
| Label Vi as "Category 2"; |
| else if 3.5 < LocalCurvature < 7.6 then |
| Label Vi as "Category 3"; |
| else |
| Label Vi as "Category 4"; |
| end if |
| end for |
| end for |
| LabelPath = {all labeled path from steps 17 and 18}; |
| LabelPath was used to train the MCRL model; |
| return LabelPath |
4.2. Path Optimization Design
4.2.1. Honey Badger Algorithm for Population Initialization
a. Initialization phase
i. Generate initial honey badger population
- A two-dimensional point set path = represents a set of points on the path, where .
- Set the start and end points: , .
- Randomly insert points: Randomly select the remaining points and randomly insert them into a certain position on the path until all points are inserted.
ii. Initialize each individual in the population
- , where are random permutations of , and the population size is .
b. Defining intensity
- is a random number, uniformly distributed in (0,1).
- S is the intensity.
- is the i-th point of individual k.
- is the i-th point of the global best position.
- represents the distance between the global best position and the current point.
c. Simulation of honey badger foraging behavior
- is a constant.
- is a constant indicating the honey badger’s ability to obtain food.
- represents the updated position.
- are random numbers between 0 and 1.
d. Fitness function
i. Curvature calculation
ii. Smoothness penalty
iii. Fitness function
e. Updating the honey badger population
f. Initialization of COA population
4.2.2. Enhanced Path Update Rule
- is the initial maximum value of .
- is the minimum value of .
- g is the current iteration number, incrementing from 1 to G.
- G is the total number of iterations in the algorithm.
4.2.3. Dynamic Multi-Population Strategy
a. Multi-Population Initialization
b. Updating Sub-Population Size
- : Minimum sub-population size
- : Maximum sub-population size
c. Selection of the Optimal Individual
d. Individual Exchange Strategy
4.2.4. Gradient Descent-Based Adaptive Guidance Strategy
a. Fitness Function
b. Gradient Calculation
i. Gradient of the Curvature
ii. Gradient of the Smoothness Penalty
c. Gradient Descent
- : Initial learning rate
- : Decay rate
- g: Current iteration number
| Algorithm 2 | |
| 1: | Initialize various algorithm parameters, including a1, β, M0, Mmin, Mmax, G; |
| 2: | Initialize HBA path list; |
| 3: | for k from 1 to n do increasing n by 1 each time do |
| 4: | path_current = path; |
| 5: | Delete the first and last element of the path_current list; |
| 6: | for i from 2 to n − 1 do increasing t by 1 each time do |
| 7: | t ← randomly generate, and the range of t is between [1, n − i]; |
| 8: | pk[i] = path_current[t], and pk is a member of populations; |
| 9: | Delete path_current[t]; |
| 10: | Update the points in the path according to Eq. (5); |
| 11: | end for |
| 12: | Calculate the fitness function according to Eq. (6), Eq. (7), Eq. (8), Eq. (9), Eq. (10); |
| 13: | Find the current optimal path according to Eq. (11); |
| 14: | end for |
| 15: | Initialize NACO path list = HBA path list, Mg = M0, , t = 0, η0; |
| 16: | for g from 1 to G do increasing G by 1 each time do |
| 17: | The number of subpopulations Mg was updated according to Eq. (16); |
| 18: | population.clear(); |
| 19: | for a from 1 to Mg do increasing Mg by 1 each time do |
| 20: | sub_popa.clear(); |
| 21: | for k from 1 to Ng do increasing Ng by 1 each time do |
| 22: | t = t + 1; |
| 23: | sub_popa[k] = pt; |
| 24: | pk = sub_popa[k]; |
| 25: | for i from 1 to 50 do increasing 50 by 1 each time do |
| 26: | Update the path according to Eq. (12), Eq. (13), Eq. (14); |
| 27: | Gradient descent strategy is adopted to update the path according to Eq. (25); |
| 28: | end for |
| 29: | end for |
| 30: | Calculate the fitness function according to Eq. (6), Eq. (7), Eq. (8), Eq. (9), Eq. (10); |
| 31: | Individual pbesta with the least fitness is found in sub_popa according to Eq. (17); |
| 32: | population.append(sub_popa); |
| 33: | end for |
| 34: | if g%T == 0 then |
| 35: | Exchange two random individuals of two random sub_pop according to Eq. (19); |
| 36: | end if |
| 37: | The global optimal individual gbest is found according to Eq. (18); |
| 38: | end for |
| 39: | Output the final optimal path. |
5. Experiments
5.1. Network Experiments and Results
5.1.1. Network Architecture
5.1.2. Experimental Results
- MLP: Figure 7(c) shows that the training and testing accuracies are not smooth, with training accuracy around 90.74% and testing accuracy about 90.09%. Figure 7(d) indicates a considerable difference between training and validation error rates, with training error close to 24.01% and validation error about 28.92%.
- CNN: In Figure 7(e), the training and testing accuracies are somewhat close, with training accuracy around 93.21% and testing accuracy about 92.76%. Figure 7(f) demonstrates that the training and validation error rates are also somewhat close, with training error near 12.79% and validation error around 14.86%.
- RNN: In Figure 7(g), the training and testing accuracies differ slightly, with training accuracy near 93.37% and testing accuracy around 92.34%. Figure 7(h) shows a considerable difference between training and validation error rates, with training error near 17.61% and validation error about 22.67%.
5.2. Optimization Experiments and Results
6. Conclusions
Author Contributions
Funding
Institutional Review Board Statement
Informed Consent Statement
Data Availability Statement
Acknowledgments
Conflicts of Interest
References
- Du, S. Analysis of the application of intelligent CNC technology in machinery manufacturing. Journal of Physics: Conference Series. IOP Publishing, 2023, Vol. 2649, p. 012010.
- Soori, M.; Arezoo, B.; Dastres, R. Machine learning and artificial intelligence in CNC machine tools, a review. Sustainable Manufacturing and Service Economics 2023, 2, 100009. [Google Scholar] [CrossRef]
- Molina, L.M.; Teti, R.; Alvir, E.M.R. Quality, efficiency and sustainability improvement in machining processes using artificial intelligence. Procedia CIRP 2023, 118, 501–506. [Google Scholar] [CrossRef]
- Ning, F.; Shi, Y.; Cai, M.; Xu, W. Part machining feature recognition based on a deep learning method. Journal of Intelligent Manufacturing 2023, 34, 809–821. [Google Scholar] [CrossRef]
- Yao, X.; Wang, D.; Yu, T.; Luan, C.; Fu, J. A machining feature recognition approach based on hierarchical neural network for multi-feature point cloud models. Journal of Intelligent Manufacturing 2023, 34, 2599–2610. [Google Scholar] [CrossRef]
- Guangwen, Y.; ZHANG, D.; Jinting, X.; Yuwen, S. Corner smoothing for CNC machining of linear tool path: A review. Journal of Advanced Manufacturing Science and Technology 2023, 3, 2023001–2023001. [Google Scholar]
- Zhang, H.; Wu, Y.; Shen, Z.; Zhang, P.; Li, H.; Lou, F. Five-axis path smoothing based on sliding convolution windows for CNC machining. CIRP Journal of Manufacturing Science and Technology 2024, 49, 80–94. [Google Scholar] [CrossRef]
- Shen, Z.; Wu, Y.; Guo, P.; Zhang, H.; Zhang, P.; Li, H.; Lou, F. Convolution synchronous smoothing for tool position and posture of continuous line-segment path in 5-axis machining. Journal of Manufacturing Processes 2024, 112, 136–149. [Google Scholar] [CrossRef]
- Zhang, H.; Wu, Y.; Shen, Z.; Zhang, P.; Li, H.; Lou, F.; Guo, P. Mixed tiny path smoothing method based on sliding convolution windows for CNC machining. Journal of Manufacturing Processes 2023, 102, 685–699. [Google Scholar] [CrossRef]
- Zhang, S.; Guan, Z.; Jiang, H.; Wang, X.; Tan, P. BrepMFR: Enhancing machining feature recognition in B-rep models through deep learning and domain adaptation. Computer Aided Geometric Design 2024, 111, 102318. [Google Scholar] [CrossRef]
- Wang, P.; Yang, W.A.; You, Y. A hybrid learning framework for manufacturing feature recognition using graph neural networks. Journal of Manufacturing Processes 2023, 85, 387–404. [Google Scholar] [CrossRef]
- Wu, H.; Lei, R.; Huang, P.; Peng, Y. A semi-supervised learning framework for machining feature recognition on small labeled sample. Applied Sciences 2023, 13, 3181. [Google Scholar] [CrossRef]
- Fang, J.; Li, B.; Zhang, H.; Ye, P. Real-time smooth trajectory generation for 3-axis blending tool-paths based on FIR filtering. The International Journal of Advanced Manufacturing Technology 2023, 126, 3401–3416. [Google Scholar] [CrossRef]
- Kučera, D.; Linkeová, I.; Stejskal, M. The influence of CAD model continuity on accuracy and productivity of CNC machining. The International Journal of Advanced Manufacturing Technology 2023, 124, 1115–1128. [Google Scholar] [CrossRef]
- Hua, L.; Huang, N.; Yi, B.; Zhao, Y.; Zhu, L. Global toolpath smoothing for CNC machining based on B-spline approximation with tool tip position adjustment. The International Journal of Advanced Manufacturing Technology 2023, 125, 3651–3665. [Google Scholar] [CrossRef]
- Zhang, L.; Lu, J.; Ou, C.; Ma, J.; Liao, X. Smoothing and compressing algorithm of toolpath with complex contour in NC machining. The International Journal of Advanced Manufacturing Technology 2023, 125, 4841–4854. [Google Scholar] [CrossRef]
- Feng, K.; Ji, J.; Ni, Q. A novel gear fatigue monitoring indicator and its application to remaining useful life prediction for spur gear in intelligent manufacturing systems. International Journal of Fatigue 2023, 168, 107459. [Google Scholar] [CrossRef]
- Yao, Y.; Liu, M.; Du, J.; Zhou, L. Design of a machine tool control system for function reconfiguration and reuse in network environment. Robotics and computer-integrated manufacturing 2019, 56, 117–126. [Google Scholar] [CrossRef]
- Wu, S.F.; Lee, C.H.; Tseng, B.R. Intelligent Servo Tuning of High-Speed Machine Tools Using Circular Test. IEEE Sensors Journal 2023, 23, 12084–12092. [Google Scholar] [CrossRef]
- Böttjer, T.; Tola, D.; Kakavandi, F.; Wewer, C.R.; Ramanujan, D.; Gomes, C.; Larsen, P.G.; Iosifidis, A. A review of unit level digital twin applications in the manufacturing industry. CIRP Journal of Manufacturing Science and Technology 2023, 45, 162–189. [Google Scholar] [CrossRef]
- Wang, P.; Yang, W.A.; You, Y. A hybrid learning framework for manufacturing feature recognition using graph neural networks. Journal of Manufacturing Processes 2023, 85, 387–404. [Google Scholar] [CrossRef]
- Liu, Z.; Lang, Z.Q.; Gui, Y.; Zhu, Y.P.; Laalej, H. Digital twin-based anomaly detection for real-time tool condition monitoring in machining. Journal of Manufacturing Systems 2024, 75, 163–173. [Google Scholar] [CrossRef]
- Iliyas Ahmad, M.; Yusof, Y.; Mustapa, M.S.; Daud, M.E.; Latif, K.; Kadir, A.Z.A.; Saif, Y.; Adam, A.; Hatem, N. A novel integration between service-oriented IoT-based monitoring with open architecture of CNC system monitoring. The International Journal of Advanced Manufacturing Technology 2024, 131, 5625–5636. [Google Scholar] [CrossRef]
- Liu, C.; Zheng, P.; Xu, X. Digitalisation and servitisation of machine tools in the era of Industry 4.0: a review. International journal of production research 2023, 61, 4069–4101. [Google Scholar] [CrossRef]
- Dehghani, M.; Montazeri, Z.; Trojovská, E.; Trojovskỳ, P. Coati Optimization Algorithm: A new bio-inspired metaheuristic algorithm for solving optimization problems. Knowledge-Based Systems 2023, 259, 110011. [Google Scholar] [CrossRef]
- Hashim, F.A.; Houssein, E.H.; Hussain, K.; Mabrouk, M.S.; Al-Atabany, W. Honey Badger Algorithm: New metaheuristic algorithm for solving optimization problems. Mathematics and Computers in Simulation 2022, 192, 84–110. [Google Scholar] [CrossRef]








| LocalCurvature | Description | Category | Evaluation |
|---|---|---|---|
| Smooth | Category 1 | Good | |
| Slightly Rough | Category 2 | Moderate | |
| Rugged | Category 3 | Poor | |
| Sharp Turning Corner | Category 4 | Very Poor |
| Network Models | Accuracy | Loss | Precision | Recall | AUC |
|---|---|---|---|---|---|
| MCRL | 95.56 | 12.44 | 94.9 | 94.14 | 98.17 |
| MLP | 90.09 | 28.92 | 87.72 | 87.3 | 95.55 |
| CNN | 92.76 | 14.86 | 93.6 | 89.61 | 93.61 |
| RNN | 92.34 | 22.67 | 93.23 | 87.56 | 96.02 |
| LSTM | 94.32 | 15.98 | 92.94 | 91.34 | 94.88 |
| Category 1 | Category 1 | Category 1 | Category 1 | |
|---|---|---|---|---|
| MCRL | ![]() |
![]() |
![]() |
![]() |
| MLP | ![]() |
![]() |
![]() |
![]() |
| CNN | ![]() |
![]() |
![]() |
![]() |
| RNN | ![]() |
![]() |
![]() |
![]() |
| LSTM | ![]() |
![]() |
![]() |
![]() |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).



















