How does one best search for non-replenishable targets at unknown positions? An optimized search strategy could be applied to situations as diverse as animal foraging and time-sensitive rescue missions.
This is a preview of subscription content, access via your institution
Open Access articles citing this article.
Efficient Lévy walks in virtual human foraging
Scientific Reports Open Access 04 March 2021
Subscribe to this journal
Receive 51 print issues and online access
$199.00 per year
only $3.90 per issue
Rent or buy this article
Get just this article for as long as you need it
Prices may be subject to local taxes which are calculated during checkout
Morse, P. M. & Kimball, G. E. reprinted in The World of Mathematics Vol. 4 (ed. Newman, J. R.) 2160–2178 (Simon & Schuster, New York, 1956).
Bénichou, O., Loverdo, C., Moreau, M. & Voituriez, R. Phys. Rev. E 74, 020102 (2006).
Viswanathan, G. M. et al. Nature 381, 413–415 (1996).
Weiss, G. H. & Shlesinger, M. F. J. Stat. Phys. 27, 355–363 (1982).
Rights and permissions
About this article
Cite this article
Shlesinger, M. Search research. Nature 443, 281–282 (2006). https://doi.org/10.1038/443281a
This article is cited by
Statistical and transport properties of a one-dimensional random walk with periodically distributed trapping intervals
Bollettino dell'Unione Matematica Italiana (2023)
Application of improved hybrid whale optimization algorithm to optimization problems
Neural Computing and Applications (2023)
Enhanced cuckoo search algorithm for industrial winding process modeling
Journal of Intelligent Manufacturing (2023)
A novel feature selection using binary hybrid improved whale optimization algorithm
The Journal of Supercomputing (2023)
Machine-learning-assisted shear strength prediction of reinforced concrete beams with and without stirrups
Engineering with Computers (2022)