Multi-robot Voronoi tessellation based area partitioning algorithm study

Abstract

Abstract This article is focused on the multi-robot applied Voronoi tessellation based area partitioning algorithm operation and properties. The selection of main parameters of the algorithm is covered and explanation of the algorithm functionality is given. The subspace area equality and the operation time are taken as main measures of the algorithm operation for experiments where a dependency on the border shape and structure and a number of robots in the group are considered. The experimental data, gained during the study, is summarized mainly in a graphical way.