journal article·2025-03-04

Fault diagnosis of helicopter tail-drive system using a multi-grained hierarchical message graph convolutional networks

Junlin Zhou, Zhendong Long, Aijun Yin, Mohammed Alkahtani

Publisher page

Abstract

The fault diagnosis of the tail-drive of helicopter is a crucial task for helicopter system operation and maintenance. Recently, graph convolution network (GCN) has been the focus in fault diagnosis for its powerful representational ability in relationship mining. However, with the difficulty of obtaining node and edge information in the high-order domain, the stable performance of the long-range message-passing process of the deep GCN is unknown limits the application of GCN in fault diagnosis. To address these issues, a multi-grained hierarchical message graph convolutional network (MHGCN) is proposed to diagnose faults of helicopter tail-drive system. First, time-frequency characteristics of the original vibration signals are extracted to construct the graph nodes. The original graph nodes are aggregated by Louvain community detection, which can effectively learn the multi-grained features. Then, the hierarchical graph is introduced to learn the features of high-order neighbourhoods. Finally, a particular message-passing method is used to encode long-range information spanning the graph structure and realise accurate classification. Experiments on a test rig of helicopter tail-drive system are performed to verify the efficacy of the proposed method.
Source: openalex_inverted_index · Quality: baseline

Research context

OpenAlex topics: Evaluation and Optimization Models · Advanced Graph Neural Networks · Complex Network Analysis Techniques

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Chongqing University

China Academy of Engineering Physics

University of Bisha

Funding

National Natural Science Foundation of China

References (27)

Show source-provided references
1. 10.1016/j.engfailanal.2018.04.05110.1016/j.engfailanal.2018.04.051 ↗
2. 10.1016/j.ymssp.2017.07.00910.1016/j.ymssp.2017.07.009 ↗
3. 10.1109/TIM.2019.290151410.1109/TIM.2019.2901514 ↗
4. 10.1016/j.chaos.2021.11081310.1016/j.chaos.2021.110813 ↗
5. 10.1109/TIM.2023.332248810.1109/TIM.2023.3322488 ↗
6. 10.26599/BDMA.2021.902002810.26599/BDMA.2021.9020028 ↗
7. 10.1109/TIM.2022.317848310.1109/TIM.2022.3178483 ↗
8. 10.1016/j.neucom.2019.08.01010.1016/j.neucom.2019.08.010 ↗
9. 10.1016/j.ress.2022.10861810.1016/j.ress.2022.108618 ↗
10. 10.1016/j.engappai.2023.10675610.1016/j.engappai.2023.106756 ↗
11. 10.1109/JSEN.2020.300726210.1109/JSEN.2020.3007262 ↗
12. 10.1109/TIM.2022.320344010.1109/TIM.2022.3203440 ↗
13. 10.1007/s11071-023-08657-710.1007/s11071-023-08657-7 ↗
14. Kipf NT, Welling M. Semi-supervised classification with graph convolutional networks. In Proceedings ICLR. 2017. p. 1–14.
15. 10.1109/TIE.2020.304066910.1109/TIE.2020.3040669 ↗
16. 10.1109/TII.2020.303418910.1109/TII.2020.3034189 ↗
17. 10.1109/TII.2022.316167410.1109/TII.2022.3161674 ↗
18. 10.1016/j.jmsy.2022.08.00710.1016/j.jmsy.2022.08.007 ↗
19. 10.1016/j.neucom.2018.05.08410.1016/j.neucom.2018.05.084 ↗
20. 10.1016/j.aiopen.2021.01.00110.1016/j.aiopen.2021.01.001 ↗
21. 10.1007/s10618-022-00890-910.1007/s10618-022-00890-9 ↗
22. 10.1109/TAES.2014.13038910.1109/TAES.2014.130389 ↗
23. 10.1177/095440622199279810.1177/0954406221992798 ↗
24. 10.1109/TIM.2020.304879910.1109/TIM.2020.3048799 ↗
25. 10.1103/PhysRevE.70.06611110.1103/PhysRevE.70.066111 ↗
26. 10.1016/j.future.2020.07.01110.1016/j.future.2020.07.011 ↗
27. 10.1088/1742-5468/2008/10/P1000810.1088/1742-5468/2008/10/P10008 ↗