On the trajectories and performance of Infotaxis, an information-based greedy search algorithm

Abstract

We present a continuous-space version of Infotaxis, a search algorithm where a searcher greedily moves to maximize the gain in information about the position of the target to be found. Using a combination of analytical and numerical tools we study the nature of the trajectories in two and three dimensions. The probability that the search is successful and the running time of the search are estimated. A possible extension to non-greedy search is suggested.

6 pages, 7 figures, accepted for publication in EPL

References in corpus (1)

• Olfactory search at high Reynolds number

Cited by in corpus (5)

• Sensing and decision-making in random search
• Searching for a source without gradients: how good is infotaxis and how to beat it
• Optimal policies for Bayesian olfactory search in turbulent flows
• Research Notes: Gradient sensing in Bayesian chemotaxis
• Optimal trajectories for Bayesian olfactory search in turbulent flows: the low information limit and beyond