Multi-agent coalition formation for distributed area coverage

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

1 Citation (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 multi-robot 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). Also we designed a greedy method and a heuristic method to find BMWC in O(n log n) time and O(n 2) time respectively. We tested these two algorithm with our base line method.

Original languageEnglish (US)
Title of host publicationCollaborative Agents - Research and Development
Subtitle of host publicationInternational Workshops CARE@IAT10 2010, Revised Selected Papers
Pages1-13
Number of pages13
DOIs
StatePublished - Aug 1 2011
Event2nd International Workshop on Collaborative Agents - Research and Development, CARE 2010, Held in Conjunction with the 2010 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT10 - Toronto, ON, Canada
Duration: Aug 31 2010Aug 31 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6066 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Workshop on Collaborative Agents - Research and Development, CARE 2010, Held in Conjunction with the 2010 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT10
CountryCanada
CityToronto, ON
Period8/31/108/31/10

Fingerprint

Coalition Formation
Coverage
Robots
Multi-robot
Robot
Coalitions
Voting
Coalitional Games
Game
Multi-robot Systems
Heuristic Method
Game Theory
Mobile Robot
Heuristic methods
Inspection
Robotics
Baseline
Game theory
Covering
Cover

Keywords

  • Area Coverage
  • Weighted Voting Games
  • Winning Coalitions

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Cheng, K., & Dasgupta, P. (2011). Multi-agent coalition formation for distributed area coverage. In Collaborative Agents - Research and Development: International Workshops CARE@IAT10 2010, Revised Selected Papers (pp. 1-13). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6066 LNAI). https://doi.org/10.1007/978-3-642-22427-0_1

Multi-agent coalition formation for distributed area coverage. / Cheng, Ke; Dasgupta, Prithviraj.

Collaborative Agents - Research and Development: International Workshops CARE@IAT10 2010, Revised Selected Papers. 2011. p. 1-13 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6066 LNAI).

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

Cheng, K & Dasgupta, P 2011, Multi-agent coalition formation for distributed area coverage. in Collaborative Agents - Research and Development: International Workshops CARE@IAT10 2010, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6066 LNAI, pp. 1-13, 2nd International Workshop on Collaborative Agents - Research and Development, CARE 2010, Held in Conjunction with the 2010 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT10, Toronto, ON, Canada, 8/31/10. https://doi.org/10.1007/978-3-642-22427-0_1
Cheng K, Dasgupta P. Multi-agent coalition formation for distributed area coverage. In Collaborative Agents - Research and Development: International Workshops CARE@IAT10 2010, Revised Selected Papers. 2011. p. 1-13. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-22427-0_1
Cheng, Ke ; Dasgupta, Prithviraj. / Multi-agent coalition formation for distributed area coverage. Collaborative Agents - Research and Development: International Workshops CARE@IAT10 2010, Revised Selected Papers. 2011. pp. 1-13 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{70db29656af64094a9366b54b6045fa4,
title = "Multi-agent coalition 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 multi-robot 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). Also we designed a greedy method and a heuristic method to find BMWC in O(n log n) time and O(n 2) time respectively. We tested these two algorithm with our base line method.",
keywords = "Area Coverage, Weighted Voting Games, Winning Coalitions",
author = "Ke Cheng and Prithviraj Dasgupta",
year = "2011",
month = "8",
day = "1",
doi = "10.1007/978-3-642-22427-0_1",
language = "English (US)",
isbn = "9783642224263",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "1--13",
booktitle = "Collaborative Agents - Research and Development",

}

TY - GEN

T1 - Multi-agent coalition formation for distributed area coverage

AU - Cheng, Ke

AU - Dasgupta, Prithviraj

PY - 2011/8/1

Y1 - 2011/8/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 multi-robot 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). Also we designed a greedy method and a heuristic method to find BMWC in O(n log n) time and O(n 2) time respectively. We tested these two algorithm with our base line method.

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 multi-robot 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). Also we designed a greedy method and a heuristic method to find BMWC in O(n log n) time and O(n 2) time respectively. We tested these two algorithm with our base line method.

KW - Area Coverage

KW - Weighted Voting Games

KW - Winning Coalitions

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

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

U2 - 10.1007/978-3-642-22427-0_1

DO - 10.1007/978-3-642-22427-0_1

M3 - Conference contribution

SN - 9783642224263

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 13

BT - Collaborative Agents - Research and Development

ER -