Weighted voting game based multi-robot team formation for distributed area coverage

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

6 Citations (Scopus)

Abstract

In the multi-robot area coverage problem, a group of mobile robots have to cover an initially unknown environment using a sensor or coverage tool attached to each robot. Multi-robot area coverage is encountered in many applications of multirobot systems including unmanned search and rescue, aerial reconnaissance, robotic demining, automatic lawn mowing, and inspection of engineering structures. We envisage that multi-robot coverage can be performed efficiently if robots are coordinated to form small teams while covering the environment. In this paper, we use a technique from coalitional game theory called a weighted voting game that allows each robot to dynamically identify other team members and form teams so that the efficiency of the area coverage operation is improved. We propose and evaluate a novel technique of computing the weights of a weighted voting game based on each robot's coverage capability and finding the best minimal winning coalition(BMWC). We theoretically prove the feasibility of our model, and give algorithms to find the BMWC as well. We have also evaluated the performance of our algorithms within a robot simulation platform using up to 40 robots.

Original languageEnglish (US)
Title of host publication3rd International Symposium on Practical Cognitive Agents and Robots, PCAR 2010 - Proceedings of an AAMAS 2010 Workshop
Pages9-15
Number of pages7
DOIs
StatePublished - Dec 1 2010
Event3rd International Symposium on Practical Cognitive Agents and Robots, PCAR 2010 - Toronto, ON, Canada
Duration: May 10 2010May 10 2010

Publication series

NameACM International Conference Proceeding Series

Conference

Conference3rd International Symposium on Practical Cognitive Agents and Robots, PCAR 2010
CountryCanada
CityToronto, ON
Period5/10/105/10/10

Fingerprint

Robots
Game theory
Mobile robots
Robotics
Inspection
Antennas
Sensors

Keywords

  • Area coverage
  • Weighted voting games
  • Winning coalitions

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications

Cite this

Cheng, K., & Dasgupta, P. (2010). Weighted voting game based multi-robot team formation for distributed area coverage. In 3rd International Symposium on Practical Cognitive Agents and Robots, PCAR 2010 - Proceedings of an AAMAS 2010 Workshop (pp. 9-15). (ACM International Conference Proceeding Series). https://doi.org/10.1145/1967112.1967114

Weighted voting game based multi-robot team formation for distributed area coverage. / Cheng, Ke; Dasgupta, Prithviraj.

3rd International Symposium on Practical Cognitive Agents and Robots, PCAR 2010 - Proceedings of an AAMAS 2010 Workshop. 2010. p. 9-15 (ACM International Conference Proceeding Series).

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

Cheng, K & Dasgupta, P 2010, Weighted voting game based multi-robot team formation for distributed area coverage. in 3rd International Symposium on Practical Cognitive Agents and Robots, PCAR 2010 - Proceedings of an AAMAS 2010 Workshop. ACM International Conference Proceeding Series, pp. 9-15, 3rd International Symposium on Practical Cognitive Agents and Robots, PCAR 2010, Toronto, ON, Canada, 5/10/10. https://doi.org/10.1145/1967112.1967114
Cheng K, Dasgupta P. Weighted voting game based multi-robot team formation for distributed area coverage. In 3rd International Symposium on Practical Cognitive Agents and Robots, PCAR 2010 - Proceedings of an AAMAS 2010 Workshop. 2010. p. 9-15. (ACM International Conference Proceeding Series). https://doi.org/10.1145/1967112.1967114
Cheng, Ke ; Dasgupta, Prithviraj. / Weighted voting game based multi-robot team formation for distributed area coverage. 3rd International Symposium on Practical Cognitive Agents and Robots, PCAR 2010 - Proceedings of an AAMAS 2010 Workshop. 2010. pp. 9-15 (ACM International Conference Proceeding Series).
@inproceedings{48e12dfa287b4cb19732d66132dab4a9,
title = "Weighted voting game based multi-robot team formation for distributed area coverage",
abstract = "In the multi-robot area coverage problem, a group of mobile robots have to cover an initially unknown environment using a sensor or coverage tool attached to each robot. Multi-robot area coverage is encountered in many applications of multirobot systems including unmanned search and rescue, aerial reconnaissance, robotic demining, automatic lawn mowing, and inspection of engineering structures. We envisage that multi-robot coverage can be performed efficiently if robots are coordinated to form small teams while covering the environment. In this paper, we use a technique from coalitional game theory called a weighted voting game that allows each robot to dynamically identify other team members and form teams so that the efficiency of the area coverage operation is improved. We propose and evaluate a novel technique of computing the weights of a weighted voting game based on each robot's coverage capability and finding the best minimal winning coalition(BMWC). We theoretically prove the feasibility of our model, and give algorithms to find the BMWC as well. We have also evaluated the performance of our algorithms within a robot simulation platform using up to 40 robots.",
keywords = "Area coverage, Weighted voting games, Winning coalitions",
author = "Ke Cheng and Prithviraj Dasgupta",
year = "2010",
month = "12",
day = "1",
doi = "10.1145/1967112.1967114",
language = "English (US)",
isbn = "9781450302500",
series = "ACM International Conference Proceeding Series",
pages = "9--15",
booktitle = "3rd International Symposium on Practical Cognitive Agents and Robots, PCAR 2010 - Proceedings of an AAMAS 2010 Workshop",

}

TY - GEN

T1 - Weighted voting game based multi-robot team formation for distributed area coverage

AU - Cheng, Ke

AU - Dasgupta, Prithviraj

PY - 2010/12/1

Y1 - 2010/12/1

N2 - In the multi-robot area coverage problem, a group of mobile robots have to cover an initially unknown environment using a sensor or coverage tool attached to each robot. Multi-robot area coverage is encountered in many applications of multirobot systems including unmanned search and rescue, aerial reconnaissance, robotic demining, automatic lawn mowing, and inspection of engineering structures. We envisage that multi-robot coverage can be performed efficiently if robots are coordinated to form small teams while covering the environment. In this paper, we use a technique from coalitional game theory called a weighted voting game that allows each robot to dynamically identify other team members and form teams so that the efficiency of the area coverage operation is improved. We propose and evaluate a novel technique of computing the weights of a weighted voting game based on each robot's coverage capability and finding the best minimal winning coalition(BMWC). We theoretically prove the feasibility of our model, and give algorithms to find the BMWC as well. We have also evaluated the performance of our algorithms within a robot simulation platform using up to 40 robots.

AB - In the multi-robot area coverage problem, a group of mobile robots have to cover an initially unknown environment using a sensor or coverage tool attached to each robot. Multi-robot area coverage is encountered in many applications of multirobot systems including unmanned search and rescue, aerial reconnaissance, robotic demining, automatic lawn mowing, and inspection of engineering structures. We envisage that multi-robot coverage can be performed efficiently if robots are coordinated to form small teams while covering the environment. In this paper, we use a technique from coalitional game theory called a weighted voting game that allows each robot to dynamically identify other team members and form teams so that the efficiency of the area coverage operation is improved. We propose and evaluate a novel technique of computing the weights of a weighted voting game based on each robot's coverage capability and finding the best minimal winning coalition(BMWC). We theoretically prove the feasibility of our model, and give algorithms to find the BMWC as well. We have also evaluated the performance of our algorithms within a robot simulation platform using up to 40 robots.

KW - Area coverage

KW - Weighted voting games

KW - Winning coalitions

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

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

U2 - 10.1145/1967112.1967114

DO - 10.1145/1967112.1967114

M3 - Conference contribution

SN - 9781450302500

T3 - ACM International Conference Proceeding Series

SP - 9

EP - 15

BT - 3rd International Symposium on Practical Cognitive Agents and Robots, PCAR 2010 - Proceedings of an AAMAS 2010 Workshop

ER -