# Optimal search strategies for hidden targets

Source: [Optimal search strategies for hidden targets](<https://www.sota2.com/research/paper/68fa26e22c2a3760193be432>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-24T11:40:29.716Z

Authors: O. Benichou, M. Coppey, M. Moreau, P-H. Suet, R. Voituriez

Published: 2005-04-05T13:03:58.000Z

## Abstract

What is the fastest way of finding a randomly hidden target? This question of general relevance is of vital importance for foraging animals. Experimental observations reveal that the search behaviour of foragers is generally intermittent: active search phases randomly alternate with phases of fast ballistic motion. In this letter, we study the efficiency of this type of two states search strategies, by calculating analytically the mean first passage time at the target. We model the perception mecanism involved in the active search phase by a diffusive process. In this framework, we show that the search strategy is optimal when the average duration of "motion phases" varies like the power either 3/5 or 2/3 of the average duration of "search phases", depending on the regime. This scaling accounts for experimental data over a wide range of species, which suggests that the kinetics of search trajectories is a determining factor optimized by foragers and that the perception activity is adequately described by a diffusion process.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/cond-mat/0504107>)

[PDF](<https://arxiv.org/pdf/cond-mat/0504107.pdf>)
