.png){kind=icon}
返回
Resilient multi-dimensional consensus in adversarial environment
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2022.110530.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers the multi-dimensional consensus in networked systems, where some of the agents might be misbehaving (or faulty). Despite the influence of these misbehaviors, the benign agents aim to reach an agreement while avoiding being seriously influenced by the faulty ones. To this end, this paper first considers a general class of consensus algorithms, where each benign agent computes an auxiliary point based on the received values and moves its state towards this point. Concerning this generic form, we present conditions for achieving resilient consensus and obtain a lower bound on the exponential convergence rate. Assuming that the number of malicious agents is upper bounded, two specific resilient consensus algorithms are further developed based on the obtained conditions. Particularly, the first solution, based on Helly's Theorem, achieves the consensus within the convex hull formed by the benign agents' initial states, where the auxiliary point can be efficiently computed through linear programming. On the other hand, the second algorithm serves as a built-in security guarantee for standard average consensus algorithms, in the sense that its performance coincides exactly with that of the standard ones in the absence of faulty nodes while also resisting the serious influence of the misbehaving ones in adversarial environment. Some numerical examples are provided in the end to verify the theoretical results. (C) 2022 Elsevier Ltd. All rights reserved.
Keyword:
Resilient algorithms
Robust graphs
Multi-dimensional systems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Changes of bone mineral density after cementless total hip arthroplasty with two different stemsOAAI
OAAI分享收藏Multistep interactive convergence: An efficient approach to the fault-tolerant clock synchronization of large multicomputers多步交互式收敛: 大型多计算机容错时钟同步的有效方法
PREAI
分享收藏
查看更多内容