Multi-Robot Workspace Division Based on Compact Polygon Decomposition

摘要

In this work, we tackle the problem of multi-robot convex workspace division. We present an algorithm to split a convex area among several robots into the corresponding number of parts based on the area requirements for each part. The core idea of the algorithm is a sequence of divisions into pairs with the lowest possible perimeters. In this way, the compactness of the partitions obtained is maximized. The performance of the algorithm, as well as the quality of the obtained parts, are analyzed in comparison with two different algorithms. The presented approach yields better results in all metrics compared to other algorithms.