Distributed averaging with linear objective maps

DOI10.1016/j.automatica.2016.03.023zbMath1339.93010arXiv1502.01074OpenAlexW2336996463MaRDI QIDQ290860

Tamer Başar, Mohamed-Ali Belabbas, Xudong Chen

Publication date: 3 June 2016

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.01074

zbMATH Keywords

multi-agent systemsdecentralized systemsnetworked control systemsdistributed averaging

Mathematics Subject Classification ID

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

Related Items (1)

Gossip over holonomic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Distributed strategies for generating weight-balanced and doubly stochastic digraphs
• Row-stochastic matrices with a common left fixed vector
• Sparse stable systems
• Quantized consensus
• Convergence Time for Unbiased Quantized Consensus Over Static and Dynamic Networks
• Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
• Structural controllability
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Stability of multiagent systems with time-dependent communication links
• Consensus seeking in multiagent systems under dynamically changing interaction topologies
• On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
• Distributed Weight Balancing Over Digraphs
• Cooperative control with distributed gain adaptation and connectivity estimation for directed networks
• On a Class of Directed Graphs—With an Application to Traffic-Flow Problems

This page was built for publication: Distributed averaging with linear objective maps