Consensus of switched multi-agent systems
Systems and Control
2014-07-15 v1
Abstract
In this paper, we consider the consensus problem of switched multi-agent system composed of continuous-time and discrete-time subsystems. By combining the classical consensus protocols of continuous-time and discrete-time multi-agent systems, we propose a linear consensus protocol for switched multi-agent system. Based on the graph theory and Lyapunov theory, we prove that the consensus of switched multi-agent system is solvable under arbitrary switching with undirected connected graph, directed graph and switching topologies, respectively. Simulation examples are also provided to demonstrate the effectiveness of the theoretical results.
Keywords
Cite
@article{arxiv.1407.3335,
title = {Consensus of switched multi-agent systems},
author = {Yuanshi Zheng and Jingying Ma and Long Wang},
journal= {arXiv preprint arXiv:1407.3335},
year = {2014}
}
Comments
16 pages, 4 figures