Abstract
This paper addresses a sweep coverage problem of multi-robot networks with general topologies. To deal with environmental uncertainties, we present discrete time sweep coverage algorithms 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.
Full Text
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call