The advantage of L\'evy strategies in intermittent search processes
classification
❄️ cond-mat.stat-mech
keywords
intermittentsearchlevydistributedprocessesrelocationsstrategiesadvantage
read the original abstract
Search strategies based on random walk processes with long-tailed jump length distributions (Levy walks) on the one hand and intermittent behavior switching between local search and ballistic relocation phases on the other, have been previously shown to be beneficial in stochastic target finding problems. We here study a combination of both mechanisms: an intermittent process with Levy distributed relocations. We demonstrate how Levy distributed relocations reduce oversampling and thus further optimize the intermittent search strategy in the critical situation of rare targets.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.