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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Swarm Search of Expanding Regions in Grids: Upper Bounds


    Contributors:


    Publication date :

    2017-08-04


    Size :

    37 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Swarm Search of Expanding Regions in Grids: Lower Bounds

    Altshuler, Yaniv / Pentland, Alex / Bruckstein, Alfred M. | Springer Verlag | 2017


    The Search Complexity of Collaborative Swarms in Expanding $$\mathbf{Z}^{2}$$ Grid Regions

    Altshuler, Yaniv / Pentland, Alex / Bruckstein, Alfred M. | Springer Verlag | 2017


    Introduction to Swarm Search

    Altshuler, Yaniv / Pentland, Alex / Bruckstein, Alfred M. | Springer Verlag | 2017


    Simple upper bounds for partition functions

    Azevedo Pribitkin, W. | British Library Online Contents | 2009