Abstract
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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
