Browse wiki
From MurrayWiki
Multi-Hop Relay Protocols for Fast Consensus Seeking |
Abstract |
Consensus protocols in coordinated multi-a … Consensus protocols in coordinated multi-agent systems are
distributed algorithms. Just using local information
available to each single agent, all agents converge to an
identical consensus state and the convergence speed is
determined by the algebraic connectivity of the
communication network. In order to achieve a faster
consensus seeking, we propose multi-hop relay protocols
based on the current ``nearest neighbor rules'' consensus
protocols. By employing multiple-hop paths in the network,
more information is passed around and each agent enlarges
its "available" neighborhood. We demonstrate that these
relay protocols can increase the algebraic connectivity
without physically adding or changing any communication
links. Moreover, time delay sensitivity of relay protocols
are discussed in detail. We point out that a trade off
exists between convergence performance and time delay
robustness. Simulation results are also provided to verify
the efficiency of relay protocols. verify
the efficiency of relay protocols. +
|
---|---|
Authors | Zhipu Jin, Richard M. Murray + |
ID | 2006d + |
Source | Submitted, 2006 Conference on Decision and Control + |
Tag | jm06-cdc + |
Title | Multi-Hop Relay Protocols for Fast Consensus Seeking + |
Type | Conference Paper + |
Categories | Papers |
Modification date This property is a special property in this wiki.
|
15 May 2016 06:17:41 + |
URL This property is a special property in this wiki.
|
http://www.cds.caltech.edu/~murray/preprints/jm06-cdc.pdf + |
hide properties that link here |
Multi-Hop Relay Protocols for Fast Consensus Seeking + | Title |
---|