Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays
From MaRDI portal
Cited in
(17)- Resilient average consensus on general directed graphs in presence of cyber-attacks
- Stochastic consensus control of multi-agent systems under general noises and delays
- Distributed fixed-time consensus for nonlinear heterogeneous multi-agent systems
- Distributed least squares solver for network linear equations
- Distributed Stopping for Average Consensus in Digraphs
- On Robustness Analysis of a Dynamic Average Consensus Algorithm to Communication Delay
- Decentralized minimal‐time planar formation control of multi‐agent system
- Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation
- Finite-time general function consensus for multi-agent systems over signed digraphs
- Finite time quantized average consensus with transmission stopping guarantees and no quantization error
- A linearly convergent distributed heavy-ball GNE seeking algorithm for aggregative games over weight-unbalanced digraphs via finite-time consensus
- Bipartite consensus for networked Euler-Lagrange systems with cooperative-competitive interactions and time delays
- Minimal-time complex consensus for multi-agent systems with time delay
- Distributed load sharing and transmission power loss optimisation for DC microgrids
- Distributed adaptive three-dimension formation control based on improved RBF neural network for non-linear multi-agent time-delay systems
- Distributed target tracking based on localization with linear time-difference-of-arrival measurements: a delay-tolerant networked estimation approach
- Distributed implementation of DeePC for multi-input LTI systems over directed graphs
This page was built for publication: Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358473)
