scispace - formally typeset
Journal ArticleDOI

Consensus of multi-agent linear dynamic systems†

TLDR
The main result is that if the adjacent topology of the graph is frequently connected then the consensus is achievable via local-information-based decentralized controls, provided that the linear dynamic mode is completely controllable.
Abstract
In this paper the consensus problem is considered for multi-agent systems, in which all agents have an identical linear dynamic mode that can be of any order. The main result is that if the adjacent topology of the graph is frequently connected then the consensus is achievable via local-information-based decentralized controls, provided that the linear dynamic mode is completely controllable. Consequently, many existing results become particular cases of this general result. In this paper, the case of fixed connected topology is discussed first. Then the case of switching connected topology is considered. Finally, the general case is studied where the graph topology is switching and only connected often enough. Copyright © 2008 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Leader-following consensus of multi-agent systems under fixed and switching topologies ☆

TL;DR: The control of each agent using local information is designed and detailed analysis of the leader-following consensus is presented for both fixed and switching interaction topologies, which describe the information exchange between the multi-agent systems.
Journal ArticleDOI

Brief paper: Consensus of high-order linear systems using dynamic output feedback compensator: Low gain approach

TL;DR: This paper shows that consensus is reached if there exists a stable compensator which simultaneously stabilizes N-1 systems in a special form, where N is the number of agents, and shows that there exists such a compensator under a very general condition.
Journal ArticleDOI

Consensus of Linear Multi-Agent Systems by Distributed Event-Triggered Strategy

TL;DR: A novel event-triggered control scheme with some desirable features, namely, distributed, asynchronous, and independent is proposed and it is shown that consensus of the controlled multi-agent system can be reached asymptotically.
Journal ArticleDOI

Cooperative Output Regulation With Application to Multi-Agent Consensus Under Switching Network

TL;DR: This paper considers the cooperative output regulation of linear multi-agent systems under switching network and develops a distributed observer network that can solve the problem by both dynamic state feedback control and dynamic measurement output feedback control.
Journal ArticleDOI

Stability of a Class of Linear Switching Systems with Applications to Two Consensus Problems

TL;DR: This paper establishes a stability result for a class of linear switched systems involving Kronecker product and gives the solvability conditions for both the leaderless consensus problem and the leader-following consensus problem for general marginally stable linear multi-agent systems under switching network topology.
References
More filters
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.
Journal ArticleDOI

Consensus and Cooperation in Networked Multi-Agent Systems

TL;DR: A theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees is provided.
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.
Journal ArticleDOI

Novel Type of Phase Transition in a System of Self-Driven Particles

TL;DR: Numerical evidence is presented that this model results in a kinetic phase transition from no transport to finite net transport through spontaneous symmetry breaking of the rotational symmetry.
Related Papers (5)