Average Consensus on Arbitrary Strongly Connected Digraphs With Time-Varying Topologies
From MaRDI portal
Publication:2983214
DOI10.1109/TAC.2014.2305952zbMath1360.93014arXiv1305.7182OpenAlexW1987917074MaRDI QIDQ2983214
Publication date: 16 May 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.7182
Decentralized systems (93A14) Symbolic dynamics (37B10) Directed graphs (digraphs), tournaments (05C20)
Related Items (15)
Average-consensus tracking of multi-agent systems with additional interconnecting agents ⋮ Non-centralized control for flow-based distribution networks: a game-theoretical insight ⋮ Non-smooth setting of stochastic decentralized convex optimization problem over time-varying graphs ⋮ Decentralized optimization over slowly time-varying graphs: algorithms and lower bounds ⋮ Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs ⋮ Active vibration control of structures using a leader–follower-based consensus design ⋮ On predefined-time consensus protocols for dynamic networks ⋮ On finite-time and fixed-time consensus algorithms for dynamic networks switching among disconnected digraphs ⋮ Predefined-time consensus of nonlinear first-order systems using a time base generator ⋮ Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs ⋮ Distributed consensus-based multi-agent convex optimization via gradient tracking technique ⋮ Pinning synchronization for directed networks with node balance via adaptive intermittent control ⋮ Sampled-data-based consensus of multi-agent systems under asynchronous denial-of-service attacks ⋮ A note on basic consensus problems in multi-agent systems with switching interconnection graphs ⋮ Stationary average-tracking problem of unmatched constant reference signals based on delayed-state feedback
This page was built for publication: Average Consensus on Arbitrary Strongly Connected Digraphs With Time-Varying Topologies
