Skip to main content
SpringerLink
Log in

Swarm robots using Lévy walk with concession in targets exploration

  • Original Article
  • Published:
Artificial Life and Robotics Aims and scope Submit manuscript

Abstract

In the swarm robotics community, Lévy walk has been recognized as one of the most efficient search strategies for the environment, with sparse targets that robots have no prior knowledge of. Generally, Lévy walk is generated by following the Lévy distribution. Our previous results also confirmed that the Lévy walk outperformed the usual random walk for exploration strategy in real swarm robot experiments. On the other hand, it has been reported in several papers that each individual in swarm robots does not follow Lévy distribution due to collision avoidance from other robots, resulting in inefficient search. Therefore, we introduced concessions to the swarm robots to improve search efficiency. This paper investigated the performance of the Lévy walk with concession. Robots concede other robots when they receive the signal that other robots execute longer walks. We conducted a series of computer simulations varying ranges detecting other robots’ walk distance signals, the number of robots, the number of targets, and the distribution of targets. The results suggest that the search efficiency of Lévy walk was improved by concession. Furthermore, we confirmed that improving search efficiency saturates beyond the threshold of range detecting other robots’ walk distance signals.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

Notes

  1. Şahin [3] claimed to use these criteria as a measure of the degree of SR in a particular study.

References

  1. Trianni V (2008) Evolutionary swarm robotics. Springer-Verlag

    Book  Google Scholar 

  2. Brambilla M, Ferrante E, Birattari M, Dorigo M (2013) Swarm robotics: a review from the swarm engineering perspective. Swarm Intell 7(1):1–41

    Article  Google Scholar 

  3. Şahin E (2005) Swarm robotics: from sources of inspiration to domains of application. Lect Notes Comput Sci 3342:10–20

    Article  Google Scholar 

  4. Li J, Andrew LLH, Foh CH, Zukerman M, Hsiao-Hwa C (2009) Connectivity, coverage and placement in wireless sensor networks. Sensors 9(10):7664–7693

    Article  Google Scholar 

  5. Katada Y (2014) “Connectivity of swarm robot networks for communication range and the number of robots based on percolation theory,” Proc. of the 2014 IEEE/SICE International Symposium on System Integration, pp.93–98,

  6. Katada Y, Nishiguchi A, Moriwaki K, Watakabe R (2016) Swarm robotic network using Lévy flight in target detection problem. Artif Life Robot 21(3):295–301

    Article  Google Scholar 

  7. Lévy P (1937) Theorie de l’addition des veriables aleatoires. Gauthier-Villars

    MATH  Google Scholar 

  8. Koyama H, Namatame A (2008) Comparison of efficiency of random walk based search and Levy flight search. Inform Process Soc Jpn Tech Rep 20:19–24 (In Japanese)

    Google Scholar 

  9. Khaluf Y, Havermaet SV, Simoens P (2018) “Collective Lévy walk for efficient exploration in unknown environments,” Artificial Intelligence: Methodology, Systems, and Applications, Lecture Notes in Computer Science, Vol.11089, Springer

  10. Nauta J, Havermaet SV, Simoens P, Khaluf Y (2020) “Enhanced foraging in robot swarms using collective Lévy walks,” Proc. of the 24th European Conference on Artificial Intelligence-ECAI

  11. Katada Y, Ohkura K (2023) “Swarm Robots Using Lévy Walk in Targets Exploration -Computer Simulation for Performance of LevyWalk with Concession,” Proceedings of the 6th International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM2023), pp.1523–1528

  12. Lee CY, Yao X (2004) Evolutionary programming using mutations based on the Lévy probability distribution. IEEE Trans Evol Comput 8:1–13

    Article  Google Scholar 

  13. Katada Y (2018) Swarm robotic network using Lévy flight for exploration -computer simulation for sweeping. Trans Soc Instrument Control Eng 54(1):22–30 (In Japanese)

    Article  Google Scholar 

  14. Open Dynamics Engine (ODE), http://ode.org/

  15. Brooks RA (1986) A robust layered control system for a mobile robot. IEEE J Robot Autom 2(1):14–23

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Setsunan University, 17-8 Ikeda-Nakamachi, Neyagawa, Osaka, 572-8508, Japan

    Yoshiaki Katada

  2. Graduate School of Advanced Science and Engineering, Hiroshima University, 1-4-1, Kagamiyama, Higashi-Hiroshima, Hiroshima, 739-8527, Japan

    Kazuhiro Ohkura

Authors
  1. Yoshiaki Katada
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kazuhiro Ohkura
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yoshiaki Katada.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Katada, Y., Ohkura, K. Swarm robots using Lévy walk with concession in targets exploration. Artif Life Robotics 28, 652–660 (2023). https://doi.org/10.1007/s10015-023-00900-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10015-023-00900-z

Keywords

Search

Navigation