08.11.2014 Views

Probabilistic Performance Analysis of Fault Diagnosis Schemes

Probabilistic Performance Analysis of Fault Diagnosis Schemes

Probabilistic Performance Analysis of Fault Diagnosis Schemes

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

for the appropriate choice <strong>of</strong> k f and ϑ 0:N . The chief difficulty in solving (5.1) and (5.3) is<br />

expressing the minimum (5.4) as a function <strong>of</strong> ρ, which can then be minimized or maximized<br />

to compute Pf<br />

⋆ or P d ⋆ , respectively. To properly address this difficulty, we must make some<br />

additional assumptions about the sequence {r k (ρ)}. Then, under these assumptions, we<br />

develop a heuristic that allows us to write the minimization (5.4) in a more tractable form.<br />

5.2.1 Simplifying Assumptions<br />

Fix ρ ∈ P (•) , and let ˆr k (ρ,ϑ 0:k ) and Σ k (ρ,ϑ 0:k ) be the mean and variance, respectively, <strong>of</strong><br />

the residual r k (ρ) conditional on the event {θ 0:N = ϑ 0:N }. To make the minimization (5.4)<br />

tractable, we make the following assumptions:<br />

Assumption 1. The variance {Σ k } does not depend on the uncertain parameter ρ.<br />

Assumption 2. The variance {Σ k } does not depend on the sequence ϑ 0:N .<br />

Assumption 3. The threshold ε k is chosen in proportion to the variance Σ k . That is, for<br />

some fixed ν > 0, ε k = νΣ k , for all k.<br />

Remark 5.1. The purpose <strong>of</strong> Assumption 1 is to simplify the relationship between the uncertain<br />

parameter ρ and the function being minimized in (5.4). Similarly, Assumption 3<br />

simplifies the minimization (5.4) by removing the effect <strong>of</strong> the time-varying threshold {ε k }.<br />

Because the sequence <strong>of</strong> thresholds {ε k } must be chosen a priori, Assumption 3 is only<br />

possible when Assumptions 1 and 2 hold. An important special case where Assumptions 1<br />

and 2 hold is the case where the noise signal v is added directly to the system output y<br />

before it enters the residual generator F .<br />

Proposition 5.2. Let ρ ∈ P (•) , 0 ≤ k f < N , and ϑ 0:N ∈ Θ N+1 . If Assumptions 1–3 hold, then<br />

argmin<br />

k f ≤k≤N<br />

P ( |r k (ρ)| < ε k | θ 0:k = ϑ 0:k<br />

)<br />

= argmax<br />

k f ≤k≤N<br />

∣ ˆrk (ρ,ϑ 0:k ) ∣ ∣<br />

<br />

Σk<br />

.<br />

To facilitate the pro<strong>of</strong> <strong>of</strong> this proposition, we first establish the following lemma:<br />

Lemma 5.3. Let the function L: [0,∞) × R → [0,1) be defined as<br />

For any ν > 0 and all µ 1 ,µ 2 ∈ R,<br />

∫ ν<br />

)<br />

1 (s − µ)2<br />

L(ν,µ) := exp<br />

(− ds.<br />

−ν 2π 2<br />

|µ 1 | < |µ 2 | ⇐⇒ L(ν,µ 1 ) > L(ν,µ 2 ).<br />

82

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!