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

Fixed-Time Leader–Follower Output Feedback Consensus for Second-Order Multiagent Systems

TL;DR: A new continuous fixed-time distributed observer-based consensus protocol is developed to achieve consensus in a bounded finite time fully independent of initial condition.
Journal ArticleDOI

Consensus problems for high-dimensional multi-agent systems

TL;DR: In this article, a general model is introduced by presenting two typical examples along with some necessary and sufficient conditions for the system to solve a consensus problem, and the structures of consensus functions are investigated and some algebraic characterisations are given.
Journal ArticleDOI

Consensus of Multi-Agent Networks With Aperiodic Sampled Communication Via Impulsive Algorithms Using Position-Only Measurements

TL;DR: An impulsive consensus algorithm is proposed for second-order continuous-time multi-agent networks with switching topology by using the property of stochastic matrices and algebraic graph theory to ensure the consensus of the controlled multi- agent network if the communication graph has a spanning tree jointly.
Posted Content

Consensus of Hybrid Multi-agent Systems

TL;DR: In this paper, the authors considered the consensus problem of hybrid multi-agent system and proposed three kinds of consensus protocols for HMMS, which are based on matrix theory and graph theory.
Journal ArticleDOI

Distributed Average Tracking of Multiple Time-Varying Reference Signals With Bounded Derivatives

TL;DR: For time-invariant undirected connected network topologies, it is proved that the states of all agents will converge to the average of the time-varying reference signals with bounded derivatives in finite time provided that the control gain is properly chosen.
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)