Presents methods for resilient leader-follower consensus to arbitrary reference values in time-varying graphs with discrete-time dynamics despite bounded adversarial agents.
Determining r-and (r, s)-robustness of digraphs using mixed integer linear programming,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Resilient Leader-Follower Consensus to Arbitrary Reference Values in Time-Varying Graphs
Presents methods for resilient leader-follower consensus to arbitrary reference values in time-varying graphs with discrete-time dynamics despite bounded adversarial agents.