Dynamic multi-robot team reconfiguration using weighted voting games

摘要

We consider the problem of dynamic reconfiguration of robot teams when they encounter obstacles while navigating in formation, in an initially unknown environment. We have used a framework from coalition game theory called weighted voting games to analyse this problem and proposed two heuristics that can appropriately partition a robot team into sub-teams. We have experimentally verified our technique on teams of e-puck robots of different sizes and with different obstacle geometries, both on the Webots simulator and on physical robots. We have also shown that our technique performs faster and generates considerably fewer partitions than an existing robot coalition formation algorithm.