Construction of Optimal Control Graphs in Multi-robot Systems

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


Control graphs are used in multi-robot systems to maintain information about which robot senses another robot, and at what position. Control graphs allow robots to localize relative to others, and maintain stable formations. Previous work makes two critical assumptions. First, it assumes edge weights of control graphs are deterministic scalars, while in reality they represent complex stochastic factors. Second, it assumes that a single robot is pre-determined to serve as the global anchor for the robots’ relative estimates. However, optimal selection of this robot is an open problem. In this work, we address these two issues. We show that existing work may be recast as graph-theoretic algorithms inducing control graphs for more general representation of the sensing capabilities of robots. We then formulate the problem of optimal selection of an anchor, and present a centralized algorithm for solving it. We evaluate use of these algorithm on physical and simulated robots and show they very significantly improve on existing work.

Original languageEnglish
Title of host publicationSpringer Proceedings in Advanced Robotics
Number of pages13
StatePublished - 2018

Publication series

NameSpringer Proceedings in Advanced Robotics

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Electrical and Electronic Engineering
  • Mechanical Engineering
  • Engineering (miscellaneous)
  • Artificial Intelligence
  • Computer Science Applications
  • Applied Mathematics


Dive into the research topics of 'Construction of Optimal Control Graphs in Multi-robot Systems'. Together they form a unique fingerprint.

Cite this