On the robustness of distributed algorithms

Vijay Gupta, Cedric Langbort, Richard M. Murray

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 45th IEEE Conference on Decision and Control 2006, CDC
Pages3473-3478
Number of pages6
StatePublished - Dec 1 2006
Event45th IEEE Conference on Decision and Control 2006, CDC - San Diego, CA, United States
Duration: Dec 13 2006Dec 15 2006

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0191-2216

Other

Other45th IEEE Conference on Decision and Control 2006, CDC
CountryUnited States
CitySan Diego, CA
Period12/13/0612/15/06

    Fingerprint

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this

Gupta, V., Langbort, C., & Murray, R. M. (2006). On the robustness of distributed algorithms. In Proceedings of the 45th IEEE Conference on Decision and Control 2006, CDC (pp. 3473-3478). [4177463] (Proceedings of the IEEE Conference on Decision and Control).