arXiv · 1010.2728
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.
Explore related subjects
Keep this discovery
Carlo Barbieri, Simona Cocco, Rémi Monasson. 2011-03-16. On the trajectories and performance of Infotaxis, an information-based greedy search algorithm. https://doi.org/10.1209/0295-5075%2F94%2F20005
Cite the original work for its findings. Save a collection to share your selection of sources.