Answers are grounded in this paper and cite their sources.
We study the role of dynamical constraints in the general problem of finding the best statistical strategy for random searching when the targets can be detected only in the limited vicinity of the searcher. We find that the optimal search strategy depends strongly on the delay time τ during which a previously visited site becomes unavailable. We also find that the optimal search strategy is always described for large step lengths by a power-law distribution P()~^-μ, with 1<μ(τ)≤2. Our findings appear to remain valid even if arbitrary energy costs of locomotion are considered.
No takes yet. Share an insight, caveat, or question.
Raposo et al. (2003) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: