Related papers: A Note on the Consensus Finding Problem in Communi…
In this paper, we study the continuous-time consensus problem in the presence of adversaries. The networked multi-agent system is modeled as a switched system, where the normal agents have integrator dynamics and the switching signal…
This technical note addresses the distributed fixed-time consensus protocol design problem for multi-agent systems with general linear dynamics over directed communication graphs. By using motion planning approaches, a class of distributed…
Switching between finitely many continuous-time autonomous steepest descent dynamics for convex functions is considered. Convergence of complete solutions to common minimizers of the convex functions, if such minimizers exist, is shown. The…
This paper addresses the problem of identifying the topology of an unknown, weighted, directed network running a consensus dynamics. We propose a methodology to reconstruct the network topology from the dynamic response when the system is…
We consider multi-agent systems with cooperative interactions and study the convergence to consensus in the case of time-dependent connections, with possible communication failure. We prove a new condition ensuring consensus: we define a…
This paper investigates the distributed event-based consensus problem of switching networks satisfying the jointly connected condition. Both the state consensus of homogeneous linear networks and output consensus of heterogeneous networks…
There has been substantial work studying consensus problems for which there is a single common final state, although there are many real-world complex networks for which the complete consensus may be undesirable. More recently, the concept…
This paper studies a consensus problem of multi-agent systems subjected to external disturbances over the clustered network. It considers that the agents are divided into several clusters. They are almost all the time isolated one from…
This paper addresses the distributed consensus protocol design problem for linear multi-agent systems with directed graphs and external unmatched disturbances. A novel distributed adaptive consensus protocol is proposed to achieve…
This paper examines the consensus problem on time-varying matrix-weighed undirected networks. First, we introduce the matrix-weighted integral network for the analysis of such networks. Under mild assumptions on the switching pattern of the…
This paper introduces a novel continuous-time dynamic average consensus algorithm for networks whose interaction is described by a strongly connected and weight-balanced directed graph. The proposed distributed algorithm allows agents to…
In this work, we study the consensus problem in which legitimate agents send their values over an undirected communication network in the presence of an unknown subset of malicious or faulty agents. In contrast to former works, we…
This paper studies the consensus problem for multiagent systems with transmission constraints. A novel model of multiagent systems is proposed where the information transmissions between agents are disturbed by irregular distortions or…
In this paper, we study the leaderless consensus problem for multiple Lagrangian systems in the presence of parametric uncertainties and external disturbances under directed graphs. For achieving asymptotic behavior, a robust continuous…
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…
A distributed average consensus algorithm robust to a wide range of impulsive channel noise distributions is proposed. This work is the first of its kind in the literature to propose a consensus algorithm which relaxes the requirement of…
Distributed consensus protocols provide a mechanism for spreading information within clustered networks, allowing agents and clusters to make decisions without requiring direct access to the state of the ensemble. In this work, we propose a…
In this preliminary paper we study the stability property of a consensus on the average algorithm in arbitrary directed graphs with respect to communication/sensing time-delays. The proposed algorithm adds a storage variable to the agents'…
This paper presents the formulation of fault detection and accommodation schemes for a network of autonomous agents running internal model-based dynamic average consensus algorithms. We focus on two types of consensus algorithms, one that…
In this paper we address the consensus problem in the context of networked agents whose communication graph can be split into a certain number of clusters in such a way that interactions between agents in the same clusters are cooperative,…