Work

Consensus of Switched Multiagent Systems

Year: 2015
Type: article
Abstract: In this brief, we consider the consensus problem of a switched multiagent system composed of continuous-time (CT) and discrete-time (DT) subsystems. By combining the classical consensus protocols of CT and DT multiagent systems, we propose a linear consensus protocol for switched multiagent system. Based on the graph theory and the Lyapunov theory, we prove that the consensus of switched multiagent 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.
Language: English
Open Access status: green
OpenAlex ID: W1673091696
FWCI: 15.32
Cites: 37
Cited by: 180
Related to: 10