相关论文: Bidimensional intermittent search processes: an al…
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…
This review examines intermittent target search strategies, which combine phases of slow motion, allowing the searcher to detect the target, and phases of fast motion during which targets cannot be detected. We first show that intermittent…
In many random search processes of interest in chemistry, biology or during rescue operations, an entity must find a specific target site before the latter becomes inactive, no longer available for reaction or lost. We present exact results…
L\'evy walks are random walk processes whose step-lengths follow a long-tailed power-law distribution. Due to their abundance as movement patterns of biological organisms, significant theoretical efforts have been devoted to identifying the…
What is the fastest way of finding a randomly hidden target? This question of general relevance is of vital importance for foraging animals. Experimental observations reveal that the search behaviour of foragers is generally intermittent:…
Search problems at various scales involve a searcher, be it a molecule before reaction or a foraging animal, which performs an intermittent motion. Here we analyze a generic model based on such type of intermittent motion, in which the…
We investigated the relationships between search efficiency, movement strategy, and non-local communication in the biological context of animal foraging. We considered situations where the members of a population of foragers perform either…
Autonomous robots are commonly tasked with the problem of area exploration and search for certain targets or artifacts of interest to be tracked. Traditionally, the problem formulation considered is that of complete search and thus -…
This book chapter introduces to the problem to which extent search strategies of foraging biological organisms can be identified by statistical data analysis and mathematical modeling. A famous paradigm in this field is the Levy Flight…
We present a simple model to study L\'{e}vy-flight foraging in a finite landscape with countable targets. In our approach, foraging is a step-based exploratory random search process with a power-law step-size distribution $P(l) \propto…
The L\'evy hypothesis states that inverse square L\'evy walks are optimal search strategies because they maximise the encounter rate with sparse, randomly distributed, replenishable targets. It has served as a theoretical basis to interpret…
An efficient search algorithm is very crucial in robotic area, especially for exploration missions, where the target availability is unknown and the condition of the environment is highly unpredictable. In a very large environment, it is…
We study the efficiency of search processes based on Levy flights (LFs) with power-law distributed jump lengths in the presence of an external drift. While LFs turn out to be efficient search processes when relative to the starting point…
Optimal random foraging strategy has gained increasing concentrations. It is shown that L\'evy flight is more efficient compared with the Brownian motion when the targets are sparse. However, standard L\'evy flight generally cannot be…
We study the efficiency of random search processes based on L{\'e}vy flights with power-law distributed jump lengths in the presence of an external drift, for instance, an underwater current, an airflow, or simply the bias of the searcher…
We solve a problem of non-convex stochastic optimisation with help of simulated annealing of Levy flights of a variable stability index. The search of the ground state of an unknown potential is non-local due to big jumps of the Levy…
L\'evy flights represent the best strategy to randomly search for a target in an unknown environment, and have been widely observed in many animal species. Here, we inspect and discuss recent results concerning human behavior and cognition.…
The search for hidden targets is a fundamental problem in many areas of science, engineering, and other fields. Studies of search processes often adopt a probabilistic framework, in which a searcher randomly explores a spatial domain for a…
We study analytically an intermittent search process in one dimension. There is an immobile target at the origin and a searcher undergoes a discrete time jump process starting at $x_0\geq0$, where successive jumps are drawn independently…
We consider a stationary prey in a given region of space and we aim at detecting optimal foraging strategies. On the one hand, when the prey is uniformly distributed, the best possible strategy for the forager is to be stationary and…