A Swarm Robotic Exploration Strategy Based on an Improved Random Walk Method

Abstract EN

An environment can be searched far more efficiently if the appropriate search strategy is used.

Because of the limited individual abilities of swarm robots, namely, local sensing and low processing power, random searching is the main search strategy used in swarm robotics.

The random walk methods that are used most commonly are Brownian motion and Lévy flight, both of which mimic the self-organized behavior of social insects.

However, both methods are somewhat limited when applied to swarm robotics, where having the robots search repeatedly can result in highly inefficient searching.

Therefore, by analyzing the characteristics of swarm robotic exploration, this paper proposes an improved random walk method in which each robot adjusts its step size adaptively to reduce the number of repeated searches by estimating the density of robots in the environment.

Simulation experiments and experiments with actual robots are conducted to study the effectiveness of the proposed method and evaluate its performance in an exploration mission.

The experimental results presented in this paper show that an area is covered more efficiently using the proposed method than it is using either Brownian motion or Lévy flight.