Abstract
Sequential fault diagnosis is a kind of important fault diagnosis method for large scale complex systems, and generating an excellent fault diagnosis strategy is critical to ensuring the performance of sequential diagnosis. However, with the system complexity increasing, the complexity of fault diagnosis tree increases sharply, which makes it extremely difficult to generate an optimal diagnosis strategy. Especially, because the existing methods need massive redundancy iteration and repeated calculation for the state parameters of nodes, the resulting diagnosis strategy is often inefficient. To address this issue, a novel fast sequential fault diagnosis method is proposed. In this method, we present a new bottom-up search idea based on Karnaugh map, SVM and simulated annealing algorithm. It combines failure sources to generate states and a Karnaugh map is used to judge the logic of every state. Eigenvalues of SVM are obtained quickly through the simulated annealing algorithm, then SVM is used to eliminate the less useful state. At the same time, the bottom-up method and cost heuristic algorithms are combined to generate the optimal decision tree. The experiments show that the calculation time of the method is shorter than the time of previous algorithms, and a smaller test cost can be obtained when the number of samples is sufficient.
Highlights
Fault diagnosis is a crucial activity for systems with high safety and mission criticality requirements [1], such as spacecraft [2], military helicopters [3], and aircraft satellites [4]
Based on the above literature research, this paper proposes a new bottom-up/top-down hybrid strategy-based fast sequential fault diagnosis method
The algorithm is combined with the cost heuristic search algorithm, which is suitable for the situation that the number of test points is less than the number of faults
Summary
Fault diagnosis is a crucial activity for systems with high safety and mission criticality requirements [1], such as spacecraft [2], military helicopters [3], and aircraft satellites [4]. Reference [20] developed iterative algorithm called GLP(tau)S that uses genetic algorithms, LP tau low-discrepancy sequences of points and heuristic rules to find regions of attraction when searching a global minimum of an objective function Another kind of method is bottom-up search strategy, that is, the fault tree is constructed from bottom to top [21]. The algorithm is combined with the cost heuristic search algorithm, which is suitable for the situation that the number of test points is less than the number of faults This method makes the decision tree switch the algorithm according to the situation of nodes in the generation process, so as to improve the computational efficiency.
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.