title: Emergence of an optimal search strategy from a simple random walk.
abstract: In reports addressing animal foraging strategies, it has been stated that Lévy-like algorithms represent an optimal search strategy in an unknown environment, because of their super-diffusion properties and power-law-distributed step lengths. Here, starting with a simple random walk algorithm, which offers the agent a randomly determined direction at each time step with a fixed move length, we investigated how flexible exploration is achieved if an agent alters its randomly determined next step forward and the rule that controls its random movement based on its own directional moving experiences. We showed that our algorithm led to an effective food-searching performance compared with a simple random walk algorithm and exhibited super-diffusion properties, despite the uniform step lengths. Moreover, our algorithm exhibited a power-law distribution independent of uniform step lengths.
authors.affiliation: Faculty of Science, Department of Earth and Planetary Science, Kobe University, Nada, Kobe 657-8501, Japan. sakiyama@stu.kobe-u.ac.jp
authors.forename: Tomoko
authors.initials: T
authors.lastname: Sakiyama
authors.forename: Yukio-Pegio
authors.initials: YP
authors.lastname: Gunji
mesh_terms: D000465:Algorithms; D000818:Animals; D005247:Feeding Behavior / Q000502:physiology*; D006801:Humans; D008954:Models, Biological; D016138:Walking / Q000502:physiology*
keywords: optimal strategy; power-law; random walk; super-diffusion