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

Sampling-based event-triggered consensus for multi-agent systems

TL;DR: A self-triggered consensus protocol is proposed to further reduce the amount of communication and state sampling, as well as the number of events and thus the controller updates.
Journal ArticleDOI

An overview of consensus problems in constrained multi-agent coordination

TL;DR: A survey of recent research in consensus problems for constrained multi-agent coordination, focusing on theoretical directions of multi- agent systems paying particular attention from the system dynamics and control algorithms perspective, and some remarks on the practical direction of consensus problems developed for constraint-based coordination.
Journal ArticleDOI

Consensus seeking over directed networks with limited information communication

TL;DR: By avoiding the double stochasticity assumption on the update matrix, the proposed quantized protocol is particularly suitable for the scenarios where no bidirectional and/or balanced information communication among agents is available.
Journal ArticleDOI

Brief paper: Notes on averaging over acyclic digraphs and discrete coverage control

TL;DR: The relationship between two algorithms and optimization problems that are the subject of recent attention in the networking and control literature are shown and how discrete coverage control laws can be cast as averaging algorithms over discrete Voronoi graphs is shown.
Journal ArticleDOI

Sampled-data consensus in multi-agent systems with asynchronous hybrid event-time driven interactions

TL;DR: This paper characterizes the effectiveness of a hybrid event-time driven consensus protocol in different asynchronous scheduling schemes of event detection in terms of interaction topology, asynchronous matrix, and time delays and has robustness against interaction/event-detection time delays.
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)