The Laplacian of a graph mathematically formalizes the interactions occurring between nodes/agents connected by a link. Its extension to account for the indirect peer influence through longer paths, weighted as a function of their length, is represented by the notion of transformed d-path Laplacians. In this paper, we propose a second-order consensus protocol based on these matrices and derive criteria for the stability of the error dynamics, which also consider the presence of a communication delay. We show that the new consensus protocol is stable in a wider region of the control gains, but admits a smaller maximum delay than the protocol based on the classical Laplacian. We show numerical examples to illustrate our theoretical results.
Second-order consensus protocols based on transformed d-path Laplacians
Gambuzza, Lucia Valentina;Frasca, Mattia;
2019-01-01
Abstract
The Laplacian of a graph mathematically formalizes the interactions occurring between nodes/agents connected by a link. Its extension to account for the indirect peer influence through longer paths, weighted as a function of their length, is represented by the notion of transformed d-path Laplacians. In this paper, we propose a second-order consensus protocol based on these matrices and derive criteria for the stability of the error dynamics, which also consider the presence of a communication delay. We show that the new consensus protocol is stable in a wider region of the control gains, but admits a smaller maximum delay than the protocol based on the classical Laplacian. We show numerical examples to illustrate our theoretical results.File | Dimensione | Formato | |
---|---|---|---|
1-s2.0-S0096300318308166-Second-order consensus protocols.pdf
solo gestori archivio
Tipologia:
Versione Editoriale (PDF)
Dimensione
2 MB
Formato
Adobe PDF
|
2 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.