This paper considers the bidirectional interaction between states and communication network in a multi-robot system. It proposes two alternative games that are extremes of each other for network formation. In pairwise games, each robot decides to establish or break off a link based on the improvement this offers to it individually. In turn, its state evolves based on state information received from its immediate neighbors only. In coalition games, all the robots in each coalition decide collectively and new links are added or removed based on the improvement they offer to the respective coalition. This time, the state of each robot evolves based on state information from all the other robots in its coalition, albeit with delays that depend on their geodesic proximity. Simulation results provide insights on comparative performance with respect to task completion and connectivity under varying move periods.
|Original language||English (US)|
|Title of host publication||Proceedings of the 18th IFAC World Congress|
|Number of pages||6|
|Edition||1 PART 1|
|State||Published - 2011|
|Name||IFAC Proceedings Volumes (IFAC-PapersOnline)|
|Number||1 PART 1|
Bibliographical noteFunding Information:
This work has been supported by Bogazici University BAP Project 5169 and Tubitak Project MAG 107M240.
- Decentralized decision-making
- Dynamic communication networks
- Game theory
- Multi-robot navigation
- Networked robotic systems