skip to content

Optimal search strategies for hidden targets

Presented by: 
O Benichou Collège de France
Friday 30th June 2006 - 10:00 to 11:00
INI Seminar Room 1

Many physical, chemical or biological problems can be rephrased as search processes, involving a searcher and a target of unknown position. We show that intermittent search strategies, alternating active search phases and non reactive displacement phases, are universal for a wide class of problems involving search time optimization. More precisely, we address the general question of determining in which cases a searcher should, or should not, interrupt his search activity by "losing" time in non reactive phases of mere displacement, and which durations of each phase optimize the search time. Using a representative analytical model, we show that intermittent strategies do optimize the search time as soon as the target is "difficult" to detect, and we explicitly give the optimal search strategies, which depend on the memory skills of the searcher.

University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons