In this paper, we address the problem of persistently covering an environment with a group
of mobile robots. In contrast to traditional coverage, in our scenario the coverage level of the …

In this paper we study a multi-robot path planning problem for persistent monitoring of an
environment. We represent the areas to be monitored as the vertices of a weighted graph …

The autonomous multi-robot system is an emerging technology that has a wide range of
potential applications, such as environmental monitoring, exploration of unknown area …

This paper presents matheuristics for routing a heterogeneous group of capacitated
unmanned air vehicles (UAVs) for complete coverage of ground areas, considering …

In this article, we study multirobot path planning for persistent monitoring tasks. We consider
the case where robots have a limited battery capacity with a discharge time. We represent …

In this article, we tackle the problem of persistently covering a complex non-convex
environment with a team of robots. We consider scenarios where the coverage quality of the …

Graph-patrolling problems in the adversarial domain typically embed models and
assumptions about how hostile events, from which an environment must be protected, are …

Coverage Path Planning (CPP) requires planning collision-free paths for a robot that
observes all reachable points of interest in an environment. Most popular CPP approaches …

In this paper, we propose a periodic solution to the problem of persistently covering a finite
set of interest points with a group of autonomous mobile agents. These agents visit …

This paper addresses the persistent coverage problem, in which a group of autonomous
robots must visit periodically a finite set of interest points and spend some time covering …