期刊
JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL
卷 42, 期 43, 页码 -出版社
IOP PUBLISHING LTD
DOI: 10.1088/1751-8113/42/43/434008
关键词
-
资金
- Agence Nationale de la Recherche (ANR)
- MEC, Spain [CGL2007-64387/CLI]
- AECID, Spain [A/018685/08]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据