Key points are not available for this paper at this time.
This brief addresses resiliency of continuous-time linear multi-agent systems with malicious nodes. All normal nodes are guaranteed to achieve resilient consensus by the proposed resilient algorithm such that they all converge to a safety interval related to the initial states of normal nodes regardless a certain number of adversaries. Different graph conditions are provided to tolerant f -total as well as f -local type of malicious nodes respectively. Simulations on practical aircraft systems demonstrate the efficacy of our strategy.
Bai et al. (Tue,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: