Share Email Print

Proceedings Paper

Multiple fault diagnosis in graph-based systems
Author(s): Fang Tu; Krishna R. Pattipati; Somnath Deb; Venkatesh Narayana Malepati
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 16 July 2002
PDF: 12 pages
Proc. SPIE 4733, Component and Systems Diagnostics, Prognostics, and Health Management II, (16 July 2002); doi: 10.1117/12.475506
Show Author Affiliations
Fang Tu, Univ. of Connecticut (United States)
Krishna R. Pattipati, Univ. of Connecticut (United States)
Somnath Deb, Qualtech Systems Inc. (United States)
Venkatesh Narayana Malepati, Qualtech Systems Inc. (United States)

Published in SPIE Proceedings Vol. 4733:
Component and Systems Diagnostics, Prognostics, and Health Management II
Peter K. Willett; Thiagalingam Kirubarajan, Editor(s)

© SPIE. Terms of Use
Back to Top