Multi-agent coalition formation for distributed area coverage: Analysis and evaluation

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

8 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 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(n2) time respectively. There is a trade-off between computational time and the optimal solution.

Original languageEnglish (US)
Title of host publicationProceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010
Pages334-337
Number of pages4
DOIs
StatePublished - Dec 13 2010
Event2010 3rd IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010 - Toronto, ON, Canada
Duration: Aug 31 2010Sep 3 2010

Publication series

NameProceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010

Conference

Conference2010 3rd IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010
CountryCanada
CityToronto, ON
Period8/31/109/3/10

Fingerprint

Robots
Heuristic methods
Game theory
Mobile robots
Robotics
Inspection
Antennas
Sensors

Keywords

  • Area coverage
  • Weighted voting games
  • Winning coalitions

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Software

Cite this

Cheng, K., & Dasgupta, P. (2010). Multi-agent coalition formation for distributed area coverage: Analysis and evaluation. In Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010 (pp. 334-337). [5615765] (Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010). https://doi.org/10.1109/WI-IAT.2010.277

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

Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010. 2010. p. 334-337 5615765 (Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010).

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

Cheng, K & Dasgupta, P 2010, Multi-agent coalition formation for distributed area coverage: Analysis and evaluation. in Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010., 5615765, Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010, pp. 334-337, 2010 3rd IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010, Toronto, ON, Canada, 8/31/10. https://doi.org/10.1109/WI-IAT.2010.277
Cheng K, Dasgupta P. Multi-agent coalition formation for distributed area coverage: Analysis and evaluation. In Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010. 2010. p. 334-337. 5615765. (Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010). https://doi.org/10.1109/WI-IAT.2010.277
Cheng, Ke ; Dasgupta, Prithviraj. / Multi-agent coalition formation for distributed area coverage : Analysis and evaluation. Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010. 2010. pp. 334-337 (Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010).
@inproceedings{22bff2fba8514dd1b2a87da1f686155d,
title = "Multi-agent coalition formation for distributed area coverage: Analysis and evaluation",
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(n2) time respectively. There is a trade-off between computational time and the optimal solution.",
keywords = "Area coverage, Weighted voting games, Winning coalitions",
author = "Ke Cheng and Prithviraj Dasgupta",
year = "2010",
month = "12",
day = "13",
doi = "10.1109/WI-IAT.2010.277",
language = "English (US)",
isbn = "9780769541914",
series = "Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010",
pages = "334--337",
booktitle = "Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010",

}

TY - GEN

T1 - Multi-agent coalition formation for distributed area coverage

T2 - Analysis and evaluation

AU - Cheng, Ke

AU - Dasgupta, Prithviraj

PY - 2010/12/13

Y1 - 2010/12/13

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(n2) time respectively. There is a trade-off between computational time and the optimal solution.

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(n2) time respectively. There is a trade-off between computational time and the optimal solution.

KW - Area coverage

KW - Weighted voting games

KW - Winning coalitions

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

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

U2 - 10.1109/WI-IAT.2010.277

DO - 10.1109/WI-IAT.2010.277

M3 - Conference contribution

AN - SCOPUS:78649820090

SN - 9780769541914

T3 - Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010

SP - 334

EP - 337

BT - Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010

ER -