This paper discusses the problem of building efficient coverage paths for a team of robots.
An efficient multirobot coverage algorithm should result in a coverage path for every robot …

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 …

Searching for objects and observing parts of a known environment efficiently is a
fundamental problem in many real‐world robotic applications, eg, household robots …

This paper presents the development of a multi-robot platform which performs a coverage
task based in a multiagent approach. Characteristics and requirements looking for …

One of the main applications of mobile robots is coverage: visiting each location in known
terrain. Coverage is crucial for lawn mowing, cleaning, harvesting, search-and-rescue …

This paper presents decentralized algorithms for coverage with mobile robots on a graph.
Coverage is an important capability of multi-robot systems engaged in a number of different …

In this paper we propose BeePCo, a multi-robot coverage approach based on honey bee
colony behaviour. Specifically, we propose a honey bee inspired pheromone signalling …

Enabling multiple robots to collaboratively per-form coverage path planning on complex
surfaces embedded in R^3 in the presence of moving obstacles is a challenging problem …

Planning for multi-robot coverage seeks to determine collision-free paths for a fleet of robots,
enabling them to collectively observe points of interest in an environment. Persistent …

This work addresses a time‐sensitive coverage control problem for multiple non‐holonomic
mobile robots. The coverage objective is evaluated by the total arrivial time of robots …