DocumentCode
2743933
Title
On consensus with a general discrete time convex combination based algorithm for multi-agent systems
Author
Bolouki, Sadegh ; Malhamé, Roland P.
Author_Institution
GERAD, Ecole Polytech. de Montreal, Montreal, QC, Canada
fYear
2011
fDate
20-23 June 2011
Firstpage
668
Lastpage
673
Abstract
A general convex combination based model in discrete time for the evolution of multi-agent systems is considered. Sufficient conditions under which an individual limit for each agent´s state exists are subsequently derived. Moreover, it is shown that under stronger conditions, those individual limits are equal, i.e., consensus occurs. The relationship of these results to those of other well known consensus models is explained.
Keywords
discrete time systems; multi-agent systems; multi-robot systems; consensus models; general convex combination based model; general discrete time convex combination based algorithm; multi-agent systems; Convergence; Equations; Indexes; Linear matrix inequalities; Mathematical model; Multiagent systems; Numerical models; Multi-agent systems; consensus reaching problem; flocking; individual limits;
fLanguage
English
Publisher
ieee
Conference_Titel
Control & Automation (MED), 2011 19th Mediterranean Conference on
Conference_Location
Corfu
Print_ISBN
978-1-4577-0124-5
Type
conf
DOI
10.1109/MED.2011.5983182
Filename
5983182
Link To Document