Reference : Global synchronization on the circle
Scientific congresses and symposiums : Paper published in a book
Engineering, computing & technology : Multidisciplinary, general & others
http://hdl.handle.net/2268/9541
Global synchronization on the circle
English
Sarlette, Alain mailto [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Systèmes et modélisation >]
Tuna, Sezai Emre mailto [Université de Liège - ULG > Dpt. Electricité, électronique et informatique (Institut Montefiore) > Systems & Modeling > >]
Blondel, Vincent mailto [Université Catholique de Louvain - UCL > Mathematical Engineering > Large graphs and networks > >]
Sepulchre, Rodolphe mailto [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Systèmes et modélisation >]
Jul-2008
Proceedings of the 17th IFAC World Congress
9045-9050
Yes
Yes
International
17th IFAC World Congress
IFAC
Seoul
Korea
[en] consensus on circle ; multi-agent system ; time-variant communication topology ; gossip algorithm
[en] The convexity arguments used in the consensus literature to prove synchronization in vector spaces can be applied to the circle only when all agents are initially located on a semicircle. Existing strategies for (almost-)global synchronization on the circle are either restricted to specific interconnection topologies or use auxiliary variables. The present paper first illustrates this problem by showing that weighted, directed interconnection topologies can be designed to make any reasonably chosen configuration of the agents on the circle a stable equilibrium of a basic continuous-time consensus algorithm. Then it proposes a so-called “gossip algorithm”, which achieves global asymptotic synchronization on the circle with probability 1 for a large class of interconnections, without using auxiliary variables, thanks to the introduction of randomness in the system.
http://hdl.handle.net/2268/9541

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
ifac2.pdfAuthor preprint162.65 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.