Resilient consensus through event-based communication
Resilient consensus through event-based communication
复制标题
通过基于事件的沟通达成弹性共识
DOI：
10.1109/tcns.2019.2924235
复制
发表时间：
2020
影响因子：
4.2
通讯作者：
Hideaki Ishii
中科院分区：
文献类型：
--
作者：
Yuan Wang;Hideaki Ishii
我们考虑了在网络中存在错误甚至恶意代理的情况下，离散时间多代理一致性的弹性版本。特别地，我们开发了事件触发的更新规则，可以减轻恶意代理的影响，同时减少通信。每个常规代理使用其邻居的信息基于给定的规则来更新其状态。只有当触发条件满足时，规则代理才将其当前状态发送给邻居。否则，邻居将继续使用上次接收到的状态。在已知恶意节点数目的条件下，提出了两种基于事件触发通信的更新规则.它们遵循所谓的平均子序列精简型算法，并忽略从潜在恶意邻居接收的值。为了使算法正确执行，我们描述了网络中必要的连通性，这是根据图鲁棒性的概念来描述的。 数值算例验证了该方法的有效性.
We consider resilient versions of discrete-time multiagent consensus in the presence of faulty or even malicious agents in the network. In particular, we develop event-triggered update rules that can mitigate the influence of the malicious agents and, at the same time, reduce the communication. Each regular agent updates its state based on a given rule using its neighbors' information. Only when the triggering condition is satisfied, the regular agents send their current states to their neighbors. Otherwise, the neighbors will continue to use the state received the last time. Assuming that a bound on the number of malicious nodes is known, we propose two update rules with event-triggered communication. They follow the so-called mean subsequence reduced-type algorithms and ignore values received from potentially malicious neighbors. We characterize the necessary connectivity in the network for the algorithms to perform correctly, which are stated in terms of the notion of graph robustness. A numerical example is provided to demonstrate the effectiveness of the proposed approach.