Related papers: Resilient Leader-Follower Consensus to Arbitrary R…
The leader-following consensus of multiple linear time invariant (LTI) systems under switching topology is considered. The leader-following consensus problem consists of designing for each agent a distributed protocol to make all agents…
This paper is concerned with the leader-following consensus problem for a class of Lipschitz nonlinear multi-agent systems with uncertain dynamics, where each agent only transmits its noisy output, at discrete instants and independently…
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 addresses the challenge of achieving private and resilient average consensus among a group of discrete-time networked agents without compromising accuracy. State-of-the-art solutions to attain privacy and resilient consensus…
This paper considers the distributed consensus problem of multi-agent systems with general continuous-time linear dynamics. Two distributed adaptive dynamic consensus protocols are proposed, based on the relative output information of…
This paper studies privacy-preserving resilient vector consensus in multi-agent systems against faulty agents, where normal agents can achieve consensus within the convex hull of their initial states while protecting state vectors from…
In linear models of consensus dynamics, the state of the various agents converges to a value which is a convex combination of the agents' initial states. We call it democratic if in the large scale limit (number of agents going to infinity)…
A generalized family of Adversary Robust Consensus protocols is proposed and analyzed. These are distributed algorithms for multi-agents systems seeking to agree on a common value of a shared variable, even in the presence of faulty or…
This paper proposes a continuous-time dynamic active weighted average consensus algorithm in which the agents can alternate between active and passive modes depending on their ability to access to their reference input. The objective is to…
We consider a scenario in which leaders are required to recruit teams of followers. Each leader cannot recruit all followers, but interaction is constrained according to a bipartite network. The objective for each leader is to reach a state…
This paper considers the resilient multi-dimensional consensus problem in networked systems, where some of the agents might be malicious (or faulty). We propose a multi-dimensional consensus algorithm, where at each time step each healthy…
In this paper an emergence of leader-following model based on graph theory on the arbitrary time scales is investigated. It means that the step size is not necessarily constant but it is a function of time. We propose and prove conditions…
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…
We study the performance of leader-follower noisy consensus networks, and in particular, the relationship between this performance and the locations of the leader nodes. Two types of dynamics are considered (1) noise-free leaders, in which…
This paper proposes a reinforcement learning (RL)-based backstepping control strategy to achieve fixed time consensus in nonlinear multi-agent systems with strict feedback dynamics. Agents exchange only output information with their…
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.…
We consider the problem of solving consensus using deterministic algorithms in a synchronous dynamic network with unreliable, directional point-to-point links, which are under the control of a message adversary. In contrast to a large body…
In this paper, we study the resilient vector consensus problem in networks with adversarial agents and improve resilience guarantees of existing algorithms. A common approach to achieving resilient vector consensus is that every…
This paper addresses the finite-time non-overshooting leader-following consensus problem for multi-agent systems, whose agents are modeled by a dynamical system topologically equivalent to the integrator chain. Based on the weighted…
In the typical multiagent formation tracking problem centered on consensus, the prevailing assumption in the literature is that the agents' nonlinear models can be approximated by integrator systems, by their feedback-linearized…