Enhanced Foraging in Robot Swarms Using Collective Lévy Walks

A key aspect of foraging in robot swarms is optimizing the search efficiency when both the environment and target density are unknown. Hence, designing optimal exploration strategies is desirable. This paper proposes a novel approach that extends the individual Lévy walk to a collective one. To achieve this, we adjust the individual motion through applying an artificial potential field method originating from local communication. We demonstrate the effectiveness of the enhanced foraging by confirming that the collective trajectory follows a heavy-tailed distribution over a wide range of swarm sizes. Additionally, we study target search efficiency of the proposed algorithm in comparison with the individual Lévy walk for two different types of target distributions: homogeneous and heterogeneous. Our results highlight the advantages of the proposed approach for both target distributions, while increasing the scalability to large swarm sizes. Finally, we further extend the individual exploration algorithm by adapting the Lévy walk parameter α, altering the motion pattern based on a local estimation of the target density. This adaptive behavior is particularly useful when targets are distributed in patches.

[1]  M. Rietkerk,et al.  Spatial vegetation patterns and imminent desertification in Mediterranean arid ecosystems , 2007, Nature.

[2]  Aaron Clauset,et al.  Scale-free networks are rare , 2018, Nature Communications.

[3]  G M Viswanathan,et al.  Robustness of optimal random searches in fragmented environments. , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Simon A. Levin,et al.  Multiple Scales and the Maintenance of Biodiversity , 2000, Ecosystems.

[5]  Giuseppe Oriolo,et al.  Random Walks in Swarm Robotics: An Experiment with Kilobots , 2016, ANTS Conference.

[6]  M. E. Wosniack,et al.  Efficient search of multiple types of targets. , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Yara Khaluf,et al.  Modulating interaction times in an Artificial Society of Robots , 2019 .

[8]  Pieter Simoens,et al.  Local ant system for allocating robot swarms to time-constrained tasks , 2019, J. Comput. Sci..

[9]  D. Sumpter The principles of collective animal behaviour , 2006, Philosophical Transactions of the Royal Society B: Biological Sciences.

[10]  Ernesto P. Raposo,et al.  The influence of the environment on Lévy random search efficiency: Fractality and memory effects , 2012 .

[11]  Pieter Simoens,et al.  Scale-Free Features in Collective Robot Foraging , 2019, Applied Sciences.

[12]  Eliseo Ferrante,et al.  Collective Decision with 100 Kilobots Speed vs Accuracy in Binary Discrimination Problems , 2015 .

[13]  Marcos C. Santos,et al.  Dynamical robustness of Lévy search strategies. , 2003, Physical review letters.

[14]  Dietmar Plenz,et al.  powerlaw: A Python Package for Analysis of Heavy-Tailed Distributions , 2013, PloS one.

[15]  F Bartumeus,et al.  Optimizing the encounter rate in biological interactions: Lévy versus Brownian strategies. , 2002, Physical review letters.

[16]  G. Viswanathan,et al.  Optimal random searches of revisitable targets: Crossover from superdiffusive to ballistic random walks , 2004 .

[17]  Yara Khaluf Edge Detection in Static and Dynamic Environments using Robot Swarms , 2017, 2017 IEEE 11th International Conference on Self-Adaptive and Self-Organizing Systems (SASO).

[18]  Paul Levi,et al.  Collective-adaptive Lévy flight for underwater multi-robot exploration , 2013, 2013 IEEE International Conference on Mechatronics and Automation.

[19]  Pieter Simoens,et al.  Collective Lévy Walk for Efficient Exploration in Unknown Environments , 2018, AIMSA.

[20]  Levent Bayındır,et al.  A review of swarm robotics tasks , 2016, Neurocomputing.

[21]  Andrea Falcón-Cortés,et al.  Collective learning from individual experiences and information transfer during group foraging , 2019, Journal of the Royal Society Interface.

[22]  Di Ma,et al.  A survey of movement strategies for improving network coverage in wireless sensor networks , 2009, Comput. Commun..

[23]  Frederic Bartumeus,et al.  ANIMAL SEARCH STRATEGIES: A QUANTITATIVE RANDOM‐WALK ANALYSIS , 2005 .

[24]  H. Stanley,et al.  Optimizing the success of random searches , 1999, Nature.

[25]  Marina E. Wosniack,et al.  The evolutionary origins of Lévy walk foraging , 2017, PLoS Comput. Biol..

[26]  Erol Sahin,et al.  A Macroscopic Model for Self-organized Aggregation in Swarm Robotic Systems , 2006, Swarm Robotics.

[27]  Eliseo Ferrante,et al.  Swarm robotics: a review from the swarm engineering perspective , 2013, Swarm Intelligence.

[28]  Jacob Beal,et al.  Superdiffusive Dispersion and Mixing of Swarms , 2015, ACM Trans. Auton. Adapt. Syst..

[29]  Hazel R. Parry,et al.  Optimal Lévy-flight foraging in a finite landscape , 2014, Journal of The Royal Society Interface.

[30]  Henri Weimerskirch,et al.  Are seabirds foraging for unpredictable resources , 2007 .

[31]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

[32]  Yutaka Nakamura,et al.  An adaptive switching behavior between levy and Brownian random search in a mobile robot based on biological fluctuation , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[33]  Eliseo Ferrante,et al.  ARGoS: a modular, parallel, multi-engine simulator for multi-robot systems , 2012, Swarm Intelligence.

[34]  D.,et al.  Random walk exploration for swarm mapping , 2019 .