5 papers
Adversarial Resilience for Sampled-Data Systems under High-Relative-Degree Safety Constraints
James Usevitch, Dimitra Panagou
Control barrier functions (CBFs) have recently become a powerful method for rendering desired safe sets forward invariant in single- and multi-agent systems. In the multi-agent cas…
Resilient Finite Time Consensus: A Discontinuous Systems Perspective
James Usevitch, Dimitra Panagou
Many algorithms have been proposed in prior literature to guarantee resilient multi-agent consensus in the presence of adversarial attacks or faults. The majority of prior work pre…
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…
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…
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…