Paper
16 July 2002 Multiple fault diagnosis in graph-based systems
Fang Tu, Krishna R. Pattipati, Somnath Deb, Venkatesh Narayana Malepati
Author Affiliations +
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 problem is super-exponential. Based on Lagrangian relaxation and subgradient optimization, we present a heuristic algorithm to find the most likely candidate fault set. A computationally cheaper heuristic algorithm - primal heuristic - has also been applied to the problem so that real-time multiple fault diagnosis in systems with several thousand failure sources becomes feasible in a fraction of a second.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Fang Tu, Krishna R. Pattipati, Somnath Deb, and Venkatesh Narayana Malepati "Multiple fault diagnosis in graph-based systems", Proc. SPIE 4733, Component and Systems Diagnostics, Prognostics, and Health Management II, (16 July 2002); https://doi.org/10.1117/12.475506
Lens.org Logo
CITATIONS
Cited by 10 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Systems modeling

Failure analysis

Computing systems

Diagnostics

Control systems

Chemical elements

Surface plasmons

RELATED CONTENT


Back to Top