Robust multi-robot team formations using weighted voting games

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

We consider the problem of distributed multi-robot team formation including the dynamic reconfiguration of robot teams after encountering obstacles. We describe a distributed robot team reconfiguration algorithm, DYN-REFORM, that uses a game-theoretic technique of team formation called weighted voting games(WVGs) along with a flocking-based formation control mechanism. DYNREFORM works without explicit knowledge of global features such as the presence of obstacles in the environment or the number and location of all other robots in the system. It uses the locally computed metrics of each robot in the team to determine whether a team needs to split or two teams need to merge during reconfiguration. We have tested team reconfiguration using the DYN-REFORM algorithm experimentally within the Webots simulator using teams of e-puck robots of different sizes and with different obstacle geometries. We have also shown that using robots coordinated with the DYN-REFORM algorithm for a distributed area-coverage application improves the coverage performance.

Original languageEnglish (US)
Title of host publicationDistributed Autonomous Robotic Systems - The 10th International Symposium, DARS 2010
Pages373-387
Number of pages15
DOIs
StatePublished - Dec 13 2012
Event10th International Symposium on Distributed Autonomous Robotic Systems, DARS 2010 - Lausanne, Switzerland
Duration: Nov 1 2010Nov 3 2010

Publication series

NameSpringer Tracts in Advanced Robotics
Volume83 STAR
ISSN (Print)1610-7438
ISSN (Electronic)1610-742X

Conference

Conference10th International Symposium on Distributed Autonomous Robotic Systems, DARS 2010
CountrySwitzerland
CityLausanne
Period11/1/1011/3/10

Fingerprint

Robots
Simulators
Geometry

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Artificial Intelligence

Cite this

Dasgupta, P., & Cheng, K. (2012). Robust multi-robot team formations using weighted voting games. In Distributed Autonomous Robotic Systems - The 10th International Symposium, DARS 2010 (pp. 373-387). (Springer Tracts in Advanced Robotics; Vol. 83 STAR). https://doi.org/10.1007/978-3-642-32723-0_27

Robust multi-robot team formations using weighted voting games. / Dasgupta, Prithviraj; Cheng, Ke.

Distributed Autonomous Robotic Systems - The 10th International Symposium, DARS 2010. 2012. p. 373-387 (Springer Tracts in Advanced Robotics; Vol. 83 STAR).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dasgupta, P & Cheng, K 2012, Robust multi-robot team formations using weighted voting games. in Distributed Autonomous Robotic Systems - The 10th International Symposium, DARS 2010. Springer Tracts in Advanced Robotics, vol. 83 STAR, pp. 373-387, 10th International Symposium on Distributed Autonomous Robotic Systems, DARS 2010, Lausanne, Switzerland, 11/1/10. https://doi.org/10.1007/978-3-642-32723-0_27
Dasgupta P, Cheng K. Robust multi-robot team formations using weighted voting games. In Distributed Autonomous Robotic Systems - The 10th International Symposium, DARS 2010. 2012. p. 373-387. (Springer Tracts in Advanced Robotics). https://doi.org/10.1007/978-3-642-32723-0_27
Dasgupta, Prithviraj ; Cheng, Ke. / Robust multi-robot team formations using weighted voting games. Distributed Autonomous Robotic Systems - The 10th International Symposium, DARS 2010. 2012. pp. 373-387 (Springer Tracts in Advanced Robotics).
@inproceedings{ebaf3ab2d4f14d97ac298c74c63a50f7,
title = "Robust multi-robot team formations using weighted voting games",
abstract = "We consider the problem of distributed multi-robot team formation including the dynamic reconfiguration of robot teams after encountering obstacles. We describe a distributed robot team reconfiguration algorithm, DYN-REFORM, that uses a game-theoretic technique of team formation called weighted voting games(WVGs) along with a flocking-based formation control mechanism. DYNREFORM works without explicit knowledge of global features such as the presence of obstacles in the environment or the number and location of all other robots in the system. It uses the locally computed metrics of each robot in the team to determine whether a team needs to split or two teams need to merge during reconfiguration. We have tested team reconfiguration using the DYN-REFORM algorithm experimentally within the Webots simulator using teams of e-puck robots of different sizes and with different obstacle geometries. We have also shown that using robots coordinated with the DYN-REFORM algorithm for a distributed area-coverage application improves the coverage performance.",
author = "Prithviraj Dasgupta and Ke Cheng",
year = "2012",
month = "12",
day = "13",
doi = "10.1007/978-3-642-32723-0_27",
language = "English (US)",
isbn = "9783642327223",
series = "Springer Tracts in Advanced Robotics",
pages = "373--387",
booktitle = "Distributed Autonomous Robotic Systems - The 10th International Symposium, DARS 2010",

}

TY - GEN

T1 - Robust multi-robot team formations using weighted voting games

AU - Dasgupta, Prithviraj

AU - Cheng, Ke

PY - 2012/12/13

Y1 - 2012/12/13

N2 - We consider the problem of distributed multi-robot team formation including the dynamic reconfiguration of robot teams after encountering obstacles. We describe a distributed robot team reconfiguration algorithm, DYN-REFORM, that uses a game-theoretic technique of team formation called weighted voting games(WVGs) along with a flocking-based formation control mechanism. DYNREFORM works without explicit knowledge of global features such as the presence of obstacles in the environment or the number and location of all other robots in the system. It uses the locally computed metrics of each robot in the team to determine whether a team needs to split or two teams need to merge during reconfiguration. We have tested team reconfiguration using the DYN-REFORM algorithm experimentally within the Webots simulator using teams of e-puck robots of different sizes and with different obstacle geometries. We have also shown that using robots coordinated with the DYN-REFORM algorithm for a distributed area-coverage application improves the coverage performance.

AB - We consider the problem of distributed multi-robot team formation including the dynamic reconfiguration of robot teams after encountering obstacles. We describe a distributed robot team reconfiguration algorithm, DYN-REFORM, that uses a game-theoretic technique of team formation called weighted voting games(WVGs) along with a flocking-based formation control mechanism. DYNREFORM works without explicit knowledge of global features such as the presence of obstacles in the environment or the number and location of all other robots in the system. It uses the locally computed metrics of each robot in the team to determine whether a team needs to split or two teams need to merge during reconfiguration. We have tested team reconfiguration using the DYN-REFORM algorithm experimentally within the Webots simulator using teams of e-puck robots of different sizes and with different obstacle geometries. We have also shown that using robots coordinated with the DYN-REFORM algorithm for a distributed area-coverage application improves the coverage performance.

UR - http://www.scopus.com/inward/record.url?scp=84870751492&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84870751492&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-32723-0_27

DO - 10.1007/978-3-642-32723-0_27

M3 - Conference contribution

SN - 9783642327223

T3 - Springer Tracts in Advanced Robotics

SP - 373

EP - 387

BT - Distributed Autonomous Robotic Systems - The 10th International Symposium, DARS 2010

ER -