Construction of Optimal Control Graphs in Multi-robot Systems

פרסום מחקרי: פרק בספר / בדוח / בכנספרקביקורת עמיתים

תקציר

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.

שפה מקוריתאנגלית
כותר פרסום המארחSpringer Proceedings in Advanced Robotics
עמודים163-175
מספר עמודים13
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 2018

סדרות פרסומים

שםSpringer Proceedings in Advanced Robotics
כרך6

ASJC Scopus subject areas

  • ???subjectarea.asjc.2200.2207???
  • ???subjectarea.asjc.2200.2208???
  • ???subjectarea.asjc.2200.2210???
  • ???subjectarea.asjc.2200.2201???
  • ???subjectarea.asjc.1700.1702???
  • ???subjectarea.asjc.1700.1706???
  • ???subjectarea.asjc.2600.2604???

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Construction of Optimal Control Graphs in Multi-robot Systems'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי