...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Automatic Control >Average Consensus in the Presence of Delays in Directed Graph Topologies
【24h】

Average Consensus in the Presence of Delays in Directed Graph Topologies

机译：有向图拓扑中存在延迟的平均共识

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Classical distributed algorithms for asymptotic average consensus typically assume timely and reliable exchange of information between neighboring components of a given multi-component system. These assumptions are not necessarily valid in practice due to varying delays that might affect computations at different nodes and/or transmissions at different links. In this work, we propose a protocol that overcomes this limitation and, unlike existing consensus protocols in the presence of delays, ensures asymptotic consensus to the exact average, despite the presence of arbitrary (but bounded) delays in the communication links. The protocol requires that each component has knowledge of the number of its out-neighbors (i.e., the number of components to which it can send information) and its proof of correctness relies on the weak convergence of a backward product of column stochastic matrices. The proposed algorithm is demonstrated via illustrative examples.
机译：用于渐进平均共识的经典分布式算法通常假定给定多组件系统的相邻组件之间及时可靠地交换信息。由于变化的延迟可能影响不同节点上的计算和/或不同链路上的传输，因此这些假设在实践中不一定有效。在这项工作中，我们提出了一种可以克服此限制的协议，并且与现有的存在延迟的共识协议不同，即使通信链路中存在任意（但有界）延迟，也可以确保将渐近共识精确到平均水平。该协议要求每个组件都知道其邻居的数量（即可以向其发送信息的组件的数量），并且其正确性的证明依赖于列随机矩阵的反向乘积的弱收敛。通过示例说明了所提出的算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号