.png){kind=icon}
返回
Consensus of Switched Multiagent Systems
.png){kind=icon}
OA
AI
DOI：10.1109/TCSII.2015.2482138.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Consensus
continuous time (CT)
discrete time (DT)
switched multiagent systems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
4.9
论文数:
8.8K
被引数:
2.5W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容