Back to Search
Start Over
A Graph-Theoretic Condition for Global Identifiability of Weighted Consensus Networks.
- Source :
-
IEEE Transactions on Automatic Control . Feb2016, Vol. 61 Issue 2, p497-502. 6p. - Publication Year :
- 2016
-
Abstract
- In this technical note, we present a sufficient condition that guarantees identifiability for a class of linear network dynamic systems exhibiting continuous-time weighted consensus protocols. Each edge of the underlying network graph \cal G of the system is defined by a constant parameter, referred to as the weight of the edge, while each node is defined by a scalar state whose dynamics evolve as the weighted linear combination of its difference with the states of its neighboring nodes. Following the classical definition of output distinguishability, we first derive a condition that ensures the identifiability of the edge-weights of \cal G in terms of the associate transfer function. Using this characterization, we propose a sensor placement algorithm that guarantees identifiability of the edge-weights. We describe our results using illustrative examples. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00189286
- Volume :
- 61
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Automatic Control
- Publication Type :
- Periodical
- Accession number :
- 112683396
- Full Text :
- https://doi.org/10.1109/TAC.2015.2438425