2 citations · 2 across the 7 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
eess.SY2019
Resilient Leader-Follower Consensus to Arbitrary Reference Values in Time-Varying Graphs
James Usevitch, Dimitra Panagou
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 a…
eess.SY2019
Resilient Leader-Follower Consensus with Time-Varying Leaders in Discrete-Time Systems
James Usevitch, Dimitra Panagou
The problem of consensus in the presence of adversarially behaving agents has been studied extensively in the literature. The proposed algorithms typically guarantee that the conse…
cs.MA2019
Determining r- and (r,s)-Robustness of Digraphs Using Mixed Integer Linear Programming
James Usevitch, Dimitra Panagou
There has been an increase in the use of resilient control algorithms based on the graph theoretic properties of - and -robustness. These algorithms guarantee consensus o…