Diagnosis and FTC by Prof. Blanke [pdf] - NTNU

Diagnosis and FTC by Prof. Blanke [pdf] - NTNU Diagnosis and FTC by Prof. Blanke [pdf] - NTNU

12.04.2013 Views

59 60 Purpose and scope of part 2 • Matching – a graph method to find the nonlinear parity relations that can later be used in diagnosis. • Define maximal and complete matching • Investigate matching on an oriented graph • Discuss causality • Dealing with algebraic constraints • Dealing with loops in graphs Complete matching Mogens Blanke – Spring 2006 A matching M is a subset of edges such that no edge have common node (neither in C nor in X). Let M be number of edges in M, then M ≤ min C X A matching is complete in X if M = X. It is complete in C if M = C . Figure: One incomplete and two complete matchings in X for the tank example. ( , ) Mogens Blanke – Spring 2006 30

61 62 Differential and integral constraints (repeat) Differential constraint dh c6: h= dt Integral constraint c : h( t) = h( τ) dτ + h(0) 6 t ∫ 0 Obvious assumptions (5.2) All constraints in C are compatible The constraints provide a solution to the behaviour of a physical system. (5.3) All constraints in C are independent Mogens Blanke – Spring 2006 Mogens Blanke – Spring 2006 31

61<br />

62<br />

Differential <strong>and</strong> integral constraints<br />

(repeat)<br />

Differential constraint<br />

dh<br />

c6: h=<br />

dt<br />

Integral constraint<br />

c : h( t) = h( τ) dτ + h(0)<br />

6<br />

t<br />

∫<br />

0<br />

Obvious assumptions<br />

(5.2) All constraints in C are compatible<br />

The constraints provide a solution to the<br />

behaviour of a physical system.<br />

(5.3) All constraints in C are independent<br />

Mogens <strong>Blanke</strong> – Spring 2006<br />

Mogens <strong>Blanke</strong> – Spring 2006<br />

31

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

Saved successfully!

Ooh no, something went wrong!