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 or a torus. More in detail, under suitable conditions on the eigenvalue multiplicity, we provide necessary and sufficient conditions, based on simple algebraic rules from number theory, to characterize all and only the nodes from which the network system is observable (reachable). For any set of observation (leader) nodes, we provide a closed form expression for the unobservable (unreachable) eigenvalues and for the eigenvectors of the unobservable (unreachable) subsystem.
Notarstefano G., Parlangeli G. (2011). Observability and Reachability of Simple Grid and Torus Graphs. AUT : IFAC [10.3182/20110828-6-IT-1002.03618].
Observability and Reachability of Simple Grid and Torus Graphs
Notarstefano G.;
2011
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 or a torus. More in detail, under suitable conditions on the eigenvalue multiplicity, we provide necessary and sufficient conditions, based on simple algebraic rules from number theory, to characterize all and only the nodes from which the network system is observable (reachable). For any set of observation (leader) nodes, we provide a closed form expression for the unobservable (unreachable) eigenvalues and for the eigenvectors of the unobservable (unreachable) subsystem.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
