2019/06/19 by James Usevitch, Dimitra Panagou, Usevitch, James +1 · 3 citations
Computer Science · 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) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.1906.09096
openalex publication_date 2019/06/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Several algorithms in prior literature have been proposed which guarantee\nconsensus of normally behaving agents in a network that may contain\nadversarially behaving agents. These algorithms guarantee that the consensus\nvalue lies within the convex hull of initial normal agents' states, with the\nexact consensus value possibly being unknown. In leader-follower consensus\nproblems however, the objective is for normally behaving agents to track a\nreference state that may take on values outside of this convex hull. In this\npaper we present methods for agents in time-varying graphs with discrete-time\ndynamics to resiliently track a reference state propagated by a set of leaders\ndespite a bounded subset of the leaders and followers behaving adversarially.\nOur results are demonstrated through simulations.\n