Resilient Leader-Follower Consensus to Arbitrary Reference Values.

Abstract

The problem of consensus in the presence of misbehaving agents has increasingly attracted attention in the literature. Prior results have established algorithms and graph structures for multi-agent networks which guarantee the consensus of normally behaving agents in the presence of a bounded number of misbehaving agents. The final consensus value is guaranteed to fall within the convex hull of initial agent states. However, the problem of consensus tracking considers consensus to arbitrary reference values which may not lie within such bounds. Conditions for consensus tracking in the presence of misbehaving agents has not been fully studied. This paper presents conditions for a network of agents using the W-MSR algorithm to achieve this objective.

Bib

@inproceedings{DBLP:conf/amcc/UsevitchP18,
  author       = {James Usevitch and
                  Dimitra Panagou},
  title        = {Resilient Leader-Follower Consensus to Arbitrary Reference Values},
  booktitle    = {2018 Annual American Control Conference, {ACC} 2018, Milwaukee, WI,
                  USA, June 27-29, 2018},
  pages        = {1292--1298},
  publisher    = {{IEEE}},
  year         = {2018},
  url          = {https://doi.org/10.23919/ACC.2018.8431573},
  doi          = {10.23919/ACC.2018.8431573},
  timestamp    = {Sun, 08 Aug 2021 01:40:57 +0200},
  biburl       = {https://dblp.org/rec/conf/amcc/UsevitchP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}