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

A Push-Pull Gradient Method for Distributed Optimization in Networks

TL;DR: In this article, a push-pull gradient method is proposed to minimize the sum of the cost functions while obeying the network connectivity structure, and the algorithm converges linearly for strongly convex and smooth objective functions over a directed static network.
Journal ArticleDOI

A survey on recent progress in control of swarm systems

TL;DR: This survey is to take a glimpse into some newly developed control techniques for swarm systems, especially those presented after 2013, in the areas of consensus, formation, flocking, containment, optimal coverage/mission planning, and sensor networks.
Journal ArticleDOI

Formation-containment control for high-order linear time-invariant multi-agent systems with time delays ☆

TL;DR: It is shown that containment problems, formation control problems, consensus problems and consensus tracking problems can all be treated as special cases of formation-containment problems.
Journal ArticleDOI

Guaranteed-cost consensus for multiagent networks with Lipschitz nonlinear dynamics and switching topologies

TL;DR: Guaranteed-cost consensus for high-order nonlinear multi-agent networks with switching topologies is investigated by constructing a time-varying nonsingular matrix with a specific structure and an approach to minimize the guaranteed cost is given in terms of linear matrix inequalities.
Posted Content

Global $H_\infty$ Consensus of Multi-Agent Systems with Lipschitz Nonlinear Dynamics

TL;DR: In this article, a distributed consensus protocol based on the relative states of neighboring agents is proposed for a class of nonlinear multi-agent systems with Lipschitz nonlinearity and directed communication graphs.
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)