Algebraic Characterization of Observability in Distance-Regular Consensus Networks

Alain Y. Kibangou 1 Christian Commault 2
1 NECS - Networked Controlled Systems
Inria Grenoble - Rhône-Alpes, GIPSA-DA - Département Automatique
2 GIPSA-SLR - SLR
GIPSA-DA - Département Automatique
Abstract : 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.
Type de document :
Communication dans un congrès
52nd IEEE Conference on Decision and Control (CDC 2013), Dec 2013, Florence, Italy. pp.n/c, 2013
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00913926
Contributeur : Alain Kibangou <>
Soumis le : mercredi 4 décembre 2013 - 15:26:41
Dernière modification le : lundi 5 octobre 2015 - 16:56:16
Document(s) archivé(s) le : mercredi 5 mars 2014 - 06:30:18

Fichier

observability_SRG_cdc.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00913926, version 1

Collections

Citation

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

Partager

Métriques

Consultations de
la notice

441

Téléchargements du document

192