Journal
AUTOMATICA
Volume 84, Issue -, Pages 79-85Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2017.07.011
Keywords
Consensus; Homogeneous multi-agent system; Communication graph; Switched system; Stabilizability of switched system; Quadratic positive definite Lyapunov; function
Ask authors/readers for more resources
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. (C) 2017 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available