Browse wiki
From MurrayWiki
When are Distributed Algorithms Robust? |
Abstract |
In recent years, numerous distributed algo … 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. on by considering a variety of algorithms. +
|
---|---|
Authors | Vijay Gupta, Cedric Langbort, Richard M. Murray + |
ID | 2006f + |
Source | To appear, 2006 Conference on Decision and Control (CDC) + |
Tag | glm06-cdc + |
Title | When are Distributed Algorithms Robust? + |
Type | Conference Paper + |
Categories | Papers |
Modification date This property is a special property in this wiki.
|
15 May 2016 06:17:39 + |
URL This property is a special property in this wiki.
|
http://www.cds.caltech.edu/~murray/preprints/glm06-cdc.pdf + |
hide properties that link here |
When are Distributed Algorithms Robust? + | Title |
---|