Linear Processes Under Vanishing Communications - The Consensus Problem

dc.contributor.authorSomarakis, Christoforos
dc.date.accessioned2012-04-10T15:19:13Z
dc.date.available2012-04-10T15:19:13Z
dc.date.issued2012-04-07
dc.description.abstractIn this report, we revisit the classical multi-agent distributed consensus problem under the dropping of the general assumption that the existence of a connection between agent implies weights uniformly bounded away from zero. We reformulate and study the problem by establishing global convergence results both in discrete and continuous time, under fixed, switching and random topologies.en_US
dc.identifier.urihttp://hdl.handle.net/1903/12448
dc.relation.isAvailableAtInstitute for Systems Researchen_us
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_us
dc.relation.isAvailableAtUniversity of Maryland (College Park, MD)en_us
dc.relation.ispartofseriesTR_2012-03
dc.subjectprocesses on graphsen_US
dc.subjectconsensusen_US
dc.titleLinear Processes Under Vanishing Communications - The Consensus Problemen_US
dc.typeTechnical Report

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_2012-03.pdf
Size:
522.6 KB
Format:
Adobe Portable Document Format