Related papers: Consensus with Output Saturations
This paper focuses on the convergence of infor- mation in distributed systems of agents communicating over a network. The information on which the convergence is sought is not represented by real numbers, rather by sets of real numbers,…
In this paper, cluster consensus of multi-agent systems is studied via inter-cluster nonidentical inputs. Here, we consider general graph topologies, which might be time-varying. The cluster consensus is defined by two aspects: the…
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'…
The present paper is devoted to the study of average consensus problems for undirected networks of dynamic agents having communication delays. The accent is put here on the study of the time-delays influence: both constant and time-varying…
In this letter, we study the problem of accelerating reaching average consensus over connected graphs in a discrete-time communication setting. Literature has shown that consensus algorithms can be accelerated by increasing the graph…
This paper proposes the first distributed algorithm that solves the weight-balancing problem using only finite rate and simplex communications among nodes, compliant with the directed nature of the graph edges. It is proved that the…
Due to the wide application of average consensus algorithm, its security and privacy problems have attracted great attention. In this paper, we consider the system threatened by a set of unknown agents that are both "malicious" and…
A distributed average consensus algorithm in which every sensor transmits with bounded peak power is proposed. In the presence of communication noise, it is shown that the nodes reach consensus asymptotically to a finite random variable…
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 paper, we address the distributed average consensus problem over directed networks in open multi-agent systems (OMAS), where the stability of the network is disrupted by frequent agent arrivals and departures, leading to a…
Distributed averaging of agent initial conditions is a well-studied problem in context of networked systems where coordination amongst the agents is of paramount importance. The asymptotic nature of convergence of distributed averaging…
We consider decentralized optimization problems where one aims to minimize a sum of convex smooth objective functions distributed between nodes in the network. The links in the network can change from time to time. For the setting when the…
We consider the problem of multi-agent consensus where some agents are subject to faults/attacks and might make updates arbitrarily. The network consists of agents taking integer-valued (i.e., quantized) states under directed communication…
This work is concerned with interconnected networks with non-identical subsystems. We investigate the output consensus of the network where the dynamics are subject to external disturbance and/or reference input. For a network of…
This paper investigates the distributed optimal output consensus problem of heterogeneous linear multi-agent systems over weight-unbalanced directed networks. A novel distributed continuous-time state feedback controller is proposed to…
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…
This paper studies a consensus problem in multidimensional networks having the same agent-to-agent interaction pattern under both intra- and cross-layer time delays. Several conditions for the agents to asymptotically reach a consensus are…
This work addresses the synchronization/consensus problem of identical multi-agent system (MAS) where the agents' dynamics are linear and the communication network is arbitrarily switching among connected topologies. The approach uses a…
In classical asynchronous distributed systems composed of a fixed number n of processes where some proportion may fail by crashing, many objects do not have a wait-free linearizable implementation (e.g. stacks, queues, etc.). It has been…
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,…