Privacy-preserving dynamic weighted average consensus based on agent decomposition
From MaRDI portal
Cites work
- A distributed protocol for finite-time supremum or infimum dynamic consensus: the directed graph case
- A novel dynamic event-triggered mechanism for dynamic average consensus
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Differentially private average consensus: obstructions, trade-offs, and optimal algorithm design
- Discrete-time dynamic average consensus
- Distributed Average Tracking in Weight-Unbalanced Directed Networks
- Dynamic average consensus over strongly connected digraphs based on integral surplus
- Dynamic average consensus under limited control authority and privacy requirements
- On Robustness Analysis of a Dynamic Average Consensus Algorithm to Communication Delay
- Predefined-time distributed average tracking for multiagent systems with actuator faults
- Privacy Preserving Average Consensus
- Privacy-preserving average consensus through network augmentation
- Privacy-Preserving Average Consensus via State Decomposition
- Privacy-preserving dynamic average consensus via state decomposition: case study on multi-robot formation control
- Privacy-protected and prescribed-time dynamic average consensus over directed networks: an integral surplus-based approach
- Secure and privacy preserving consensus for second-order systems based on Paillier encryption
- Secure and Privacy-Preserving Consensus
This page was built for publication: Privacy-preserving dynamic weighted average consensus based on agent decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7355286)
