Average consensus on general strongly connected digraphs
From MaRDI portal
(Redirected from Publication:694804)
Abstract: We study the average consensus problem of multi-agent systems for general network topologies with unidirectional information flow. We propose two (linear) distributed algorithms, deterministic and gossip, respectively for the cases where the inter-agent communication is synchronous and asynchronous. Our contribution is that in both cases, the developed algorithms guarantee state averaging on arbitrary strongly connected digraphs; in particular, this graphical condition does not require that the network be balanced or symmetric, thereby extending many previous results in the literature. The key novelty of our approach is to augment an additional variable for each agent, called "surplus", whose function is to locally record individual state updates. For convergence analysis, we employ graph-theoretic and nonnegative matrix tools, with the eigenvalue perturbation theory playing a crucial role.
Recommendations
- Distributed average consensus in digraphs
- A distributed algorithm for average consensus on strongly connected weighted digraphs
- Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs
- Convergence speed in distributed consensus and averaging
- Convergence speed in distributed consensus and averaging
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 5454133 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 2061789 (Why is no real title available?)
- scientific article; zbMATH DE number 2136426 (Why is no real title available?)
- scientific article; zbMATH DE number 5050658 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- Accelerated Distributed Average Consensus via Localized Node State Prediction
- Analysis of accelerated gossip algorithms
- Average Consensus with Packet Drop Communication
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus of Multiagent Systems and Synchronization of Complex Networks: A Unified Viewpoint
- Convergence Rates of Distributed Average Consensus With Stochastic Link Failures
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Distributed Consensus With Limited Communication Data Rate
- Distributed Randomized Algorithms for the PageRank Computation
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- Fast linear iterations for distributed averaging
- Gossip consensus algorithms via quantized communication
- Multi-vehicle coordination for double-integrator dynamics under fixed undirected/directed interaction in a sampled-data setting
- Probability and random processes.
- Quantized Consensus and Averaging on Gossip Digraphs
- Quantized Consensus by Means of Gossip Algorithm
- Quantized consensus
Cited in
(40)- A distributed algorithm for average consensus on strongly connected weighted digraphs
- Node and network resistance to bribery in multi-agent systems
- Gossip consensus algorithm based on time-varying influence factors and weakly connected graph for opinion evolution in social networks
- Diffusion and consensus on weakly connected directed graphs
- Surplus-based accelerated algorithms for distributed optimization over directed networks
- Distributed least squares solver for network linear equations
- An improved distributed gradient-push algorithm for bandwidth resource allocation over wireless local area network
- Distributed optimization without boundedness of gradients for second-order multi-agent systems over unbalanced network
- Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs
- Consensus and multi-consensus for discrete-time LTI systems
- Local average consensus in distributed measurement of spatial-temporal varying parameters: 1D case
- Distributed averaging with linear objective maps
- Resilient distributed averaging: adversary detection and topological insights
- Regulation cooperative control for heterogeneous uncertain chaotic systems with time delay: a synchronization errors estimation framework
- Distributed algorithm for a finite time horizon resource allocation over a directed network
- Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate.
- A generalization of the graph Laplacian with application to a distributed consensus algorithm
- Event‐triggered control for discrete‐time multi‐agent average consensus
- A gradient‐free distributed optimization method for convex sum of nonconvex cost functions
- Multi-agent control: a graph-theoretic perspective
- Transcale average consensus of directed multi-vehicle networks with fixed and switching topologies
- Finite-time median-related group consensus over directed networks
- Distributed web hacking by adaptive consensus-based reinforcement learning
- Average consensus on strongly connected weighted digraphs: a generalized error bound
- Stationary average-tracking problem of unmatched constant reference signals based on delayed-state feedback
- Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs
- Joining consensus of networked multi-agent systems with nonlinear couplings and weighting constraints
- Graph-balancing algorithms for average consensus over directed networks
- Performance and robustness of discrete and finite time average consensus algorithms
- A primer on Laplacian dynamics in directed graphs
- Perturbing consensus for complexity: a finite-time discrete biased min-consensus under time-delay and asynchronism
- Graph diameter, eigenvalues, and minimum-time consensus
- General resilient consensus algorithms
- Distributed average consensus in digraphs
- Gradient-free distributed optimization with exact convergence
- Average-consensus tracking of multi-agent systems with additional interconnecting agents
- Distributed convex optimization as a tool for solving \(f\)-consensus problems
- Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach
- Resilient average consensus on general directed graphs in presence of cyber-attacks
- Multi-stage discrete time and randomized dynamic average consensus
This page was built for publication: Average consensus on general strongly connected digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q694804)
