A generalization of the graph Laplacian with application to a distributed consensus algorithm

DOI10.1515/AMCS-2015-0027zbMath1322.93008OpenAlexW1171079553MaRDI QIDQ747494

Guisheng Zhai

Publication date: 16 October 2015

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/amcs-2015-0027

zbMATH Keywords

cooperative controlgraph Laplacianadjacency weightsdistributed consensus algorithmgeneralized graph Laplacian

Mathematics Subject Classification ID

Decentralized systems (93A14) Applications of graph theory to circuits and networks (94C15) Agent technology and artificial intelligence (68T42)

Related Items (2)

Distributed fault estimation of multi-agent systems using a proportional-integral observer: a leader-following application ⋮ Quadratic performance analysis of switched affine time-varying systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A distributed algorithm for average consensus on strongly connected weighted digraphs
• Average consensus on general strongly connected digraphs
• A matrix inequality based design method for consensus problems in multi-agent systems
• Consensus and Cooperation in Networked Multi-Agent Systems
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Information Flow and Cooperative Control of Vehicle Formations
• Stability of multiagent systems with time-dependent communication links
• Consensus seeking in multiagent systems under dynamically changing interaction topologies
• New Challenges in Dynamical Systems: The Networked Case

This page was built for publication: A generalization of the graph Laplacian with application to a distributed consensus algorithm