Determining r-Robustness of Digraphs Using Mixed Integer Linear Programming.

Abstract

Convergence guarantees of many resilient consensus algorithms are based on the graph theoretic properties of rand (r, s)-robustness. These algorithms guarantee consensus of normally behaving agents in the presence of a bounded number of arbitrarily misbehaving agents if the values of the integers $r$ and $s$ are sufficiently high. However, determining the largest integer $r$ for which an arbitrary digraph is r-robust is highly nontrivial. This paper introduces a novel method for calculating this value using mixed integer linear programming. The method only requires knowledge of the graph Laplacian matrix, and can be formulated with affine objective and constraints, except for the integer constraint. Integer programming methods such as branch-and-bound can allow both lower and upper bounds on $r$ to be iteratively tightened. Simulations suggest the proposed method demonstrates greater efficiency than prior algorithms.

Bib

@inproceedings{DBLP:conf/amcc/UsevitchP19,
  author       = {James Usevitch and
                  Dimitra Panagou},
  title        = {Determining r-Robustness of Digraphs Using Mixed Integer Linear Programming},
  booktitle    = {2019 American Control Conference, {ACC} 2019, Philadelphia, PA, USA,
                  July 10-12, 2019},
  pages        = {2257--2263},
  publisher    = {{IEEE}},
  year         = {2019},
  url          = {https://doi.org/10.23919/ACC.2019.8814405},
  doi          = {10.23919/ACC.2019.8814405},
  timestamp    = {Sun, 08 Aug 2021 01:40:57 +0200},
  biburl       = {https://dblp.org/rec/conf/amcc/UsevitchP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}