This article presents a distributed online algorithm for patrolling certain locations of higher priority as frequently as possible, while also ensuring finite time visits to non-priority locations. The algorithm generates offline patrol routes, or ‘Rabbit Walks’, to explore non-priority locations. The number of these walks depends on a parameter in the proposed algorithm, allowing for scalable implementation based on the resources available on each patrolling robot. This methodology aims to balance visits to priority and non-priority locations, thereby improving overall security and efficiency.
Publication date: 29 Dec 2023
Project Page: not provided
Paper: https://arxiv.org/pdf/2312.16564
