DocumentCode
495211
Title
Consensus-reaching of Multiple Robots with Fewer Interactions
Author
Geng, Xiaojun
Author_Institution
Dept. of Electr. & Comput. Eng., California State Univ., Northridge, CA, USA
Volume
5
fYear
2009
fDate
March 31 2009-April 2 2009
Firstpage
249
Lastpage
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.
Keywords
distributed algorithms; graph theory; mobile robots; multi-robot systems; algebraic graph theory; consensus algorithms; edge reduction scheme; multiple robots consensus-reaching; Computer networks; Computer science; Distributed algorithms; Graph theory; Multirobot systems; Orbital robotics; Power system modeling; Robot kinematics; Tree graphs; Vehicles; Consensus; Directed Graphs; Graph Reduction; Multi-agent Systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Engineering, 2009 WRI World Congress on
Conference_Location
Los Angeles, CA
Print_ISBN
978-0-7695-3507-4
Type
conf
DOI
10.1109/CSIE.2009.858
Filename
5170535
Link To Document