Synchronization on the circle
| dc.creator | Sarlette, Alain | |
| dc.creator | Sepulchre, Rodolphe | |
| dc.date | 2009-01-16 | |
| dc.date.accessioned | 2026-07-07T12:31:00Z | |
| dc.date.available | 2026-07-07T12:31:00Z | |
| dc.description | 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. | |
| dc.description | submitted 01/2009 for possible book contribution | |
| dc.identifier | https://arxiv.org/abs/0901.2408 | |
| dc.identifier | http://arxiv.org/abs/0901.2408 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/216308 | |
| dc.subject | Optimization and Control | |
| dc.title | Synchronization on the circle | |
| dc.type | text |