Synchronization on the circle
From MaRDI portal
Publication:3172726
zbMATH Open1227.37031arXiv0901.2408MaRDI QIDQ3172726FDOQ3172726
Authors: Alain Sarlette, Rodolphe Sepulchre 
Publication date: 5 October 2011
Abstract: The goal of the present paper is to highlight the fundamental differences of so-called synchronization or consensus algorithms when the agents to synchronize evolve on a compact homogeneous manifold (like the circle, sphere or the group of rotation matrices), instead of a vector space. For the benefit of understanding, the discussion is restricted to the circle. First, a fundamental consensus algorithm on R^n is reviewed, from which continuous- and discrete-time synchronization algorithms on the circle are deduced by analogy. It is shown how they are connected to Kuramoto and Vicsek models from the literature. Their convergence properties are similar to vector spaces only for specific graphs or if the agents are all located within a semicircle. Examples are proposed to illustrate several other possible behaviors. Finally, new algorithms are proposed to recover (almost-)global synchronization properties.
Full work available at URL: https://arxiv.org/abs/0901.2408
Cited In (7)
- Asynchronous Distributed Algorithms for Heading Consensus of Multi-Agent Systems with Communication Delay
- Synchronization in complex networks of phase oscillators: a survey
- Consensus and balancing on the three-sphere
- Simultaneous velocity consensus and shape control for a finite number of point agents on the unit circle
- Frequency synchronization and phase agreement in Kuramoto oscillator networks with delays
- Qualitative stability and synchronicity analysis of power network models in port-Hamiltonian form
- Higher-dimensional generalizations of the Watanabe-Strogatz transform for vector models of synchronization
This page was built for publication: Synchronization on the circle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172726)
