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.
Authors: Yuanshi Zheng, Long Wang
Institutions: Xidian University, Peking University
Language: English
Subfield: Control and Systems Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1673091696
