Comparison of two distributed fault diagnosis approaches based on Binary Integer Linear Programming (BILP) optimization

Abstract

Two distributed fault diagnosis approaches were compared, by analogy, to determine which is more efficient regarding computational complexity. The first approach considered all “locally computed” global and compound sets with minimal cardinality using a heuristic optimization method while minimizing subsystems interactions (communication). The second approach aimed at obtaining minimal coupled MSOs for minimizing the number of common links between MSOs by adding constraints in already existing optimal sensor placement algorithm, which uses BILP, but not in a distributed context. As a result of comparison, complexity of both approaches is characterized.