Related papers: Levy Flights, Non-local Search and Simulated Annea…
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…
We analyze confining mechanisms for L\'{e}vy flights. When they evolve in suitable external potentials their variance may exist and show signatures of a superdiffusive transport. Two classes of stochastic jump - type processes are…
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…
We study the simulated annealing algorithm based on the kinetic Langevin dynamics, in order to find the global minimum of a non-convex potential function. For both the continuous time formulation and a discrete time analogue, we obtain the…
We consider stochastic systems involving general -- non-Gaussian and asymmetric -- stable processes. The random quantities, either a stochastic force or a waiting time in a random walk process, explicitly depend on the position. A…
The functional method to derive the fractional Fokker-Planck equation for probability distribution from the Langevin equation with Levy stable noise is proposed. For the Cauchy stable noise we obtain the exact stationary probability density…
We propose a new gradient descent algorithm with added stochastic terms for finding the global optimizers of nonconvex optimization problems. A key component in the algorithm is the adaptive tuning of the randomness based on the value of…
We analyze confining mechanisms for L\'evy flights evolving under an influence of external potentials. Given a stationary probability density function (pdf), we address the reverse engineering problem: design a jump-type stochastic process…
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…
Simulated annealing solves global optimization problems by means of a random walk in a cooling energy landscape based on the objective function and a temperature parameter. However, if the temperature is decreased too quickly, this…
In this paper we propose and advocate the use of the so called L\'evy flights as a driving mechanism for a class of stochastic optimization computations. This proposal, for some reasons overlooked until now, is - in author's opinion - very…
Many important challenges in science and technology can be cast as optimization problems. When viewed in a statistical physics framework, these can be tackled by simulated annealing, where a gradual cooling procedure helps search for…
We propose a new stochastic algorithm (generalized simulated annealing) for computationally finding the global minimum of a given (not necessarily convex) energy/cost function defined in a continuous D-dimensional space. This algorithm…
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 consider Levy flights subject to external force fields. This anomalous transport process is described by two approaches, a Langevin equation with Levy noise and the corresponding generalized Fokker-Planck equation containing a fractional…
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 -…
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…
In this paper, we consider the generalised (higher order) Langevin equation for the purpose of simulated annealing and optimisation of nonconvex functions. Our approach modifies the underdamped Langevin equation by replacing the Brownian…
We investigate the non-Langevin relative of the L\'{e}vy-driven Langevin random system, under an assumption that both systems share a common (asymptotic, stationary, steady-state) target pdf. The relaxation to equilibrium in the fractional…
This paper explores the distance-based relative state estimation problem in large-scale systems, which is hard to solve effectively due to its high-dimensionality and non-convexity. In this paper, we alleviate this inherent hardness to…