Abstract In this chapter we examine the dynamic generalization of the Cooperative Cleaners problem presented in [10] and in the previous chapter 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 an algorithm-agnostic lower bound for the problem, as well as a collaborative swarm search algorithm, accompanied with a variety of experimental results.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Swarm Search of Expanding Regions in Grids: Lower Bounds


    Beteiligte:


    Erscheinungsdatum :

    04.08.2017


    Format / Umfang :

    39 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Swarm Search of Expanding Regions in Grids: Upper 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


    Lower Bounds on DOP

    Peter F Swaszek | Online Contents | 2017


    Introduction to Swarm Search

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