Related papers: Scaling laws for consensus protocols subject to no…
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…
We consider stationary consensus protocols for networks of dynamic agents with switching topologies. The measure of the neighbors' state is affected by Unknown But Bounded disturbances. Here the main contribution is the formulation and…
This paper considers the distributed consensus problem of linear multi-agent systems subject to different matching uncertainties for both the cases without and with a leader of bounded unknown control input. Due to the existence of…
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…
We consider distributed consensus in networks where the agents have integrator dynamics of order two or higher ($n\ge 2$). We assume all feedback to be localized in the sense that each agent has a bounded number of neighbors and consider a…
While distributed parameter estimation has been extensively studied in the literature, little has been achieved in terms of robust analysis and tuning methods in the presence of disturbances. However, disturbances such as measurement noise…
The paper proposes an intermittent communication mechanism for the tracking consensus of high-order nonlinear multi-agent systems (MASs) surrounded by random disturbances. Each collaborating agent is described by a class of high-order…
We study the signum consensus protocol in continuous-time systems over arbitrary weighted directed graphs with bounded disturbances. The right-hand side of the differential equation is discontinuous on a codimension-$n$ manifold ($n > 1$).…
We study the state consensus problem for linear shift-invariant discrete-time homogeneous multi-agent systems (MASs) over time-varying graphs. A novel approach based on the small gain theorem is proposed to design the consensus control…
The phenomenon of opinion disagreement has been empirically observed and reported in the literature, which is affected by various factors, such as the structure of social networks. An important discovery in network science is that most…
This paper studies the problem of coordinating a group of $n$th-order integrator systems. As for the well-studied conventional consensus problem, we consider linear and distributed control with only local and relative measurements. We…
This paper proposes a new approach to analyze and design distributed robust consensus control protocols for general linear leaderless multi-agent systems (MASs) in presence of relative-state constraints or uncertainties. First, we show that…
The present paper investigates the robustness of the consensus protocol over weighted directed graphs using the Nyquist criterion. The limit to which a single weight can vary, while consensus among the agents can be achieved, is explicitly…
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…
Security of a continuous-variable quantum key distribution protocol based on noisy coherent states and channel is analyzed. Assuming the noise of coherent states is induced by Fred, a neutral party relative to others, we prove that the…
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
Sufficient conditions of consensus (synchronization) in networks described by digraphs and consisting of identical determenistic SIMO systems are derived. Identical and nonidentical control gains (positive arc weights) are considered.…
We consider a simple but important class of metastable discrete time Markov chains, which we call perturbed Markov chains. Basically, we assume that the transition matrices depend on a parameter $\varepsilon$, and converge as $\varepsilon$.…
Quantum metrology protocols allow to surpass precision limits typical to classical statistics. However, in recent years, no-go theorems have been formulated, which state that typical forms of uncorrelated noise can constrain the quantum…
We investigate the performance of linear consensus algorithms subject to a scaling of the underlying network size. Specifically, we model networked systems with $n^{\text{th}}$ order integrator dynamics over families of undirected, weighted…