Multi-hop graph pooling adversarial network for cross-domain remaining useful life prediction: A distributed federated learning perspective

• Published in: Reliability engineering & system safety 2024-04, Vol.244, p.109950, Article 109950
• Main Authors: Zhang, Jiusi, Tian, Jilun, Yan, Pengfei, Wu, Shimeng, Luo, Hao, Yin, Shen
• Format: Article
• Language: English
• Subjects: Cross-domain; Distributed federated learning; Graph pooling adversarial network; Prediction; Remaining useful life
• ISSN: 0951-8320; 1879-0836
• DOI: 10.1016/j.ress.2024.109950

Accurate remaining useful life (RUL) prediction has gained increasing attention in modern maintenance management. Considering the data privacy requirements of distributed multi-client collaborative training and the phenomenon of domain drift, how to accomplish the RUL prediction for distributed federation under cross-domain conditions needs in-depth research. In this context, the paper constructs a multi-hop graph pooling adversarial network based on distributed federated learning (MHGPAN-DFL) for the RUL prediction. In particular, this paper designs a multi-hop graph pooling adversarial network, which can decrease domain differences through adversarial transfer while achieving global modeling for input data. Furthermore, this paper designs a predictive model consistency strategy based on distributed federated learning. It dynamically assigns model weights to promote the generalization ability based on ensuring the privacy and security of local data in each client. This study confirms the efficacy of the proposed approach adopting the NASA aircraft turbofan engine dataset, and the bearing degradation dataset provided by Xi’an Jiaotong University. •An MHGPN is proposed to mine the hidden non-Euclidean features in degradation data.•An MHGPAN is proposed for cross-domain RUL prediction for different data distribution.•A model consistency strategy with DFL is proposed to assign dynamic model weights.•Research results show the MHGPAN-DFL-based RUL prediction approach is excellent.