Discrete mode observability of switching linear systems with unknown inputs. a graph-theoretic approach

Taha Boukhobza (1) , Frédéric Hamelin (1) , Mohamed Ghassane Kabadi (1) , Samir Aberkane (1)

1 CRAN - Centre de Recherche en Automatique de Nancy

This paper deals with the observability of the discrete mode of structured switching linear systems with unknown inputs. The proposed method, based on a graph-theoretic approach, assumes only the knowledge of the system's structure. We express, in graphical terms, sufficient conditions for the generic observability of the discrete mode. If these conditions are not satisfied, we also propose a sensor placement procedure which allows to recover the mode observability. More precisely, we provide an exhaustive location set for additional sensors to recover the given sufficient mode observability condition. Our approach uses algorithms which have polynomial complexity orders and assumes only the knowledge of the system's structure. It can be implemented by classical graph-theory algorithms.

Mots clés: Switching linear systems; mode observability; sensor location; graph theory

Domaines: Automatique / Robotique

Taha Boukhobza, Frédéric Hamelin, Mohamed Ghassane Kabadi, Samir Aberkane. Discrete mode observability of switching linear systems with unknown inputs. a graph-theoretic approach. 18th IFAC World Congress, IFAC WC'2011, Aug 2011, Milan, Italy. pp.6616-6621, ⟨10.3182/20110828-6-IT-1002.01005⟩. ⟨hal-00650662⟩