Published December 2006
| Published
Book Section - Chapter
Open
On the robustness of distributed algorithms
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.
Additional Information
© 2006 IEEE. Research supported in part by the AFOSR grant F49620-01-1-0460 and in part by NSF grant CCR-0326554.Attached Files
Published - 04177463.pdf
Files
04177463.pdf
Files
(166.7 kB)
Name | Size | Download all |
---|---|---|
md5:180e8e508b4ea259f116c5c0a915e7bc
|
166.7 kB | Preview Download |
Additional details
- Eprint ID
- 77507
- Resolver ID
- CaltechAUTHORS:20170516-160431062
- F49620-01-1-0460
- Air Force Office of Scientific Research (AFOSR)
- CCR-0326554
- NSF
- Created
-
2017-05-16Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field