A Caltech Library Service

On the robustness of distributed algorithms

Gupta, Vijay and Langbort, Cedric and Murray, Richard M. (2006) On the robustness of distributed algorithms. In: Proceedings of the 45th IEEE Conference on Decision and Control. IEEE , Piscataway, NJ, pp. 3473-3478. ISBN 1-4244-0171-2.

[img] PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


In recent years, numerous distributed algorithms have been proposed which, when executed by a team of dynamic agents, result in the completion of a joint task. However, for any such algorithm to be practical, one should be able to guarantee that the task is still satisfactorily executed even when agents fail to communicate with others or to perform their designated actions correctly. In this paper, we present a concept of robustness which is well-suited for general distributed algorithms for teams of dynamic agents. Our definition extends a similar notion introduced in the distributed computation literature for consensus problems. We illustrate the definition by considering a variety of algorithms.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Murray, Richard M.0000-0002-5785-7481
Additional Information:© 2006 IEEE. Research supported in part by the AFOSR grant F49620-01-1-0460 and in part by NSF grant CCR-0326554.
Funding AgencyGrant Number
Air Force Office of Scientific Research (AFOSR)F49620-01-1-0460
Record Number:CaltechAUTHORS:20170516-160431062
Persistent URL:
Official Citation:V. Gupta, C. Langbort and R. M. Murray, "On the robustness of distributed algorithms," Proceedings of the 45th IEEE Conference on Decision and Control, San Diego, CA, 2006, pp. 3473-3478. doi: 10.1109/CDC.2006.377451
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:77507
Deposited By: Kristin Buxton
Deposited On:16 May 2017 23:21
Last Modified:03 Oct 2019 17:58

Repository Staff Only: item control page