Mathematics – Optimization and Control
Scientific paper
2009-01-16
Mathematics
Optimization and Control
submitted 01/2009 for possible book contribution
Scientific paper
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.
Sarlette Alain
Sepulchre Rodolphe
No associations
LandOfFree
Synchronization on the circle does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Synchronization on the circle, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Synchronization on the circle will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-127069