Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs
type: Item
instance of: scholarly article
title: Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs
zbMATH Open document ID: 1453.93009
DOI: 10.1080/00207179.2018.1535200
published in: International Journal of Control
publication date: 2020-11-13T00:00:00Z
full work available at URL: http://hdl.handle.net/20.500.11937/82649
Mathematics Subject Classification ID: 93A16
Mathematics Subject Classification ID: 93D50
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 7274409
zbMATH Keywords: multi-agent systems
zbMATH Keywords: average consensus
zbMATH Keywords: surplus-based algorithm
zbMATH Keywords: strongly connected digraphs
zbMATH Keywords: balanced digraphs
MaRDI profile type: Publication
OpenAlex ID: W2897301962
cites work: Which digraphs with ring structure are essentially cyclic?
cites work: Q3546603
cites work: Averaging Over General Random Networks
cites work: Average consensus on general strongly connected digraphs
cites work: Average Consensus on Arbitrary Strongly Connected Digraphs With Time-Varying Topologies
cites work: Q3998992
cites work: Coordination of groups of mobile autonomous agents using nearest neighbor rules
cites work: Q3580272
cites work: Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
cites work: On Consensus Algorithms for Double-Integrator Dynamics
cites work: Fast linear iterations for distributed averaging
cites work: A Distributed Algorithm for Resource Allocation Over Dynamic Digraphs
cites work: Some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems
Wikidata QID: Q129158394
description: scientific article; zbMATH DE number 7274409