Abstract

In this paper we investigate the observability and reachability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a grid. More in detail, we characterize the structure of the grid eigenvectors by means of suitable decompositions of the graph. For each eigenvalue, based on its multiplicity and on suitable symmetries of the corresponding eigenvectors, we provide necessary and sufficient conditions to characterize all and only the nodes from which the network system is observable (reachable). We discuss the proposed criteria and show, through suitable examples, how such criteria reduce the complexity of the observability (respectively reachability) analysis of the grid.

Autore Pugliese

• Notarstefano Giuseppe , Parlangeli Gianfranco

Tutti gli autori

• G. Notarstefano , G. Parlangeli

Titolo volume/Rivista

PROCEEDINGS OF THE IEEE CONFERENCE ON DECISION & CONTROL

Anno di pubblicazione

2011

ISSN

0743-1546

ISBN

Non Disponibile

Numero di citazioni Wos

6

Ultimo Aggiornamento Citazioni

27/04/2018

Numero di citazioni Scopus

12

Ultimo Aggiornamento Citazioni

26/04/2018

Settori ERC

Non Disponibile

Codici ASJC

Non Disponibile