Probabilistic Performance Analysis of Fault Diagnosis Schemes

More documents

Recommendations

Info

[26] R. K. Douglas and J. L. Speyer, Robust fault detection filter design, Journal of Guidance, Control, and Dynamics, 19 (1996), pp. 214–218. [27] G. Dullerud and R. Smith, A nonlinear functional approach to LFT model validation, Systems & Control Letters, 47 (2002), pp. 1–11. [28] G. E. Dullerud and F. Paganini, A Course in Robust Control Theory: A Convex Approach, Springer, New York, 2000. [29] J. Edmonds, Paths, trees, and flowers, Canadian Journal of Mathematics, 17 (1965), pp. 449–467. [30] D. C. Edwards, C. E. Metz, and M. A. Kupinski, Ideal observers and optimal ROC hypersurfaces in N-class classification., IEEE Transactions on Medical Imaging, 23 (2004), pp. 891–895. [31] J. P. Egan, Signal Detection Theory and ROC Analysis, Academic Press, New York, 1975. [32] A. Emami-Naeini, M. M. Akhter, and S. M. Rock, Effect of model uncertainty on failure detection: The threshold selector, IEEE Transactions on Automatic Control, 33 (1988), pp. 1106–1115. [33] R. Everson and J. Fieldsend, Multi-class ROC analysis from a multi-objective optimisation perspective, Pattern Recognition Letters, 27 (2006), pp. 918–927. [34] T. Fawcett, An introduction to ROC analysis, Pattern Recognition Letters, 27 (2006), pp. 861–874. [35] I. P. Fedčina, A criterion for the solvability of the Nevanlinna–Pick interpolation problem, Matematicheskie Issledovaniya, 7 (1972), pp. 213–227. [36] C. Ferri, J. Hernández-Orallo, and M. A. Salido, Volume under the ROC Surface for multi-class problems, in Machine Learning: ECML 2003. Proceedings of the 14th European Conference on Machine Learning, Cavtat-Dubrovnik, Sept. 2003, pp. 108– 120. [37] A. Genz, Numerical computation of rectangular bivariate and trivariate normal and t probabilities, Statistics and Computing, 14 (2004), pp. 251–260. [38] A. Genz and F. Bretz, Computation of Multivariate Normal and t Probabilities, Springer-Verlag, Berlin, 2009. [39] J. Gertler and Q. Luo, Robust isolable models for failure diagnosis, AIChE Journal, 35 (1989), pp. 1856–1868. 121
[40] R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, Addison–Wesley, Reading, MA, 2nd ed., 1994. [41] M. S. Hamada, A. G. Wilson, C. S. Reese, and H. F. Martz, Bayesian Reliability, Springer, New York, 2008. [42] F. Hamelin and D. Sauter, Robust fault detection in uncertain dynamic systems, Automatica, 36 (2000), pp. 1747–1754. [43] D. J. Hand and R. J. Till, A simple generalisation of the area under the ROC curve for multiple class classification problems, Machine Learning, 45 (2001), pp. 171–186. [44] S. Hansen, M. Blanke, and J. Adrian, Diagnosis of UAV pitot tube failure using statistical change detection, in Proceedings of the 7th IFAC Symposium on Intelligent Autonomous Vehicles, Lecce, Italy, Sept. 2010. [45] X. He and E. C. Frey, The meaning and use of the volume under a three-class ROC surface (VUS), IEEE Transactions on Medical Imaging, 27 (2008), pp. 577–588. [46] R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, New York, 1985. [47] R. Isermann, Process fault detection based on modeling and estimation methods— A survey, Automatica, 20 (1984), pp. 387–404. [48] , Fault-Diagnosis Systems: An Introduction from Fault Detection to Fault Tolerance, Springer-Verlag, Berlin, 2006. [49] R. Isermann and P. Ballé, Trends in the application of model-based fault detection and diagnosis of technical processes, Control Engineering Practice, 5 (1997), pp. 709–719. [50] A. H. Jazwinski, Stochastic Processes and Filtering Theory, Academic Press, New York, 1970. [51] T. Kailath, A. H. Sayed, and B. Hassibi, Linear Estimation, Prentice Hall, Upper Saddle River, NJ, 2000. [52] R. E. Kálmán, A new approach to linear filtering and prediction problems, Transactions of the ASME, Series D: Journal of Basic Engineering, 82 (1960), pp. 35–45. [53] R. E. Kálmán and R. S. Bucy, New results in linear filtering and prediction theory, Transactions of the ASME, Series D: Journal of Basic Engineering, 83 (1961), pp. 95– 107. 122
Page 1 and 2:
Probabilistic Performance Analysis
Page 3 and 4:
Abstract Probabilistic Performance
Page 5 and 6:
Soli Deo gloria. i
Page 7 and 8:
3 Probabilistic Performance Analysi
Page 9 and 10:
List of Figures 2.1 “Bathtub” s
Page 11 and 12:
List of Tables 4.1 Time-complexity
Page 13 and 14:
Acknowledgements When I started wri
Page 15 and 16:
tic metrics that rigorously quantif
Page 17 and 18:
tion. • Complexity of Markov Chai
Page 19 and 20:
Given an event B ∈ F with P(B) >
Page 21 and 22:
Note that E ( f (x) | y ) is a rand
Page 23 and 24:
for all c ∈ R, where erf(c) := 2
Page 25 and 26:
Hazard Rate λ 0 0 break-in 0 t 1 t
Page 27 and 28:
malfunction — an intermittent irr
Page 29 and 30:
where the matrix Q is chosen to app
Page 31 and 32:
v w u G θ y F r δ V d Figure 2.3.
Page 33 and 34:
These relationships can be used to
Page 35 and 36:
ε Residual 0 0 T f T d Time Figure
Page 37 and 38:
Chapter 3 Probabilistic Performance
Page 39 and 40:
the worst-case performance under a
Page 41 and 42:
For example, P tp,k = P(D 1,k ∩ H
Page 43 and 44:
where the subscript k has been omit
Page 45 and 46:
1 (α 3 ,β 3 ) Pd,k Probability of
Page 47 and 48:
Definition 3.9. The upper boundary
Page 49 and 50:
1 ε increasing ε = 0 Pd,k Probabi
Page 51 and 52:
1 P d,k P f,k β Q 0,k Probability
Page 53 and 54:
In general, as Q 0,k decreases, the
Page 55 and 56:
from J k by taking column-sums. If
Page 57 and 58:
Chapter 4 Computational Framework 4
Page 59 and 60:
Fact 4.1. Given a Markov chain θ
Page 61 and 62:
v 1 v 2 v 3 v 4 Figure 4.1. Simple
Page 63 and 64:
for some p ∈ (0,1). Then, the cor
Page 65 and 66:
Proof. Let ϑ 0:l be a possible pat
Page 67 and 68:
the matrix A as in Theorem 4.12. Th
Page 69 and 70:
every 1-bit of b i is a 1-bit of b
Page 71 and 72:
Assumed Structure of the Residual G
Page 73 and 74:
Therefore, conditional on the event
Page 75 and 76:
In the non-scalar case (i.e., r k
Page 77 and 78:
probability matrix is given by ( Λ
Page 79 and 80:
s 2 . .. s 0 s 1 s q Figure 4.4. St
Page 81 and 82:
metrics at time k are defined as Ĵ
Page 83 and 84: Proposition 4.32. Let N be the fina
Page 85 and 86: Algorithm 4.2. Procedure for comput
Page 87 and 88: Second, we show that the running ti
Page 89 and 90: Table 4.1. Time-complexity of compu
Page 91 and 92: For p ∈ [1,∞], the l p -norm ba
Page 93 and 94: linear time-varying uncertainties
Page 95 and 96: for the appropriate choice of k f a
Page 97 and 98: Hence, it is straightforward to sho
Page 99 and 100: v w f (θ) u G θ y . F r Figure 5.
Page 101 and 102: Maximizing the Probability of False
Page 103 and 104: β ∆ α v f (θ) u G θ y . F r F
Page 105 and 106: β ∆ α β ∆ 1 . .. ∆q α (a)
Page 107 and 108: if and only if [ T (βi ) T T (M i
Page 109 and 110: Fix a parameter sequence θ = ϑ an
Page 111 and 112: As in Section 5.2.2, if the matrix
Page 113 and 114: Chapter 6 Applications 6.1 Introduc
Page 115 and 116: p t p s v t + f t (θ) φ γ ˆV ĥ
Page 117 and 118: 300 18 V (m/s) 200 h (km) 12 Airspe
Page 119 and 120: 1 P tn,k 0.8 P fp,k P fn,k (a) Prob
Page 121 and 122: 0.4 Probability of False Alarm, P
Page 123 and 124: The following matrices correspond t
Page 125 and 126: 6.4.2 Applying the Framework The ma
Page 127 and 128: P ⋆ f Probability of False Alarm,
Page 129 and 130: Chapter 7 Conclusions & Future Work
Page 131 and 132: measurement noise. Hence, the appli
Page 133: [12] R. H. Chen, D. L. Mingori, and
Page 137 and 138: [68] L. A. Mironovski, Functional d
Page 139 and 140: [95] H. B. Wang, J. L. Wang, and J.
show all

Probabilistic Performance Analysis of Fault Diagnosis Schemes

Create successful ePaper yourself

Delete template?

Save as template?