Compressive Sensing in Fault Detection

Randomly generated tests are used to identify faulty sensors in large-scale discrete-time linear time-invariant dynamical systems with high probability. It is proved that the number of the required tests for successfully identifying the location of the faulty sensors (with high probability) scales logarithmically with the number of the sensors and quadratically with the maximum number of faulty sensors. It is also proved that the problem of decoding the identity of the faulty sensors based on the random tests can be cast as a linear programming problem and therefore can be solved reliably and efficiently even for large-scale systems. A numerical example based on automated irrigation networks is utilized to demonstrate the results.

[1]  Sidharth Jaggi,et al.  Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms , 2014, IEEE Trans. Inf. Theory.

[2]  George Atia,et al.  Boolean Compressed Sensing and Noisy Group Testing , 2009, IEEE Transactions on Information Theory.

[3]  Petros G. Voulgaris,et al.  On optimal ℓ∞ to ℓ∞ filtering , 1995, Autom..

[4]  Mingyan Liu,et al.  Efficient Sensor Fault Detection Using Combinatorial Group Testing , 2013, 2013 IEEE International Conference on Distributed Computing in Sensor Systems.

[5]  Wei Dai,et al.  Observability of a Linear System Under Sparsity Constraints , 2012, IEEE Transactions on Automatic Control.

[6]  Tyrone L. Vincent,et al.  On the observability of linear systems from random, compressive measurements , 2010, 49th IEEE Conference on Decision and Control (CDC).

[7]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[8]  Arkadii G. D'yachkov,et al.  A survey of superimposed code theory , 1983 .

[9]  R.G. Baraniuk,et al.  Compressive Sensing [Lecture Notes] , 2007, IEEE Signal Processing Magazine.

[10]  Michael Cantoni,et al.  A {0, 1} linear program for fixed-profile load scheduling and demand management in automated irrigation channels , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[11]  Iven M. Y. Mareels,et al.  Control of Large-Scale Irrigation Networks , 2007, Proceedings of the IEEE.

[12]  Donald F. Towsley,et al.  Random Multiple-Access Communication and Group Testing , 1984, IEEE Trans. Commun..

[13]  Giovanni Di Crescenzo,et al.  Combinatorial Group Testing for Corruption Localizing Hashing , 2011, COCOON.

[14]  Michel Verhaegen,et al.  Nonlinear Compressive Particle Filtering , 2013, 52nd IEEE Conference on Decision and Control.

[15]  Yonggang Wen,et al.  Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[16]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

[17]  Farhad Farokhi,et al.  Scheduling rigid demands on continuous-time linear shift-invariant systems , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[18]  Dmitry M. Malioutov,et al.  Boolean compressed sensing: LP relaxation for group testing , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[19]  Ding-Zhu Du,et al.  A survey on combinatorial group testing algorithms with applications to DNA Library Screening , 1999, Discrete Mathematical Problems with Medical Applications.

[20]  R. Dorfman.  The Detection of Defective Members of Large Populations , 1943 .