Related papers: Synchronization on the circle
We present new conditions to obtain synchronization and consensus patterns in complex network systems. The key idea is to exploit symmetries of the nodes' vector fields to induce a desired synchronization/consensus pattern, where nodes are…
The Kuramoto model of coupled phase oscillators is often used to describe synchronization phenomena in nature. Some applications, e.g., quantum synchronization and rigid-body attitude synchronization, involve high-dimensional Kuramoto…
Algorithms for decentralized optimization and learning rely on local optimization steps coupled with combination steps over a graph. Recent works have demonstrated that using a time-varying sequence of matrices that achieves finite-time…
Neural synchrony is hypothesized to play a crucial role in how the brain organizes visual scenes into structured representations, enabling the robust encoding of multiple objects within a scene. However, current deep learning models often…
This paper presents an algorithm for the synchronization of blind agents (agents are unable to observe other agents, i.e. no communication) evolving on a connected Lie group $G$. We employ the method of extremum seeking control for…
We develop a geometric framework that characterizes the synchronization problem --- the problem of consistently registering or aligning a collection of objects. The theory we formulate characterizes the cohomological nature of…
We introduce two generalizations of synchronizability to automata with transitions weighted in an arbitrary semiring K=(K,+,*,0,1). (or equivalently, to finite sets of matrices in K^nxn.) Let us call a matrix A location-synchronizing if…
We study the problem of asymptotic consensus as it occurs in a wide range of applications in both man-made and natural systems. In particular, we study systems with directed communication graphs that may change over time. We recently…
In this paper, inspired by the idea that many real networks are composed by different sorts of communities, we investigate the synchronization property of oscillators on such networks. We identify the communities by the intrinsic…
Synchronization on the sphere is important to certain control applications in swarm robotics. Of recent interest is the Lohe model, which generalizes the Kuramoto model from the circle to the sphere. The Lohe model is mainly studied in…
A graph $\mathcal{G}$ is referred to as $\mathsf{S}^1$-synchronizing if, roughly speaking, the Kuramoto-like model whose interaction topology is given by $\mathcal{G}$ synchronizes almost globally. The Kuramoto model evolves on the unit…
A unified framework for analyzing generalized synchronization in coupled chaotic systems from data is proposed. The key of the proposed approach is the use of the kernel methods recently developed in the field of machine learning. Several…
We consider continuous-time consensus seeking systems whose time-dependent interactions are cut-balanced, in the following sense: if a group of agents influences the remaining ones, the former group is also influenced by the remaining ones…
We address discrete-time consensus on the Euclidean unit sphere. For this purpose we consider a distributed algorithm comprising the iterative projection of a conical combination of neighboring states. Neighborhoods are represented by a…
In this paper, we study a convergence condition for asynchronous consensus problems in multi-agent systems. The convergence in this context implies the asynchronous consensus value converges to the synchronous one and is unique. Although it…
In this paper, we discuss a class of distributed detection algorithms which can be viewed as implementations of Bayes' law in distributed settings. Some of the algorithms are proposed in the literature most recently, and others are first…
Consensus planning is a method for coordinating decision making across complex systems and organizations, including complex supply chain optimization pipelines. It arises when large interdependent distributed agents (systems) share common…
With the advancement of modern robotics, autonomous agents are now capable of hosting sophisticated algorithms, which enables them to make intelligent decisions. But developing and testing such algorithms directly in real-world systems is…
This note concerns the evolution of multi-agent systems on networks over Riemannian manifolds. The motion of each agent is governed by the gradient descent flow of a disagreement function that is a sum of (squared) distances between pairs…
In this paper, multi-agent systems minimizing a sum of objective functions, where each component is only known to a particular node, is considered for continuous-time dynamics with time-varying interconnection topologies. Assuming that each…