Observability preservation under sensor failure

被引：44

作者：

Commault, Christian ^{[1
]}

Dion, Jean-Michel ^{[1
]}

Trinh, Do Hieut ^{[1
]}

机构：

[1] ENSIEG, INPG, CNRS, LAG, F-38402 St Martin Dheres, France

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 2008年 / 53卷 / 06期

关键词：

linear structured systems; observability; sensor classification; sensor failure;

D O I：

10.1109/TAC.2008.928307

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper is concerned with the study of observability in a structural framework. It turns out that the system is structurally observable if and only if the system is output connected and contains no contraction. We focus our attention on the observability preservation under sensor failure. We consider linear observable systems and we wonder if a given system remains observable in case of sensor failure. More precisely, we will characterize among the sensors those which are critical, i.e., which failure leads to observability loss, those which are useless for observability purpose and the set of those which are useful without being critical. Using a graph approach we classify the sensors with respect to their importance for output connection preservation, contraction avoidance and then observability preservation under sensor failure.

引用

页码：1554 / 1559

页数：6

共 12 条

[1]

[Anonymous], 1987, ALGORITHMS COMBINATO

[2]

BERGE C, 1973, GRAPHES HYPERGRAPHES

[3]

Blanke M., 2006, DIAGNOSIS FAULT TOLE, V2nd

[4] Observability of structured linear systems in descriptor form: A graph-theoretic approach [J].

Boukhobza, T ;

Hamelin, F ;

Sauter, D .

AUTOMATICA, 2006, 42 (04) :629-635

[5]

Commault C, 2002, KYBERNETIKA, V38, P503

[6] Observability preservation under sensor failure [J].

Commault, Christian ;

Dion, Jean-Michel ;

Trinh, Do Hieu .

PROCEEDINGS OF THE 45TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-14, 2006, :3309-3314

[7] Generic properties and control of linear structured systems: a survey [J].

Dion, JM ;

Commault, C ;

van der Woude, J .

AUTOMATICA, 2003, 39 (07) :1125-1144

[8]

GABOW HN, 1990, PROCEEDINGS OF THE FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P434

[9]

Garey M. R., 1979, Computers and intractability. A guide to the theory of NP-completeness

[10]

Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P225, DOI 10.1137/0202019

← 1 2 →