Algebraic Characterization of Observability in Distance-Regular Consensus Networks

Alain Kibangou (1) , Christian Commault (2)

1 NECS - Networked Controlled Systems
2 GIPSA-SLR - GIPSA - Systèmes linéaires et robustesse

In this paper, we study the observability issue in consensus networks modeled with strongly regular graphs or distance regular graphs. We derive a Kalman-like simple algebraic criterion for observability in distance regular graphs. This criterion consists in evaluating the rank of a matrix built with the components of the Bose-Mesner algebra associated with the considered graph. Then, we state a simple necessary condition of observability based on parameters of the graph, namely the diameter, the degree, and the number of vertices of the graph.

Domaines: Traitement du signal et de l'image [eess.SP]; Traitement du signal et de l'image [eess.SP]; Automatique / Robotique; Automatique

Alain Kibangou, Christian Commault. Algebraic Characterization of Observability in Distance-Regular Consensus Networks. CDC 2013 - 52nd IEEE Conference on Decision and Control, Dec 2013, Florence, Italy. pp.n/c. ⟨hal-00913926⟩