Consensus in discrete-time nonlinearly coupled networks

Anton Proskurnikov

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

We consider consensus algorithms for multi-agent networks with discrete-time linear identical MIMO agents. The agents may be of arbitrary order, the interaction topology may be time-varying and the couplings may be nonlinear and
uncertain, however assumed to satisfy a slope restriction or, more generally, quadratic constraint. Using the discrete-time version of the KYP Lemma (referred to as the Kalman-Szeg¨o Lemma), we derive a criterion which provide consensus in such a network for any uncertain couplings from the mentioned class. This criterion is close in spirit to the celebrated Tsypkin criterion for discrete time Lurie system.
Original languageEnglish
Title of host publicationProceedings of the 21st International Symposium on Mathematical Theory of Networks and Systems
Pages513-519
Number of pages7
Publication statusPublished - 2014
Event21th International Symposium on Mathematical Theory of Networks and Systems (MTNS) - Groningen, Netherlands
Duration: 7-Jul-201411-Jul-2014

Conference

Conference21th International Symposium on Mathematical Theory of Networks and Systems (MTNS)
CountryNetherlands
CityGroningen
Period07/07/201411/07/2014

Cite this