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 $$ \mathbf{Z}^{2}$$ 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.
Swarm Search of Expanding Regions in Grids: Upper Bounds
2017-08-04
37 pages
Article/Chapter (Book)
Electronic Resource
English
Swarm Search of Expanding Regions in Grids: Lower Bounds
Springer Verlag | 2017
|The Search Complexity of Collaborative Swarms in Expanding $$\mathbf{Z}^{2}$$ Grid Regions
Springer Verlag | 2017
|Springer Verlag | 2017
|Simple upper bounds for partition functions
British Library Online Contents | 2009
|Philippinen - Expanding infrastructure by organization into mega-regions
Online Contents | 2007