Related papers: A Note on the Consensus Finding Problem in Communi…
In this paper we study a discrete time consensus model on a connected graph with monotonically increasing peer-pressure and noise perturbed outputs masking a hidden state. We assume that each agent maintains a constant hidden state and a…
In this paper, we address the discrete-time average consensus problem in strongly connected directed graphs, where nodes exchange information over unreliable error-prone communication links. We enhance the Robustified Ratio Consensus…
The paper considers the consensus problem in large networks represented by time-varying directed graphs. A practical way of dealing with large-scale networks is to reduce their dimension by collapsing the states of nodes belonging to…
The non-consensus problems of high order linear time-invariant dynamical homogeneous multi-agent systems are concerned. Based on the conditions of consensus achievement, the mechanisms that lead to non-consensus motions are analyzed.…
This article considers consensus problem of multiagent systems with double integrator dynamics under nonuniform sampling. It is considered the maximum sampling time can be selected arbitrarily. Moreover, the communication graph can change…
Considering some predictive mechanisms, we show that ultrafast average-consensus can be achieved in networks of interconnected agents. More specifically, by predicting the dynamics of the network several steps ahead and using this…
This paper studies the fastest distributed consensus averaging problem on branches of an arbitrary connected sensor network. In the previous works full knowledge about the sensor network's connectivity topology was required for determining…
Results for estimating the convergence rate of non-stationary distributed consensus algorithms are provided, on the basis of qualitative (mainly topological) as well as basic quantitative information (lower-bounds on the matrix entries).…
This paper introduces a conception that any weighted directed network topology is almost decouplable, which can help to transform the topology into a similar form being composed of uncoupled vertices, and thus reduce the complexity of…
This paper revisits the problem of multi-agent consensus from a graph signal processing perspective. By defining the graph filter from the consensus protocol, we establish the direct relation between average consensus of multi-agent systems…
We study diffusion and consensus dynamics in a Network of Networks model. In this model, there is a collection of sub-networks, connected to one another using a small number of links. We consider a setting where the links between networks…
In this paper, we study the distributed control of networked cyber-physical systems when a much more energy-efficient distributed communication management strategy is proposed to solve the well-studied consensus problem. In contrast to the…
This paper addresses the robust consensus problem under switching topologies. Contrary to existing methods, the proposed approach provides decentralized protocols that achieve consensus for networked multi-agent systems in a predefined…
We study the performance of asymptotic and approximate consensus algorithms under harsh environmental conditions. The asymptotic consensus problem requires a set of agents to repeatedly set their outputs such that the outputs converge to a…
This paper addresses the adaptive consensus problem in uncertain multi-agent systems, particularly under challenges posed by quantized communication. We consider agents with general linear dynamics subject to nonlinear uncertainties and…
This paper concerns the consensus of discrete-time multi-agent systems with linear or linearized dynamics. An observer-type protocol based on the relative outputs of neighboring agents is proposed. The consensus of such a multi-agent system…
We study a generic family of nonlinear dynamics on undirected networks generalising linear consensus. We find a compact expression for its equilibrium points in terms of the topology of the network and classify their stability using the…
This article investigates discrete-time matrix-weighted consensus of multi-agent networks over undirected and connected graphs. We first present consensus protocols for the agents in common networks of symmetric matrix weights with possibly…
Group consensus implies reaching multiple groups where agents belonging to the same cluster reach state consensus. This paper focuses on linear multi-agent systems under nonnegative directed graphs. A new necessary and sufficient condition…
In this paper, a distributed velocity-constrained consensus problem is studied for discrete-time multi-agent systems, where each agent's velocity is constrained to lie in a nonconvex set. A distributed constrained control algorithm is…