TY - GEN
T1 - Resilient Constrained Consensus over Complete Graphs via Feasibility Redundancy
AU - Zhu, Jingxuan
AU - Lin, Yixuan
AU - Velasquez, Alvaro
AU - Liu, Ji
N1 - Publisher Copyright:
© 2022 American Automatic Control Council.
PY - 2022
Y1 - 2022
N2 - This paper considers a resilient high-dimensional constrained consensus problem and studies a resilient distributed algorithm for complete graphs. For convex constrained sets with a singleton intersection, a sufficient condition on feasibility redundancy and set regularity for reaching a desired consensus exponentially fast in the presence of Byzantine agents is derived, which can be directly applied to polyhedral sets. A necessary condition on feasibility redundancy for the resilient constrained consensus problem to be solvable is also provided.
AB - This paper considers a resilient high-dimensional constrained consensus problem and studies a resilient distributed algorithm for complete graphs. For convex constrained sets with a singleton intersection, a sufficient condition on feasibility redundancy and set regularity for reaching a desired consensus exponentially fast in the presence of Byzantine agents is derived, which can be directly applied to polyhedral sets. A necessary condition on feasibility redundancy for the resilient constrained consensus problem to be solvable is also provided.
UR - https://www.scopus.com/pages/publications/85138495944
U2 - 10.23919/ACC53348.2022.9867522
DO - 10.23919/ACC53348.2022.9867522
M3 - Conference contribution
AN - SCOPUS:85138495944
T3 - Proceedings of the American Control Conference
SP - 3418
EP - 3422
BT - 2022 American Control Conference, ACC 2022
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2022 American Control Conference, ACC 2022
Y2 - 8 June 2022 through 10 June 2022
ER -