This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Consensus-reaching of Multiple Robots with Fewer Interactions
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
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:
Xiaojun Geng, "Consensus-reaching of Multiple Robots with Fewer Interactions," csie, vol. 5, pp.249-253, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.