Skip to main content
SpringerLink
Log in

Mathematical physics

Search research

  • News & Views
  • Published:

From Nature

View current issue Submit your manuscript

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, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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

References

  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

  1. Office of Naval Research, 875 North Randolph Street, Arlington, 22203, Virginia, USA

    Michael F. Shlesinger

Authors
  1. Michael F. Shlesinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shlesinger, M. Search research. Nature 443, 281–282 (2006). https://doi.org/10.1038/443281a

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1038/443281a

  • Springer Nature Limited

This article is cited by

Search

Navigation