相关论文: Consensus and Flocking under Communication Failure

Indirect reciprocity is a mechanism by which individuals cooperate with those who have cooperated with others. This creates a regime in which repeated interactions are not necessary to incent cooperation (as would be required for direct…

In this note, we discuss the problem of consensus finding in communication networks of agents with dynamically switching topologies. In particular, we consider the case of directed networks with unbalanced matrices of communication rates.…

Results from the communication complexity literature have demonstrated that stable matching requires communication: one cannot find or verify a stable match without having access to essentially all of the ordinal preference information held…

In this paper, the consensus problems of the continuous-time integrator systems under noisy measurements are considered. The measurement noises, which appear when agents measure their neighbors' states, are modeled to be multiplicative. By…

This paper addresses novel consensus problems for multi-agent systems operating in an unreliable environment where adversaries are spreading. The dynamics of the adversarial spreading processes follows the susceptible-infected-recovered…

Consensus conditions and convergence speeds are crucial for distributed consensus algorithms of networked systems. Based on a basic first-order average-consensus protocol with time-varying topologies and additive noises, this paper first…

We prove that asymptotic global consensus is always reached in the Hegselmann-Krause model with finite speed of information propagation $\mathfrak{c}>0$ under minimal (i.e., necessary) assumptions on the influence function. In particular,…

Many algorithms have been proposed in prior literature to guarantee resilient multi-agent consensus in the presence of adversarial attacks or faults. The majority of prior work present excellent results that focus on discrete-time or…

This note further studies the previously proposed consensus protocol for linear multi-agent systems with communication noises in [15], [16]. Each agent is allowed to have its own time-varying gain to attenuate the effect of communication…

We present two main theorems along the lines of Lyapunov's second method that guarantee asymptotic state consensus in multi-agent systems of agents in R^m with switching interconnection topologies. The two theorems complement each other in…

This article provides an introduction to event-triggered coordination for multi-agent average consensus. We provide a comprehensive account of the motivations behind the use of event-triggered strategies for consensus, the methods for…

Flocking behavior of multiple agents can be widely observed in nature such as schooling fish and flocking birds. Recent literature has proposed the possibility that flocking is possible even only a small fraction of agents are informed of…

This paper studies the consensus problem of multi-agent systems with asymmetric and reducible topologies. Centralized event-triggered rules are provided so as to reduce the frequency of system's updating. The diffusion coupling feedbacks of…

In this technical note, cluster consensus of discrete-time linear multi-agent systems is investigated. A set of stochastic matrices $\mathcal{P}$ is said to be a cluster consensus set if the system achieves cluster consensus for any initial…

We consider continuous-time consensus seeking systems whose time-dependent interactions are cut-balanced, in the following sense: if a group of agents influences the remaining ones, the former group is also influenced by the remaining ones…

A challenge in multiagent control systems is to ensure that they are appropriately resilient to communication failures between the various agents. In many common game-theoretic formulations of these types of systems, it is implicitly…

Conventional distributed approaches to coverage control may suffer from lack of convergence and poor performance, due to the fact that agents have limited information, especially in non-convex discrete environments. To address this issue,…

In this paper, we consider a leader-following consensus problem of a group of autonomous agents with time-varying coupling delays. Two different cases of coupling topologies are investigated. At first, a necessary and sufficient condition…

Competitive interactions represent one of the driving forces behind evolution and natural selection in biological and sociological systems. For example, animals in an ecosystem may vie for food or mates; in a market economy, firms may…

A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels and move in synchronous rounds along…