Paper Info
Title
Second-order consensus protocols based on transformed -path Laplacians.
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.
Year
DOI
Venue
2019
10.1016/j.amc.2018.09.038
Applied Mathematics and Computation
Keywords
Field
DocType
Consensus,,d-path Laplacians,Communication delay
Applied mathematics,Graph,Mathematical optimization,Peer influence,Matrix (mathematics),Mathematics,Laplace operator
Journal
Volume
ISSN
Citations 
343
0096-3003
0
PageRank 
References 
Authors
0.34
29
3
Name
Order
Citations
PageRank
Lucia Valentina Gambuzza1546.94
Mattia Frasca231360.35
Ernesto Estrada3218.85