Swarm search of expanding regions in grids: Upper bounds

Abstract

In this chapter we examine the dynamic generalization of the Cooperative Cleaners problem presented in Altshuler et al., Swarm intelligent systems (2006), [10] and in the previous chapters of this book, involving a swarm of collaborative drones that are required to search a dynamically expanding region on the (formula presented) grid (whose “pixels” that were visited by the drones can become “un-searched” after a certain period of time). The goal of the swarm’s members is to “clean” the spreading contamination in as little time as possible. In this work we present a collaborative swarm search algorithm, as well as several upper bounds on the completion time it takes a swarm of k drones, of various velocities.