.png){kind=icon}
返回
The deformed consensus protocol
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2013.07.006.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper studies a generalization of the standard continuous-time consensus protocol, obtained by replacing the Laplacian matrix of the communication graph with the so-called deformed Laplacian. The deformed Laplacian is a second-degree matrix polynomial in the real variable s which reduces to the standard Laplacian for s equal to unity. The stability properties of the ensuing deformed consensus protocol are studied in terms of parameter s for some special families of undirected and directed graphs, and for arbitrary graph topologies by leveraging the spectral theory of quadratic eigenvalue problems. Examples and simulation results are provided to illustrate our theoretical findings. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Multi-agent systems
Consensus algorithms
Cooperative control
Sensor networks
Autonomous mobile robots
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
分享收藏Consensus and cooperation in networked multi-agent systems网络化多智能体系统的共识与合作.png)
PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏
查看更多内容