On the trajectories and performance of Infotaxis, an information-based greedy search algorithm
Simons Center for Systems Biology, Institute for Advanced Study - Einstein Drive, Princeton, NJ 08540, USA
2 Lab. Physique Statistique de l'ENS, CNRS and Univ. Paris 6 - 24 rue Lhomond, 75231 Paris, France, EU
3 Lab. Physique Théorique de l'ENS, CNRS and Univ. Paris 6 - 24 rue Lhomond, 75231 Paris, France, EU
Accepted: 16 March 2011
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.
PACS: 05.40.-a – Fluctuation phenomena, random processes, noise, and Brownian motion / 02.50.Tt – Inference methods / 87.19.lt – Sensory systems: visual, auditory, tactile, taste, and olfaction
© EPLA, 2011