Distributed averaging with linear objective maps
From MaRDI portal
Publication:290860
DOI10.1016/J.AUTOMATICA.2016.03.023zbMATH Open1339.93010arXiv1502.01074OpenAlexW2336996463MaRDI QIDQ290860FDOQ290860
Authors: Xudong Chen, Mohamed-Ali Belabbas, Tamer Başar 
Publication date: 3 June 2016
Published in: Automatica (Search for Journal in Brave)
Abstract: A consensus system is a linear multi-agent system in which agents communicate to reach a so-called consensus state, defined as the average of the initial states of the agents. Consider a more generalized situation in which each agent is given a positive weight and the consensus state is defined as the weighted average of the initial conditions. We characterize in this paper the weighted averages that can be evaluated in a decentralized way by agents communicating over a directed graph. Specifically, we introduce a linear function, called the objective map, that defines the desired final state as a function of the initial states of the agents. We then provide a complete answer to the question of whether there is a decentralized consensus dynamics over a given digraph which converges to the final state specified by an objective map. In particular, we characterize not only the set of objective maps that are feasible for a given digraph, but also the consensus dynamics that implements the objective map. In addition, we present a decentralized algorithm to design the consensus dynamics.
Full work available at URL: https://arxiv.org/abs/1502.01074
Recommendations
Agent technology and artificial intelligence (68T42) Decentralized systems (93A14) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Quantized consensus
- 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
- Title not available (Why is that?)
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
- Distributed strategies for generating weight-balanced and doubly stochastic digraphs
- Structural controllability
- Distributed Weight Balancing Over Digraphs
- On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
- Row-stochastic matrices with a common left fixed vector
- Sparse stable systems
- Convergence Time for Unbiased Quantized Consensus Over Static and Dynamic Networks
- Title not available (Why is that?)
- 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
Cited In (9)
- Notes on averaging over acyclic digraphs and discrete coverage control
- Gossip over holonomic graphs
- Distributed average consensus with least-mean-square deviation
- Fast linear iterations for distributed averaging
- Relative tempo of distributed averaging on networks
- Distributed average computation for multiple time-varying signals with output measurements
- Distributed average consensus in digraphs
- Optimal distributed linear averaging
- Distributed Averaging Via Lifted Markov Chains
This page was built for publication: Distributed averaging with linear objective maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290860)
