A resilient convex combination for consensus-based distributed algorithms

DOI10.3934/NACO.2019018MaRDI QIDQ2273122zbMATH OpenOpenAlexFDO

Authors Xuan Wang, Shaoshuai Mou, Shreyas Sundaram

Publication date 18 September 2019

Published in Numerical Algebra, Control and Optimization (Search for Journal in Brave)

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

zbMATH Keywords

autonomous systemsByzantine attackdistributed algorithmsmulti-agent systemsresilience

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Abstract: Consider a set of vectors in $mathbb{R}^n$, partitioned into two classes: normal vectors and malicious vectors. The number of malicious vectors is bounded but their identities are unknown. The paper provides a way for achieving a resilient convex combination, which is a convex combination of only normal vectors. Compared with existing approaches based on Tverberg points, the proposed method based on the intersection of convex hulls has lower computational complexity. Simulations suggest that the proposed method can be applied to resilience for consensus-based distributed algorithms against Byzantine attacks.

Recommendations

• Distributed convex optimization as a tool for solving \(f\)-consensus problems
• Robust Distributed Consensus Using Total Variation
• Distributed constrained stochastic optimal consensus
• Distributed random convex programming via constraints consensus
• Continuous-Time Algorithm Based on Finite-Time Consensus for Distributed Constrained Convex Optimization
• A Distributed Algorithm for Convex Constrained Optimization Under Noise
• Constrained Consensus Algorithms With Fixed Step Size for Distributed Convex Optimization Over Multiagent Networks
• A fixed-time convergent algorithm for distributed convex optimization in multi-agent systems
• Resilient consensus‐based distributed optimization under deception attacks
• Distributed Algorithms for Composite Optimization: Unified Framework and Convergence Analysis

Cited in

(9)

• Triangulated Laman graphs, local stochastic matrices, and limits of their products
• Resilient distributed vector consensus using centerpoint
• Secure rendezvous and static containment in multi-agent systems with adversarial intruders
• Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators
• Robust Distributed Consensus Using Total Variation
• General resilient consensus algorithms
• A stealthy man-in-the-middle attack strategy for switched systems
• Randomized Kaczmarz in adversarial distributed setting
• Centroid approximation with multidimensional approximate agreement protocols

This page was built for publication: A resilient convex combination for consensus-based distributed algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2273122)