A generalization of the graph Laplacian with application to a distributed consensus algorithm
type: Item
instance of: scholarly article
title: A generalization of the graph Laplacian with application to a distributed consensus algorithm
zbMATH Open document ID: 1322.93008
author: Guisheng Zhai
published in: International Journal of Applied Mathematics and Computer Science
publication date: 2015-10-16T00:00:00Z
Mathematics Subject Classification ID: 93A14
Mathematics Subject Classification ID: 94C15
Mathematics Subject Classification ID: 68T42
zbMATH DE Number: 6495500
zbMATH Keywords: graph Laplacian
zbMATH Keywords: generalized graph Laplacian
zbMATH Keywords: adjacency weights
zbMATH Keywords: distributed consensus algorithm
zbMATH Keywords: cooperative control
MaRDI profile type: Publication
full work available at URL: amcs-2015-0027
OpenAlex ID: W1171079553
cites work: New Challenges in Dynamical Systems: The Networked Case
cites work: Average consensus on general strongly connected digraphs
cites work: Information Flow and Cooperative Control of Vehicle Formations
cites work: Q3254327
cites work: Coordination of groups of mobile autonomous agents using nearest neighbor rules
cites work: Nonlinear systems.
cites work: Q4873761
cites work: Stability of multiagent systems with time-dependent communication links
cites work: Consensus and Cooperation in Networked Multi-Agent Systems
cites work: A distributed algorithm for average consensus on strongly connected weighted digraphs
cites work: Consensus seeking in multiagent systems under dynamically changing interaction topologies
cites work: A matrix inequality based design method for consensus problems in multi-agent systems
DOI: 10.1515/AMCS-2015-0027
description: scientific article; zbMATH DE number 6495500