Show simple item record

Towards a unified theory of consensus

dc.contributor.advisorBaras, John
dc.contributor.authorSomarakis, Christoforos
dc.date.accessioned2014-10-17T14:21:00Z
dc.date.available2014-10-17T14:21:00Z
dc.date.issued2014-10-12
dc.identifierhttps://doi.org/10.13016/M2MW3B
dc.identifier.urihttp://hdl.handle.net/1903/15969
dc.description.abstractWe revisit the classic multi-agent distributed consensus problem under mild connectivity assumptions and non-uniformly bounded weights. The analysis is based on a novel application of the standard results from the non-negative matrix theory. It is a simple, yet unifying, approach that yields generalized results. We apply these results to a wide variety of linear, non-linear consensus and flocking algorithms proposed in the literature and we obtain new conditions for asymptotic consensus. Our framework is developed in both discrete and continuous time. Furthermore we extend the discussion to stochastic settings.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseries;TR_2014-09
dc.subjectConsensus Dynamicsen_US
dc.subjectFlocking Networksen_US
dc.titleTowards a unified theory of consensusen_US
dc.typeTechnical Reporten_US
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


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record