.png){kind=icon}
.png){kind=icon}
Return
The deformed consensus protocol
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2013.07.006.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Multi-agent systems
Consensus algorithms
Cooperative control
Sensor networks
Autonomous mobile robots
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.