Computationally efficient algorithms for multiple fault diagnosis in large graph-based systems

Authors:
Fang Tu;K. R. Pattipati;S. Deb;V. N. Malepati
Affiliations:
Dept. of Electr. Eng., Univ. of Connecticut, Storrs, CT, USA;-;-;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Year:
2003

Citing 0
Cited 7

Relaxed maximum a posteriori fault identification

Signal Processing
A qualitative approach to multiple fault isolation in continuous systems

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Dynamic multiple fault diagnosis: mathematical formulations and solution techniques

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special section: Best papers from the 2007 biometrics: Theory, applications, and systems (BTAS 07) conference
Dynamic multiple-fault diagnosis with imperfect tests

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Agent-based error prevention algorithms

Expert Systems with Applications: An International Journal
Conflict and error prevention and detection in complex networks

Automatica (Journal of IFAC)
System-level BIT false alarm reducing technology based on sensor network time stress analysis and the fault propagation correlation model

International Journal of Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph-based systems are models wherein the nodes represent the components and the edges represent the fault propagation between the components. For critical systems, some components are equipped with smart sensors for on-board system health management. When an abnormal situation occurs, alarms will be triggered from these sensors. This paper considers the problem of identifying the set of potential failure sources from the set of ringing alarms in graph-based systems. However, the computational complexity of solving the optimal multiple fault diagnosis (MFD) problem is exponential. Based on Lagrangian relaxation and subgradient optimization, we present a heuristic algorithm to find approximately the most likely candidate fault set. A computationally cheaper heuristic algorithm - primal heuristic - has also been applied to the problem so that real-time MFD in systems with several thousand failure sources becomes feasible in a fraction of a second. This paper also considers systems with asymmetric and multivalued alarms (tests).