Sweep coverage of discrete time multi-robot networks with general topologies

摘要

This paper addresses a sweep coverage problem of multi-robot networks with general topolo-gies. To deal with environmental uncertainties, we present discrete time sweep coverage algo-rithms to guarantee the complete coverage of the given region by sweeping in parallel with workload partition. Moreover, the error between actual coverage time and the optimal time is estimated with the aid of continuous time results. Finally, numerical simulation is conducted to verify the theoretical results.