2019/06/19 by James Usevitch, Dimitra Panagou, Usevitch, James +1 · 5 citations
Computer Science · Engineering · Physics and Astronomy · #Complex Network Analysis Techniques #Distributed Control Multi-Agent Systems #FOS: Electrical engineering #Opportunistic and Delay-Tolerant Networks #Systems and Control (eess.SY) #cs.SY #eess.SY #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.1906.09096
arXiv admin note: text overlap with arXiv:1906.08254
arxiv created 2019/06/19 · openalex publication_date 2019/06/19 · arxiv updated 2019/06/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Several algorithms in prior literature have been proposed which guarantee 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.