Robustness of aggregation in networked dynamical systems

Luca Scardovi, Naomi Ehrich Leonard

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Scopus citations

Abstract

In this paper we study robustness of aggregation in networks of coupled identical systems driven by possibly different external inputs. This property is guaranteed by providing a finite £2 gain condition for the closed-loop system. We show, for a class of systems, how robustness depends on the connectivity of the underlying communication graph. Applications range from coordination problems where there are conflicting objectives to the study of aggregation phenomena where perturbations of the nominal systems must be taken into account. Both scenarios arise in networks of biological and engineered coordinating systems.

Original languageEnglish (US)
Title of host publication2009 2nd International Conference on Robot Communication and Coordination, RoboComm 2009
PublisherIEEE Computer Society
ISBN (Print)9789639799516
DOIs
StatePublished - 2009
Event2009 2nd International Conference on Robot Communication and Coordination, RoboComm 2009 - Odense, Denmark
Duration: Mar 31 2009Apr 2 2009

Publication series

Name2009 2nd International Conference on Robot Communication and Coordination, RoboComm 2009

Other

Other2009 2nd International Conference on Robot Communication and Coordination, RoboComm 2009
Country/TerritoryDenmark
CityOdense
Period3/31/094/2/09

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Computer Vision and Pattern Recognition
  • Software

Fingerprint

Dive into the research topics of 'Robustness of aggregation in networked dynamical systems'. Together they form a unique fingerprint.

Cite this