Robustness of the Adaptive Bellman –Ford Algorithm: Global Stability and Ultimate Bounds

DOI10.1109/TAC.2019.2904239zbMath1482.93539OpenAlexW2920846036WikidataQ128240997 ScholiaQ128240997MaRDI QIDQ5211163

Yuanqiu Mo, Jacob Beal, Soura Dasgupta

Publication date: 28 January 2020

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2019.2904239

Mathematics Subject Classification ID

Lyapunov and storage functions (93D30) Distributed algorithms (68W15)

Related Items (3)

Unnamed Item ⋮ A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm ⋮ Near-optimal knowledge-free resilient leader election

This page was built for publication: Robustness of the Adaptive Bellman –Ford Algorithm: Global Stability and Ultimate Bounds