The Community for Technology Leaders
Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
ISBN: 978-0-7695-3507-4
pp: 249-253
ABSTRACT
Consensus algorithms have been studied with the aid of algebraic graph theory. This paper studies the effect of an edge reduction scheme on consensus behavior of multi-robot systems. With this edge reduction scheme, robots in the network can reach a consensus on certain coordination variables with fewer interactions and less computational effort.
INDEX TERMS
Consensus, Multi-agent Systems, Graph Reduction, Directed Graphs
CITATION

X. Geng, "Consensus-reaching of Multiple Robots with Fewer Interactions," 2009 WRI World Congress on Computer Science and Information Engineering, CSIE(CSIE), Los Angeles, CA, 2009, pp. 249-253.
doi:10.1109/CSIE.2009.858
114 ms
(Ver 3.3 (11022016))