Related papers: L\'{e}vy robotics
L\'evy walks are continuous time random walks with spatio-temporal coupling of jump lengths and waiting times, often used to model superdiffusive spreading processes such as animals searching for food, tracer motion in weakly chaotic…
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…
The question of how "smart" active agents, like insects, microorganisms, or future colloidal robots need to steer to optimally reach or discover a target, such as an odor source, food, or a cancer cell in a complex environment has recently…
1. Understanding how to find targets with very limited information is a topic of interest in many disciplines. In ecology, such research has often focused on the development of two movement models: i) the L\'evy walk and; ii) the composite…
Robotic spacecraft have helped expand our reach for many planetary exploration missions. Most ground mobile planetary exploration robots use wheeled or modified wheeled platforms. Although extraordinarily successful at completing intended…
Recent advancements in robotics have transformed industries such as manufacturing, logistics, surgery, and planetary exploration. A key challenge is developing efficient motion planning algorithms that allow robots to navigate complex…
The rapid development of robotics has benefited by more and more people putting their attention to it. With the demand for robots is growing for the purpose of fulfilling tasks instead of humans, how to control the robot better is becoming…
Motion planning is a fundamental problem in autonomous robotics that requires finding a path to a specified goal that avoids obstacles and takes into account a robot's limitations and constraints. It is often desirable for this path to also…
In this paper, we conduct a literature review of laws of motion based on stochastic search strategies which are mainly focused on exploring highly dynamic environments. In this regard, stochastic search strategies represent an interesting…
Robots will bring search and rescue (SaR) in disaster response to another level, in case they can autonomously take over dangerous SaR tasks from humans. A main challenge for autonomous SaR robots is to safely navigate in cluttered…
Swarm robotic search is concerned with searching targets in unknown environments (e.g., for search and rescue or hazard localization), using a large number of collaborating simple mobile robots. In such applications, decentralized swarm…
These notes from a graduate class at the Unuversidad Autonoma de Madrid analyze a search behavior known as Area Resticted Search (ARS), widespread in the animal kingdom, and optimal when the resources that one is after are "patchy". In the…
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…
Autonomous navigation in dynamic environment heavily depends on the environment and its topology. Prior knowledge of the environment is not usually accurate as the environment keeps evolving in time. Since robot is continuously evaluating…
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…
We introduce and study a new problem concerning the exploration of a geometric domain by mobile robots. Consider a line segment $[0,I]$ and a set of $n$ mobile robots $r_1,r_2,..., r_n$ placed at one of its endpoints. Each robot has a {\em…
A L\'evy random medium, in a given space, is a random point process where the distances between points, a.k.a. targets, are long-tailed. Random walks visiting the targets of a L\'evy random medium have been used to model many (physical,…
How long does it take a random searcher to visit all sites of a given domain? This time, known as the cover time, is a key observable to quantify the efficiency of exhaustive searches, which require a complete exploration of an area and not…
Consider search on an infinite line involving an autonomous robot starting at the origin of the line and an oblivious moving target at initial distance $d \geq 1$ from it. The robot can change direction and move anywhere on the line with…
Autonomous systems will play an essential role in many applications across diverse domains including space, marine, air, field, road, and service robotics. They will assist us in our daily routines and perform dangerous, dirty and dull…