Resilient Leader-Follower Consensus to Arbitrary Reference Values in Time-Varying Graphs.

Abstract

Several algorithms in prior literature have been proposed, which guarantee the consensus of normally behaving agents in a network that may contain adversarially behaving agents. These algorithms guarantee that the consensus value lies within the convex hull of initial normal agents’ states, with the exact consensus value possibly being unknown. In leader-follower consensus problems, however, the objective is for normally behaving agents to track a reference state that may take on values outside of this convex hull. In this paper, we present methods for agents in time-varying graphs with discrete-time dynamics to resiliently track a reference state propagated by a set of leaders, despite a bounded subset of the leaders and followers behaving adversarially. Our results are demonstrated through simulations.

Bib

@article{DBLP:journals/tac/UsevitchP20,
  author       = {James Usevitch and
                  Dimitra Panagou},
  title        = {Resilient Leader-Follower Consensus to Arbitrary Reference Values
                  in Time-Varying Graphs},
  journal      = {{IEEE} Trans. Autom. Control.},
  volume       = {65},
  number       = {4},
  pages        = {1755--1762},
  year         = {2020},
  url          = {https://doi.org/10.1109/TAC.2019.2934954},
  doi          = {10.1109/TAC.2019.2934954},
  timestamp    = {Tue, 30 Jun 2020 11:42:39 +0200},
  biburl       = {https://dblp.org/rec/journals/tac/UsevitchP20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}