Consensus-reaching of Multiple Robots with Fewer Interactions

摘要

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.