Distributed, complete, multi-robot coverage of initially unknown environments using repartitioning

Kurt Hungerford, Prithviraj Dasgupta, K. R. Guruprasad

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

3 Citations (Scopus)

Abstract

We consider the problem of coverage path planning by multiple robots in an environment where the location and geometry of obstacles are initially unknown to the robots. We propose a novel algorithm where the robots initially partition the environment using Voronoi partitioning. Each robot then uses an auction-based algorithm to reallocate inaccessible portions of its initial Voronoi cell to robots in neighboring Voronoi cells so that each robot is responsible for covering a set of contiguous connected regions. We have verified the performance of our algorithm on e-puck robots within the Webots simulator in different environments with different obstacle geometries and shown that it performs complete, non-overlapping coverage.

Original languageEnglish (US)
Title of host publication13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages1453-1454
Number of pages2
ISBN (Electronic)9781634391313
StatePublished - Jan 1 2014
Event13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 - Paris, France
Duration: May 5 2014May 9 2014

Publication series

Name13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014
Volume2

Conference

Conference13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014
CountryFrance
CityParis
Period5/5/145/9/14

Fingerprint

Robots
Geometry
Motion planning
Simulators

Keywords

  • Coverage
  • Multi-robot systems
  • Voronoi partition

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Hungerford, K., Dasgupta, P., & Guruprasad, K. R. (2014). Distributed, complete, multi-robot coverage of initially unknown environments using repartitioning. In 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 (pp. 1453-1454). (13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014; Vol. 2). International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS).

Distributed, complete, multi-robot coverage of initially unknown environments using repartitioning. / Hungerford, Kurt; Dasgupta, Prithviraj; Guruprasad, K. R.

13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2014. p. 1453-1454 (13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014; Vol. 2).

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

Hungerford, K, Dasgupta, P & Guruprasad, KR 2014, Distributed, complete, multi-robot coverage of initially unknown environments using repartitioning. in 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014. 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014, vol. 2, International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), pp. 1453-1454, 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014, Paris, France, 5/5/14.
Hungerford K, Dasgupta P, Guruprasad KR. Distributed, complete, multi-robot coverage of initially unknown environments using repartitioning. In 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). 2014. p. 1453-1454. (13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014).
Hungerford, Kurt ; Dasgupta, Prithviraj ; Guruprasad, K. R. / Distributed, complete, multi-robot coverage of initially unknown environments using repartitioning. 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2014. pp. 1453-1454 (13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014).
@inproceedings{a0c89dcb36964616bd72dc9b68c4829b,
title = "Distributed, complete, multi-robot coverage of initially unknown environments using repartitioning",
abstract = "We consider the problem of coverage path planning by multiple robots in an environment where the location and geometry of obstacles are initially unknown to the robots. We propose a novel algorithm where the robots initially partition the environment using Voronoi partitioning. Each robot then uses an auction-based algorithm to reallocate inaccessible portions of its initial Voronoi cell to robots in neighboring Voronoi cells so that each robot is responsible for covering a set of contiguous connected regions. We have verified the performance of our algorithm on e-puck robots within the Webots simulator in different environments with different obstacle geometries and shown that it performs complete, non-overlapping coverage.",
keywords = "Coverage, Multi-robot systems, Voronoi partition",
author = "Kurt Hungerford and Prithviraj Dasgupta and Guruprasad, {K. R.}",
year = "2014",
month = "1",
day = "1",
language = "English (US)",
series = "13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014",
publisher = "International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)",
pages = "1453--1454",
booktitle = "13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014",

}

TY - GEN

T1 - Distributed, complete, multi-robot coverage of initially unknown environments using repartitioning

AU - Hungerford, Kurt

AU - Dasgupta, Prithviraj

AU - Guruprasad, K. R.

PY - 2014/1/1

Y1 - 2014/1/1

N2 - We consider the problem of coverage path planning by multiple robots in an environment where the location and geometry of obstacles are initially unknown to the robots. We propose a novel algorithm where the robots initially partition the environment using Voronoi partitioning. Each robot then uses an auction-based algorithm to reallocate inaccessible portions of its initial Voronoi cell to robots in neighboring Voronoi cells so that each robot is responsible for covering a set of contiguous connected regions. We have verified the performance of our algorithm on e-puck robots within the Webots simulator in different environments with different obstacle geometries and shown that it performs complete, non-overlapping coverage.

AB - We consider the problem of coverage path planning by multiple robots in an environment where the location and geometry of obstacles are initially unknown to the robots. We propose a novel algorithm where the robots initially partition the environment using Voronoi partitioning. Each robot then uses an auction-based algorithm to reallocate inaccessible portions of its initial Voronoi cell to robots in neighboring Voronoi cells so that each robot is responsible for covering a set of contiguous connected regions. We have verified the performance of our algorithm on e-puck robots within the Webots simulator in different environments with different obstacle geometries and shown that it performs complete, non-overlapping coverage.

KW - Coverage

KW - Multi-robot systems

KW - Voronoi partition

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

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

M3 - Conference contribution

AN - SCOPUS:84911376573

T3 - 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014

SP - 1453

EP - 1454

BT - 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014

PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)

ER -