Average consensus on general strongly connected digraphs

From MaRDI portal
Publication:694804


DOI10.1016/j.automatica.2012.08.003zbMath1252.93004arXiv1203.2563MaRDI QIDQ694804

Kai Cai, Hideaki Ishii

Publication date: 13 December 2012

Published in: Automatica (Search for Journal in Brave)

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


93A14: Decentralized systems

94C15: Applications of graph theory to circuits and networks

68T42: Agent technology and artificial intelligence


Related Items

Distributed Average Consensus in Digraphs, Stationary average-tracking problem of unmatched constant reference signals based on delayed-state feedback, Finite-time median-related group consensus over directed networks, Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate, Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs, General resilient consensus algorithms, A gradient‐free distributed optimization method for convex sum of nonconvex cost functions, Distributed optimization without boundedness of gradients for second-order multi-agent systems over unbalanced network, Distributed convex optimization as a tool for solving \(f\)-consensus problems, Event‐triggered control for discrete‐time multi‐agent average consensus, Distributed web hacking by adaptive consensus-based reinforcement learning, Regulation cooperative control for heterogeneous uncertain chaotic systems with time delay: a synchronization errors estimation framework, A distributed algorithm for average consensus on strongly connected weighted digraphs, A generalization of the graph Laplacian with application to a distributed consensus algorithm, Node and network resistance to bribery in multi-agent systems, Average consensus on strongly connected weighted digraphs: a generalized error bound, Average-consensus tracking of multi-agent systems with additional interconnecting agents, Perturbing consensus for complexity: a finite-time discrete biased min-consensus under time-delay and asynchronism, Multi-stage discrete time and randomized dynamic average consensus, Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs, Multi-agent control: a graph-theoretic perspective, Resilient average consensus on general directed graphs in presence of cyber-attacks, Surplus-based accelerated algorithms for distributed optimization over directed networks, Gradient-free distributed optimization with exact convergence, Distributed least squares solver for network linear equations, An improved distributed gradient-push algorithm for bandwidth resource allocation over wireless local area network, Gossip consensus algorithm based on time-varying influence factors and weakly connected graph for opinion evolution in social networks, Local average consensus in distributed measurement of spatial-temporal varying parameters: 1D case, Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach, Joining consensus of networked multi-agent systems with nonlinear couplings and weighting constraints, Transcale average consensus of directed multi-vehicle networks with fixed and switching topologies



Cites Work