• Corpus ID: 119351138

On optimal tempered L\'evy flight foraging

  title={On optimal tempered L\'evy flight foraging},
  author={Yuquan Chen and Derek Hollenbeck and Yong Wang and Yang Quan Chen},
  journal={arXiv: Statistical Mechanics},
Optimal random foraging strategy has gained increasing concentrations. It is shown that L\'evy flight is more efficient compared with the Brownian motion when the targets are sparse. However, standard L\'evy flight generally cannot be followed in practice. In this paper, we assume that each flight of the forager is possibly interrupted by some uncertain factors, such as obstacles on the flight direction, natural enemies in the vision distance, and restrictions in the energy storage for each… 

Figures from this paper


Optimal foraging: Lévy pattern or process?
A composite search model is presented for non-destructive foraging behaviour based on Brownian (i.e. non-heavy-tailed) motion, and it is shown that the compositeSearch model provides higher foraging efficiency than the Lévy model.
Optimizing the success of random searches
It is shown that, when the target sites are sparse and can be visited any number of times, an inverse square power-law distribution of flight lengths, corresponding to Lévy flight motion, is an optimal strategy.
Optimal Lévy-flight foraging in a finite landscape
This study provides a new perspective on Lévy-flight foraging, opens new avenues for investigating the interaction between foraging dynamics and the environment and offers a realistic framework for analysing animal movement patterns from empirical data.
Stochastic Optimal Foraging: Tuning Intensive and Extensive Dynamics in Random Searches
The results suggest that animals could tune key statistical movement properties to cope with the very general problem of balancing out intensive and extensive random searching, and suggest that introducing a multiscale set of reorientations ensures both a thorough local space exploration without oversampling and a fast spreading dynamics at the large scale.
Lévy flight search patterns of wandering albatrosses
LéVY flights are a special class of random walks whose step lengths are not constant but rather are chosen from a probability distribution with a power-law tail. Realizations of Lévy flights in
Lévy walk patterns in the foraging movements of spider monkeys (Ateles geoffroyi)
The foraging patterns of free-ranging spider monkeys in the forest of the Yucatan Peninsula, Mexico are described and it is found that these patterns closely resemble what physicists know as Lévy walks.
Lévy flights in random searches
We review the general search problem of how to find randomly located objects that can only be detected in the limited vicinity of a forager, and discuss its quantitative description using the theory
Optimal random Lévy-loop searching: New insights into the searching behaviours of central-place foragers
It is suggested that the searching patterns of desert ants (Cataglyphis) are consistent with the adoption of an optimal Levy-looping searching strategy.
Lévy flights and superdiffusion in the context of biological encounters and random searches
We review the general problem of random searches in the context of biological encounters. We analyze deterministic and stochastic aspects of searching in general and address the destructive and
This work analyzes the statistical differences between two random-walk models commonly used to fit animal movement data, the Levy walks and the correlated random walks, and quantifies their efficiencies within a random search context.