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

Consensus control for high-order multi-agent systems [Brief Paper]

TL;DR: A linear consensus protocol is proposed for solving such a consensus problem, which includes two parts: a feedback controller and interactions from the neighbours, and a sufficient and necessary condition for consensus in high-order systems is obtained.
Journal ArticleDOI

Consensus for multi-agent systems with inherent nonlinear dynamics under directed topologies

TL;DR: A variable transformation method is used to convert the consensus problem to a partial stability problem for multi-agent systems with inherent nonlinear dynamics under directed topologies under fixed and switching topologies.
Journal ArticleDOI

Trends in Networked Control Systems

TL;DR: This report presents the major contributions and the possible future challenges in the emerging area of Networked Control Systems.
Journal ArticleDOI

Finite-Time Consensus for Multiagent Systems With Cooperative and Antagonistic Interactions

TL;DR: This paper deals with finite-time consensus problems for multiagent systems that are subject to hybrid cooperative and antagonistic interactions by employing the nearest neighbor rule and shows that under the presented protocols, the states of all agents can be guaranteed to reach an agreement in a finite time regarding consensus values that are the same in modulus but may not be theSame in sign.
Journal ArticleDOI

Distributed finite‐time tracking of multiple Euler–Lagrange systems without velocity measurements

TL;DR: A new class of finite-time tracking protocols based only on the relative position measurements is developed and employed and it is proved that the multiple agents equipped with the designed protocols can track the target location in finite time.
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)