TY - CHAP
T1 - Swarm Search of Expanding Regions in Grids: Lower Bounds
T2 - Lower bounds
AU - Altshuler, Yaniv
AU - Pentland, Alex
AU - Bruckstein, Alfred M.
N1 - Publisher Copyright:
© Springer International Publishing AG 2018.
PY - 2018
Y1 - 2018
N2 - 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 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.
AB - 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 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.
UR - http://www.scopus.com/inward/record.url?scp=85027282742&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-63604-7_3
DO - 10.1007/978-3-319-63604-7_3
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???
SN - 978-3-319-63602-3
VL - 729
T3 - Studies in Computational Intelligence
SP - 51
EP - 89
BT - SWARMS AND NETWORK INTELLIGENCE IN SEARCH
ER -