Skip to main content

Thank you for visiting You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

Mathematical physics

Search research

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

Relevant articles

Open Access articles citing this article.

Access options

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

Figure 1: Gotcha! An albatross completes a search for an non-replenishable target.


  1. 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).

    Google Scholar 

  2. Bénichou, O., Loverdo, C., Moreau, M. & Voituriez, R. Phys. Rev. E 74, 020102 (2006).

    Article  ADS  Google Scholar 

  3. Viswanathan, G. M. et al. Nature 381, 413–415 (1996).

    Article  ADS  CAS  Google Scholar 

  4. Weiss, G. H. & Shlesinger, M. F. J. Stat. Phys. 27, 355–363 (1982).

    Article  ADS  Google Scholar 

Download references

Author information

Authors and Affiliations


Rights and permissions

Reprints and Permissions

About this article

Cite this article

Shlesinger, M. Search research. Nature 443, 281–282 (2006).

Download citation

  • Published:

  • Issue Date:

  • DOI:

This article is cited by


Quick links

Nature Briefing

Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.

Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing