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

Finite-Time Consensus Problems for Networks of Dynamic Agents

TL;DR: It is proved that if the sum of time intervals, in which the interaction topology is connected, is sufficiently large, the proposed protocols will solve the finite-time consensus problems.
Journal ArticleDOI

Optimal Design for Synchronization of Cooperative Systems: State Feedback, Observer and Output Feedback

TL;DR: It is shown that unbounded synchronization regions that achieve synchronization on arbitrary digraphs containing a spanning tree can be guaranteed by using linear quadratic regulator based optimal control and observer design methods at each node.
Posted Content

Finite-Time Consensus Problems for Networks of Dynamic Agents

TL;DR: In this article, finite-time state consensus problems for continuous-time multi-agent systems are discussed, and two distributive protocols, which ensure that the states of agents reach an agreement in a finite time, are presented.
Journal ArticleDOI

Brief paper: Finite-time formation control for multi-agent systems

TL;DR: This paper proposes a class of nonlinear consensus protocols, which ensures that the related states of all agents will reach an agreement in a finite time under suitable conditions, and applies these protocols to the formation control, including time-invariant formation, time-varying formation and trajectory tracking.
Journal ArticleDOI

Flocking of Multi-Agents With a Virtual Leader

TL;DR: Modification to the Olfati-Saber algorithm is proposed and it is shown that the resulting algorithm enables the asymptotic tracking of the virtual leader.
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)