Title
On the consensus of homogeneous multi-agent systems with arbitrarily switching topology.
Abstract
In this paper we investigate the consensus problem under arbitrary switching for homogeneous multi-agent systems with switching communication topology, by assuming that each agent is described by a single-input stabilizable state–space model and that the communication graph is connected at every time instant. Under these assumptions, we construct a common quadratic positive definite Lyapunov function for the switched system describing the evolution of the disagreement vector, thus showing that the agents always reach consensus. In addition, the proof leads to the explicit construction of a constant state-feedback matrix that allows the multi-agent system to achieve consensus.
Year
DOI
Venue
2017
10.1016/j.automatica.2017.07.011
Automatica
Keywords
Field
DocType
Consensus,Homogeneous multi-agent system,Communication graph,Switched system,Stabilizability of switched system,Quadratic positive definite Lyapunov function
Consensus,Lyapunov function,Graph,Topology,Mathematical optimization,Homogeneous,Matrix (mathematics),Control theory,Positive-definite matrix,Quadratic equation,Multi-agent system,Mathematics
Journal
Volume
Issue
ISSN
84
1
0005-1098
Citations 
PageRank 
References 
7
0.47
17
Authors
2
Name
Order
Citations
PageRank
Maria Elena Valcher149339.11
Irene Zorzan2163.75