Fully Asynchronous Push-Sum With Growing Intercommunication Intervals

Alex Olshevsky,Ioannis Ch. Paschalidis,Artin Spiridonoff

2018 ANNUAL AMERICAN CONTROL CONFERENCE (ACC)（2018）

引用 5|浏览13

暂无评分

摘要

We propose an algorithm for average consensus over a directed graph which is both fully asynchronous and robust to unreliable communications. We show its convergence to the average while allowing for slowly growing but potentially unbounded communication failures.

查看译文

关键词

asynchronous push-sum,intercommunication intervals,average consensus,directed graph,unbounded communication failures

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要