An intelligent hybrid deep learning model for rolling bearing remaining useful life prediction
Source abstract
Abstract
Remaining Useful Life (RUL) prediction of rolling bearings is one of the intricate and important issues for equipment intelligent maintenance and health management. Various machine learning models and methods have been applied to rolling bearing RUL prediction. However, a single model cannot effectively extract state information and obtain accurate prediction results, and its generalisation is not stable under the condition of small sample data. Therefore this paper proposes an intelligent hybrid deep learning model for achieving accurate RUL prediction of rolling bearings. Firstly, the one-dimensional vibration signal is transformed into the corresponding two-dimensional time-frequency diagram via Continuous Wavelet Transform (CWT). Secondly, the diagram is input into a Multilayer Perceptron (MLP) consisting of a basic three-layer feed-forward network to obtain a one-dimensional feature vector. And lastly, the obtained feature vector is input into an integrated model based on Deep Autoregressive and Transformer to produce the probability distribution and obtain the prediction results of rolling bearing RUL. Extensive experiments on two rolling bearing datasets show that the proposed model outperforms six other comparative models in extracting bearing fault features and predicting bearing RUL, which demonstrates that the proposed model can effectively extract bearing fault features and accurately predict bearing remaining useful life.
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Machine Fault Diagnosis Techniques · Gear and Bearing Dynamics Analysis · Reliability and Maintenance Optimization
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Lanzhou University of Technology
Funding
National Natural Science Foundation of China · Key Program of Natural Science Foundation of Gansu Province
References (41)
Show source-provided references
1. 10.1080/10589759.2023.228351110.1080/10589759.2023.2283511 ↗
2. 10.1109/TIM.2023.325140610.1109/TIM.2023.3251406 ↗
3. 10.1016/j.measurement.2022.11189910.1016/j.measurement.2022.111899 ↗
4. 10.1016/j.ymssp.2022.10896410.1016/j.ymssp.2022.108964 ↗
5. 10.1109/TIM.2021.305950010.1109/TIM.2021.3059500 ↗
6. 10.1016/j.measurement.2023.11260010.1016/j.measurement.2023.112600 ↗
7. 10.1177/1748006X22114744110.1177/1748006X221147441 ↗
8. 10.1080/10589759.2024.232370310.1080/10589759.2024.2323703 ↗
9. 10.1016/j.ress.2022.10898610.1016/j.ress.2022.108986 ↗
10. 10.1080/10589759.2024.232875010.1080/10589759.2024.2328750 ↗
11. 10.1007/s10489-021-02733-410.1007/s10489-021-02733-4 ↗
12. 10.1109/TIM.2020.303111310.1109/TIM.2020.3031113 ↗
13. 10.1016/j.measurement.2021.10968510.1016/j.measurement.2021.109685 ↗
14. 10.37965/jdmd.2023.14810.37965/jdmd.2023.148 ↗
15. 10.1016/j.measurement.2021.11027610.1016/j.measurement.2021.110276 ↗
16. 10.1016/j.ces.2023.11909110.1016/j.ces.2023.119091 ↗
17. 10.1016/j.jmsy.2018.04.00810.1016/j.jmsy.2018.04.008 ↗
18. 10.1016/j.knosys.2021.10679610.1016/j.knosys.2021.106796 ↗
19. 10.1016/j.renene.2019.06.10310.1016/j.renene.2019.06.103 ↗
20. 10.1016/j.ress.2022.10907210.1016/j.ress.2022.109072 ↗
21. 10.3390/s2303114410.3390/s23031144 ↗
22. Vaswani A, Shazeer N, Parmar N, et al. Attention is all you need. In: Proceedings of the 31st Conference on Neural Information Processing Systems (NIPS 2017); 4–9 December 2017; Long Beach, CA, USA. 2017. p. 5998–6008. https://arxiv.org/pdf/1706.03762
23. 10.1016/j.neucom.2022.08.05710.1016/j.neucom.2022.08.057 ↗
24. 10.1016/j.eswa.2022.11812810.1016/j.eswa.2022.118128 ↗
25. 10.1016/j.ijforecast.2019.07.00110.1016/j.ijforecast.2019.07.001 ↗
26. 10.1016/j.ijepes.2022.10864210.1016/j.ijepes.2022.108642 ↗
27. 10.3390/su14231588910.3390/su142315889 ↗
28. 10.1109/TVT.2018.280518910.1109/TVT.2018.2805189 ↗
29. 10.1016/j.neucom.2019.01.05810.1016/j.neucom.2019.01.058 ↗
30. 10.1109/TMECH.2022.321877110.1109/TMECH.2022.3218771 ↗
31. 10.1109/TIM.2022.318193310.1109/TIM.2022.3181933 ↗
32. 10.1016/j.ress.2018.11.01110.1016/j.ress.2018.11.011 ↗
33. 10.1088/1361-6501/ace3e710.1088/1361-6501/ace3e7 ↗
34. 10.1109/I2CT54291.2022.982463310.1109/I2CT54291.2022.9824633 ↗
35. 10.1007/s00542-022-05311-x10.1007/s00542-022-05311-x ↗
36. 10.1088/1361-6501/acf87410.1088/1361-6501/acf874 ↗
37. 10.1007/978-3-030-99075-6_1810.1007/978-3-030-99075-6_18 ↗
38. 10.1186/s10033-021-00570-710.1186/s10033-021-00570-7 ↗
39. 10.1109/TIE.2020.300364910.1109/TIE.2020.3003649 ↗
40. 10.1109/TIM.2019.292450910.1109/TIM.2019.2924509 ↗
41. 10.1016/j.ress.2022.10870110.1016/j.ress.2022.108701 ↗