Communication sequence selection to preserve reachability/observability in networked control systems with communication constraints: a graphic approach

Sinuhé Martinez-Martinez (1, 2) , Hossein Hashemi Nejad (1) , Taha Boukhobza (1) , Dominique Sauter (1)

1 CRAN - Centre de Recherche en Automatique de Nancy
2 CRESTIC - Centre de Recherche en Sciences et Technologies de l'Information et de la Communication - EA 3804

This paper proposes a graphical strategy for nding all communication sequences that ensure reachability and observability of a Networked Control system (NCS) in which a linear time invariant (LTI) plant communicates with a controller or a fault detection (FD) module over a shared medium. The medium supports a limited number of simultaneous connection between sensors and controller/FD module. The proposed method is based on a graph-theoretic approach and it needs only the knowledge of the system's structure.

Mots clés: Maximal Matching.; Maximal Matching; Networked Control Systems; Medium Access Constraint; Reachability; Observability; Graph Theory

Domaines: Automatique / Robotique

Sinuhé Martinez-Martinez, Hossein Hashemi Nejad, Taha Boukhobza, Dominique Sauter. Communication sequence selection to preserve reachability/observability in networked control systems with communication constraints: a graphic approach. 18th IFAC World Congress, IFAC WC'2011, Aug 2011, Milan, Italy. pp.8914-8919. ⟨hal-00650690⟩