GEODESIC-VPC: SPATIAL PARTITIONING FOR MULTI-ROBOT COVERAGE PROBLEM

摘要

In this paper, we address a problem of area coverage using multiple cooperating robots using a “partition and cover approach, where the area of interest is decomposed into as many cells as the robots, and each robot is assigned the task of covering a cell.