Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
753020 | Systems & Control Letters | 2007 | 7 Pages |
Abstract
In this paper, we study the behavior of a network of N agents, each evolving on the circle. We propose a novel algorithm that achieves synchronization or balancing in phase models under mild connectedness assumptions on the (possibly time-varying and unidirectional) communication graphs. The global convergence analysis on the N-torus is a distinctive feature of the present work with respect to previous results that have focused on convergence in the Euclidean space.
Related Topics
Physical Sciences and Engineering
Engineering
Control and Systems Engineering
Authors
L. Scardovi, A. Sarlette, R. Sepulchre,