Collective lévy walk for efficient exploration in unknown environments

12Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

One of the key tasks of autonomous mobile robots is to explore the unknown environment under limited energy and deadline conditions. In this paper, we focus on one of the most efficient random walks found in the natural and biological system, i.e., Lévy walk. We show how Lévy properties disappear in larger robot swarm sizes because of spatial interferences and propose a novel behavioral algorithm to preserve Lévy properties at the collective level. Our initial findings hold potential to accelerate target search processes in large unknown environments by parallelizing Lévy exploration using a group of robots.

Cite

CITATION STYLE

APA

Khaluf, Y., Van Havermaet, S., & Simoens, P. (2018). Collective lévy walk for efficient exploration in unknown environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11089 LNAI, pp. 260–264). Springer Verlag. https://doi.org/10.1007/978-3-319-99344-7_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free