Comparison of pure and combined search strategies for single and multiple targets
V.V. Palyulin (1), Vladimir N. Mantsevich (2), R. Klages (3), R., Metzler (4), A.V. Chechkin (4,5) ((1) Dept. of Chemical Engineering and, Biotechnology, University of Cambridge, (2) Physics Dept., Moscow State, University, (3) Queen Mary U. of London, School of Math. Sci.
TL;DR
This paper compares the effectiveness of pure and combined search strategies, including Brownian and Lévy searches, for locating single and multiple targets on a line, using measures of reliability and efficiency.
Contribution
It introduces a comparative analysis of pure and combined Lévy and Brownian search strategies for single and multiple targets, highlighting their relative performance.
Findings
Lévy search can outperform Brownian search in certain conditions.
Combining different Lévy distributions can enhance search efficiency.
Multiple targets influence the optimal search strategy.
Abstract
We address the generic problem of random search for a point-like target on a line. Using the measures of search reliability and efficiency to quantify the random search quality, we compare Brownian search with L\'evy search based on long-tailed jump length distributions. We then compare these results with a search process combined of two different long-tailed jump length distributions. Moreover, we study the case of multiple targets located by a L\'evy searcher.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.