Bidimensional intermittent search processes: an alternative to Levy flights strategies
arXiv:cond-mat/0606292 · doi:10.1103/PhysRevE.74.020102
Abstract
Levy flights are known to be optimal search strategies in the particular case of revisitable targets. In the relevant situation of non revisitable targets, we propose an alternative model of bidimensional search processes, which explicitly relies on the widely observed intermittent behavior of foraging animals. We show analytically that intermittent strategies can minimize the search time, and therefore do constitute real optimal strategies. We study two representative modes of target detection, and determine which features of the search time are robust and do not depend on the specific characteristics of detection mechanisms. In particular, both modes lead to a global minimum of the search time as a function of the typical times spent in each state, for the same optimal duration of the ballistic phase. This last quantity could be a universal feature of bidimensional intermittent search strategies.
References in corpus (4)
Cited by in corpus (41)
- Intermittent search strategies
- Lévy walks
- First-passage times in complex scale-invariant media
- Persistent Cell Motion in the Absence of External Signals: A Search Strategy for Eukaryotic Cells
- Probing microscopic origins of confined subdiffusion by first-passage observables
- Enhanced reaction kinetics in biological cells
- Stochastic Search with Poisson and Deterministic Resetting
- Robustness of optimal intermittent search strategies in dimension 1, 2 and 3
- Mortality, Redundancy, and Diversity in Stochastic Search
- Optimizing persistent random searches
- First-passage and first-hitting times of Levy flights and Levy walks
- Efficient search by optimized intermittent random walks
- Inverse square Lévy walks are not optimal search strategies for
- Asymptotic behavior of the Kleinberg model
- Flagellar number governs bacterial spreading and transport efficiency
- Optimal search strategies of run-and-tumble walks
- Narrow-escape times for diffusion in microdomains with a particle-surface affinity: Mean-field results
- Optimization of random search processes in the presence of an external bias
- Comparison of pure and combined search strategies for single and multiple targets
- Target search of active agents crossing high energy barriers
- A single predator charging a herd of prey: effects of self volume and predator-prey decision-making
- Constructing a Stochastic Model of Bumblebee Flights from Experimental Data
- The random walk of intermittently self-propelled particles
- Optimal search in interacting populations:Gaussian jumps vs Levy flights
- First hitting times between a run-and-tumble particle and a stochastically-gated target
- Bat Algorithm is Better Than Intermittent Search Strategy
- Semantic Information in a model of Resource Gathering Agents
- Residual mean first-passage time for jump processes: theory and applications to Lévy flights and fractional Brownian motion
- Learning how to find targets in the micro-world: The case of intermittent active Brownian particles
- Capture of a diffusing lamb by a diffusing lion when both return home
- Foraging patterns in online searches
- Exact enumeration approach to first-passage time distribution of non-Markov random walks
- Optimal resetting strategies for search processes in heterogeneous environments
- Changing measurements or changing movements? Sampling scale and movement model identifiability across generations of biologging technology
- Non-stationary Markovian Replication Process causing Diverse Diffusions
- Adaptive active Brownian particles searching for targets of unknown positions
- Transition-path sampling for Run-and-Tumble particles
- Intermittent Information-Driven Search for Underwater Targets
- Run-and-Tumble Particles Learning Chemotaxis
- Surveying Diffusion in Complex Geometries. An Essay
- Average search time bound in cue based search strategy