Abstract
Rolling bearings are one of the most important and indispensable components of a mechanical system, and an accurate prediction of their remaining life is essential to ensuring the reliable operation of a mechanical system. In order to effectively utilize the large amount of data collected simultaneously by multiple sensors during equipment monitoring and to solve the problem that global feature information cannot be fully extracted during the feature extraction process, this research presents a technique for forecasting the remaining lifespan of rolling bearings by integrating many features. Firstly, a parallel multi-branch feature learning network is constructed using TCN, LSTM, and Transformer, and a parallel multi-scale attention mechanism is designed to capture both local and global dependencies, enabling adaptive weighted fusing of output features from the three feature extractors. Secondly, the shallow features obtained by the parallel feature extractor are residually connected with the deep features through the attention mechanism to improve the efficiency of utilizing the information of the front and back features. Ultimately, the combined characteristics produce the forecasted findings for the RUL of the bearing using the fully connected layer, and RUL prediction studies were performed with the PHM 2012 bearing dataset and the XJTU-SY bearing accelerated life test dataset, and the experimental results demonstrate that the suggested method can effectively forecast the RUL of various types of bearings with reduced prediction errors.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.