Efficient search by optimized intermittent random walks
From MaRDI portal
Abstract: We study the kinetics for the search of an immobile target by randomly moving searchers that detect it only upon encounter. The searchers perform intermittent random walks on a one-dimensional lattice. Each searcher can step on a nearest neighbor site with probability "alpha", or go off lattice with probability "1 - alpha" to move in a random direction until it lands back on the lattice at a fixed distance L away from the departure point. Considering "alpha" and L as optimization parameters, we seek to enhance the chances of successful detection by minimizing the probability P_N that the target remains undetected up to the maximal search time N. We show that even in this simple model a number of very efficient search strategies can lead to a decrease of P_N by orders of magnitude upon appropriate choices of "alpha" and L. We demonstrate that, in general, such optimal intermittent strategies are much more efficient than Brownian searches and are as efficient as search algorithms based on random walks with heavy-tailed Cauchy jump-length distributions. In addition, such intermittent strategies appear to be more advantageous than Levy-based ones in that they lead to more thorough exploration of visited regions in space and thus lend themselves to parallelization of the search processes.
Recommendations
- Optimal intermittent search strategies
- A stochastically quasi-optimal search algorithm for the maximum of the simple random walk
- Optimal probabilistic search
- Directed intermittent search with stochastic resetting
- On Accelerated Random Search
- Optimal search for a randomly moving object
- Optimizing random walk search algorithms in P2P networks
- Speeding up random walks with neighborhood exploration
- scientific article; zbMATH DE number 3990213
Cited in
(24)- The sequential alternative search as a continuous Markov random walk
- Optimal foraging strategies: Lévy walks balance searching and patch exploitation under a very broad range of conditions
- Search reliability and search efficiency of combined Lévy-Brownian motion: long relocations mingled with thorough local exploration
- Active transport improves the precision of linear long distance molecular signalling
- Quickest search over Brownian channels
- Optimal random search, fractional dynamics and fractional calculus
- First passage time statistics for two-channel diffusion
- Stochastic switching in biology: from genotype to phenotype
- Stochastic models in seed dispersals: random walks and birth-death processes
- Distribution of the least-squares estimators of a single Brownian trajectory diffusion coefficient
- Optimal intermittent search strategies: smelling the prey
- Optimal intermittent search strategies
- Dynamical and spatial disorder in an intermittent search process
- TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS
- Improving resource location with locally precomputed partial random walks
- Extreme first passage times of piecewise deterministic Markov processes
- Stochastic resetting in underdamped Brownian motion
- THE TRAPPING PROBLEM OF WEIGHTED (2,2)-FLOWER NETWORKS WITH THE SAME WEIGHT SEQUENCE
- Target competition for resources under multiple search-and-capture events with stochastic resetting
- RANDOM WALKS WITH A TRAP IN SCALE-FREE FRACTAL HIERARCHICAL LATTICES
- Stochastic search processes and chemical reactivity in heterogeneous media
- Intermittent Search Processes: Chance Against Strategy
- Intermittent search strategies revisited: effect of the jump length and biased motion
- Random search on comb
This page was built for publication: Efficient search by optimized intermittent random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3643237)
