Taking Turns in Complete Coverage for Multiple Robots

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


Coverage is a canonical task where a robot or a group of robots are required to visit every point in a given work area, typically within the shortest possible time. Previous work on offline coverage highlighted the benefits of determining a circular coverage path, divided into segments for different robots (if more than one). This paper contributes a number of significant improvements to the planning and utilization of circular coverage paths with single and multiple robots. We focus on circular paths that exactly decompose the environment into cells, where each obstacle-free cell is covered in a back-and-forth movement. We show that locally changing the coverage direction (alignment) in each cell can improve coverage time, and that this allows for merging bordering cells into larger cells, significantly reducing the number of turns taken by the robots. We additionally present a novel data structure to compactly represent all possible coverage and non-coverage paths between cells in the work area. Finally, we discuss the complexity of global multi-robot assignment of path segments, and present greedy polynomial-time approximations which provide excellent results in practice.

Original languageEnglish
Title of host publicationSpringer Proceedings in Advanced Robotics
PublisherSpringer Science and Business Media B.V.
Number of pages12
StatePublished - 2019

Publication series

NameSpringer Proceedings in Advanced Robotics
ISSN (Print)2511-1256
ISSN (Electronic)2511-1264

Bibliographical note

Funding Information:
This research was supported by ISF grant #2306/18. As always, thanks to K. Ushi.

Publisher Copyright:
© 2019, Springer Nature Switzerland AG.


  • Coverage
  • Multi-robot systems


Dive into the research topics of 'Taking Turns in Complete Coverage for Multiple Robots'. Together they form a unique fingerprint.

Cite this