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
Proceedings ArticleDOI

Consensus of second-order heterogeneous multi-agent systems under a directed graph

TL;DR: An adaptive σ-modification scheme for the gain adaption is proposed, which renders smaller control gains and thus requires smaller amplitude on the control input without sacrificing the consensus convergence.
Journal ArticleDOI

Group consensus control for networked multi-agent systems with communication delays.

TL;DR: This paper investigates group consensus problems in networked multi-agent systems (NMAS) with communication delays based on the sed state prediction scheme and finds necessary and sufficient conditions of group consensus with respect to a given admissible control set are obtained for the NMAS with communication delay under mild assumptions.
Journal ArticleDOI

Adaptive synchronization of unknown heterogeneous agents: An adaptive virtual model reference approach

TL;DR: A Lyapunov-based approach is derived to show analytically asymptotic convergence of the synchronization error: robustification in the presence of bounded errors or unknown (constant) leader input is also discussed.
Journal ArticleDOI

Fully Distributed Low-Complexity Control for Nonlinear Strict-Feedback Multiagent Systems With Unknown Dead-Zone Inputs

TL;DR: A control algorithm is proposed to ensure predefined bounds of overshoot, convergence rates, and steady-state values of the neighborhood synchronization errors in the presence of unknown dead-zone inputs.
Proceedings ArticleDOI

Consensus in the network with uniform constant communication delay

TL;DR: An achievable upper bound of delay tolerance is obtained which explicitly depends on agent dynamics and network topology and is proposed so that the multi-agent consensus in a set of unknown networks can be achieved.
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)