scispace - formally typeset
Journal ArticleDOI

Consensus seeking in multiagent systems under dynamically changing interaction topologies

Reads0
Chats0
TLDR
It is shown that information consensus under dynamically changing interaction topologies can be achieved asymptotically if the union of the directed interaction graphs have a spanning tree frequently enough as the system evolves.
Abstract
This note considers the problem of information consensus among multiple agents in the presence of limited and unreliable information exchange with dynamically changing interaction topologies. Both discrete and continuous update schemes are proposed for information consensus. This note shows that information consensus under dynamically changing interaction topologies can be achieved asymptotically if the union of the directed interaction graphs have a spanning tree frequently enough as the system evolves.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

On Neighbor Information Utilization in Distributed Receding Horizon Control for Consensus-Seeking

TL;DR: This paper investigates the issue on how to utilize neighbor information in the distributed receding horizon control (RHC)-based consensus problem for first-order multiagent systems and shows that the best convergence rate in consensus can be attained if the neighbor information is appropriately utilized.
Journal ArticleDOI

Consensus of multiple double‐integrator agents with intermittent measurement

TL;DR: It is proved that consensus can be reached if the delays are small enough, and an admissible upper bound of delays is derived.
Journal ArticleDOI

Consensus of sampled-data multi-agent networking systems via model predictive control

TL;DR: A distributed MPC weighted-average consensus protocol for a continuous-time multi-agent network in the sampled- data setting is introduced, and it is proved such a sampled-data multi- agent system asymptotically reaches the weighted- average consensus via the distributedMPC protocol with both fixed and switching network topologies.
References
More filters
Book

Matrix Analysis

TL;DR: In this article, the authors present results of both classic and recent matrix analyses using canonical forms as a unifying theme, and demonstrate their importance in a variety of applications, such as linear algebra and matrix theory.
Journal ArticleDOI

Consensus problems in networks of agents with switching topology and time-delays

TL;DR: A distinctive feature of this work is to address consensus problems for networks with directed information flow by establishing a direct connection between the algebraic connectivity of the network and the performance of a linear consensus protocol.
Book

Algebraic Graph Theory

TL;DR: The Laplacian of a Graph and Cuts and Flows are compared to the Rank Polynomial.
Journal ArticleDOI

Coordination of groups of mobile autonomous agents using nearest neighbor rules

TL;DR: A theoretical explanation for the observed behavior of the Vicsek model, which proves to be a graphic example of a switched linear system which is stable, but for which there does not exist a common quadratic Lyapunov function.
Related Papers (5)