Fully Asynchronous Push-Sum With Growing Intercommunication Intervals
classification
🧮 math.OC
keywords
asynchronousaveragefullygrowingalgorithmallowingcommunicationcommunications
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.