Area coverage is an important task for mobile robots, with many real-world applications. In
many cases, the coverage has to be completed without the use of a map or any a priori …

Area coverage is an important task for mobile robots, with many real-world applications.
Motivated by potential efficiency and robustness improvements, there is growing interest in …

This paper presents an algorithm for the complete coverage of free space by a team of
mobile robots. Our approach is based on a single robot coverage algorithm, which divides …

This article presents an algorithm for online multirobot coverage that proceeds with minimal
knowledge of the already explored region and the frontier cells. It creates clusters of frontier …

Motivated by potential efficiency and robustness gains, there is growing interest in the use of
multiple robots for coverage. In coverage, robots visit every point in a target area, at least …

In this paper, we proposed an improved algorithm for the multi-robot complete coverage
problem. Real world applications such as lawn mowing, chemical spill clean-up, and …

We introduce an algorithm to cover an unknown space with a homogeneous team of circular
mobile robots. Our approach is based on a single robot coverage algorithm, a …

In this paper, we study how multiple robots can cover known terrain quickly. We extend Multi-
Robot Forest Coverage, a state-of-the-art multi-robot coverage algorithm, from terrain with …

This paper addresses the complete area coverage problem of a known environment by
multiple-robots. Complete area coverage is the problem of moving an end-effector over all …

Tasks such as street mapping and security surveillance seek a route that traverses a given
space to perform a function. These task functions may involve mapping the space for …