Paper Info
Title
Performance analysis of sum-product algorithms for multiple fault diagnosis applications
Abstract
In this paper, we study the application of sum-product algorithms (SPAs) to multiple fault diagnosis (MFD) problems in order to diagnose the most likely state of each component given the status of alarms. SPAs are heuristic algorithms of polynomial complexity that are known to converge to the marginal solutions in settings where the underlying interconnection graph has a tree structure. To determine SPA performance on more general MFD graphs (with cycles), we use properties of the dynamic range measure for SPA beliefs and take advantage of the bipartite nature of MFD graphs. This leads to the establishment of bounds on the true marginal of each component with respect to the beliefs provided by the SPAs. We show via examples and simulations that these bounds are very tight and significantly improve existing results. We also show that fault diagnosis based on SPA beliefs (using them as suboptimal solutions to the marginal problems) can enable the detection of multiple faults with very high accuracy.
Year
DOI
Venue
2010
10.1109/CDC.2010.5718095
CDC
Keywords
Field
DocType
trees (mathematics),sum-product algorithms,interconnection graph,polynomial complexity,computational complexity,bipartite graphs,mfd graphs,fault diagnosis,tree structure,heuristic algorithms,multiple fault diagnosis,performance analysis,force,dynamic range,strontium,heuristic algorithm,silicon
Graph,Mathematical optimization,Heuristic,Computer science,Bipartite graph,Algorithm,Tree structure,Polynomial complexity,Interconnection,Computational complexity theory
Conference
ISSN
ISBN
Citations 
0743-1546
978-1-4244-7745-6
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Tung Le1375.87
Sekhar Tatikonda21068130.91
Christoforos N. Hadjicostis31425127.48