On the trajectories and performance of Infotaxis, an information-based greedy search algorithm
Résumé
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 estimate the probability that the search is successful and study the nature of the trajectories in two and three dimensions. We also discuss the analogy with confined polyelectrolytes and possible extensions to non-greedy searches.