Volume 82, Number 2, April 2008
|Number of page(s)||6|
|Published online||20 March 2008|
Optimal random Lévy-loop searching: New insights into the searching behaviours of central-place foragers
Rothamsted Research - Harpenden, Hertfordshire, AL5 2JQ, UK, EU
Corresponding author: firstname.lastname@example.org
Accepted: 18 February 2008
A random Lévy-looping model of searching is devised and optimal random Lévy-looping searching strategies are identified for the location of a single target whose position is uncertain. An inverse-square power law distribution of loop lengths is shown to be optimal when the distance between the centre of the search and the target is much shorter than the size of the longest possible loop in the searching pattern. Optimal random Lévy-looping searching patterns have recently been observed in the flight patterns of honeybees (Apis mellifera) when attempting to locate their hive and when searching after a known food source becomes depleted. It is suggested that the searching patterns of desert ants (Cataglyphis) are consistent with the adoption of an optimal Lévy-looping searching strategy.
PACS: 02.50.Ey – Stochastic processes / 05.10.Gg – Stochastic analysis methods (Fokker-Planck, Langevin, etc.) / 05.40.Fb – Random walks and Levy flights
© EPLA, 2008
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.