Verification of consensus in networks of heterogeneous LTI agents
2010 (English)In: Proceedings of SICE Annual Conference 2010, 2010, 2570-2575 p.Conference paper (Refereed)
A framework for robust stability of large scale systems consisting of linear time-invariant systems interconnected over a network will be surveyed and applied to solve heterogeneous consensus problems. The purpose of distributed consensus algorithms is to reach an agreement regarding a certain quantity of interest that depends on the state of all systems. In most of consensus literature, dynamics of all agents in the network are assumed to be the same and of low dimensions. This simplifies the analysis and, for the most elementary networks, stability and the rate of convergence can be determined from the eigenvalues of the interconnection matrix. Here we discuss analogous results for the case where the individual dynamics are heterogeneous and possibly of infinite dimensions. Our criterion for consensus resembles the classical Nyquist criterion. An interesting aspect of this criterion is that in some instances a three-dimensional plot is required in order to make analysis accurate.
Place, publisher, year, edition, pages
2010. 2570-2575 p.
Consensus, Large scale systems, Robust control, Stability
IdentifiersURN: urn:nbn:se:kth:diva-149696ScopusID: 2-s2.0-78649313355ISBN: 978-490776436-4OAI: oai:DiVA.org:kth-149696DiVA: diva2:741505
SICE Annual Conference 2010, SICE 2010, 18 August 2010 through 21 August 2010, Taipei, Taiwan
QC 201408282014-08-282014-08-262014-08-28Bibliographically approved