Average Consensus on Arbitrary Strongly Connected Digraphs With Time-Varying Topologies
From MaRDI portal
Abstract: We have recently proposed a "surplus-based" algorithm which solves the multi-agent average consensus problem on general strongly connected and static digraphs. The essence of that algorithm is to employ an additional variable to keep track of the state changes of each agent, thereby achieving averaging even though the state sum is not preserved. In this note, we extend this approach to the more interesting and challenging case of time-varying topologies: An extended surplus-based averaging algorithm is designed, under which a necessary and sufficient graphical condition is derived that guarantees state averaging. The derived condition requires only that the digraphs be arbitrary strongly connected in a emph{joint} sense, and does not impose "balanced" or "symmetric" properties on the network topology, which is therefore more general than those previously reported in the literature.
Cited in
(23)- Average-consensus tracking of multi-agent systems with additional interconnecting agents
- Predefined-time consensus of nonlinear first-order systems using a time base generator
- Distributed consensus-based multi-agent convex optimization via gradient tracking technique
- Sampled-data-based consensus of multi-agent systems under asynchronous denial-of-service attacks
- On predefined-time consensus protocols for dynamic networks
- Non-centralized control for flow-based distribution networks: a game-theoretical insight
- Average-Consensus in a Deterministic Framework— Part II: Central Connectivity
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Active vibration control of structures using a leader-follower-based consensus design
- Distributed Stopping for Average Consensus in Digraphs
- Tutorial on Dynamic Average Consensus: The Problem, Its Applications, and the Algorithms
- Stationary average-tracking problem of unmatched constant reference signals based on delayed-state feedback
- On finite-time and fixed-time consensus algorithms for dynamic networks switching among disconnected digraphs
- Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs
- Consensus and influence power approximation in time‐varying and directed networks subject to perturbations
- A note on basic consensus problems in multi-agent systems with switching interconnection graphs
- Non-smooth setting of stochastic decentralized convex optimization problem over time-varying graphs
- Decentralized optimization over slowly time-varying graphs: algorithms and lower bounds
- Consensus formation in first-order graphon models with time-varying topologies
- Practical prescribed-time distributed nonconvex optimization via a time-base generator
- Sum-of-values conservation on strongly connected open systems
- Pinning synchronization for directed networks with node balance via adaptive intermittent control
- Average consensus on strongly connected weighted digraphs: a generalized error bound
This page was built for publication: Average Consensus on Arbitrary Strongly Connected Digraphs With Time-Varying Topologies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983214)
