Related papers: Distributed finite-time termination for consensus …
In this paper, we analyze the convergence of a distributed Robbins-Monro algorithm for both constrained and unconstrained optimization in multi-agent systems. The algorithm searches for local minima of a (nonconvex) objective function which…
We analyze a class of distributed quantized consen- sus algorithms for arbitrary networks. In the initial setting, each node in the network has an integer value. Nodes exchange their current estimate of the mean value in the network, and…
This work addresses the output consensus problem of constrained heterogeneous multi-agent systems under a switching network with potential communication delays, where outputs are periodic and characterized by an exosystem. Since periodic…
This paper investigates the fixed-time consensus problem for a class of multi-agent systems with simple dynamics. Unlike the traditional way to realize fixed-time convergence, a novel strategy using the property of periodic functions is…
Generalized from the concept of consensus, this paper considers a group of edge agreements, i.e. constraints defined for neighboring agents, in which each pair of neighboring agents is required to satisfy one edge agreement constraint. Edge…
The topic of this paper is achieving finite-time max-consensus in a multi-agent system that communicates over a fading wireless channel and exploits its interference property. This phenomenon corrupts the desired information when data is…
This paper studies the consensus problem of multi-agent systems with asymmetric and reducible topologies. Centralized event-triggered rules are provided so as to reduce the frequency of system's updating. The diffusion coupling feedbacks of…
In this paper, the fast consensus problem of high-order multi-agent systems under undirected topologies is considered. The direct link between the consensus convergence rate and the control gains is established. An accelerated consensus…
Distributed allocation finds applications in many scenarios including CPU scheduling, distributed energy resource management, and networked coverage control. In this paper, we propose a fast convergent optimization algorithm with a tunable…
In this paper, we consider the consensus problem of switched multi-agent system composed of continuous-time and discrete-time subsystems. By combining the classical consensus protocols of continuous-time and discrete-time multi-agent…
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable attention in the last years. Many consensus algorithms have…
In this paper, we present new results on consensus for continuous-time multi- agent systems. We introduce the assumptions of persistent connectivity of the interaction graph and of slow divergence of reciprocal interaction weights.…
This paper proposes distributed algorithms for multi-agent networks to achieve a solution in finite time to a linear equation $Ax=b$ where $A$ has full row rank, and with the minimum $l_1$-norm in the underdetermined case (where $A$ has…
In this technical note we address the problem of achieving consensus in a network of homogeneous nonlinear systems. The communication network is supposed to be switching within a finite set of topologies which may be disconnected for finite…
In this paper consensus in second-order multi-agent systems with a non-periodic sampled-data exchange among agents is investigated. The sampling is random with bounded inter-sampling intervals. It is assumed that each agent has exact…
This paper studies the consensus control problem faced with three essential demands, namely, discrete control updating for each agent, discrete-time communications among neighboring agents, and the fully distributed fashion of the…
Average consensus protocols emerge with a central role in distributed systems and decision-making such as distributed information fusion, distributed optimization, distributed estimation, and control. A key advantage of these protocols is…
Natural, social, and artificial multi-agent systems usually operate in dynamic environments, where the ability to respond to changing circumstances is a crucial feature. An effective collective response requires suitable information…
This article deals with the consensus problem involving agents with time-varying singularities in the dynamics or communication in undirected graph networks. Existing results provide control laws which guarantee asymptotic consensus. These…
In this paper, we investigate asymptotic properties of a consensus protocol taking place in a class of temporal (i.e., time-varying) networks called the activity driven network. We first show that a standard methodology provides us with an…