On the trajectories and performance of Infotaxis, an information-based greedy search algorithm
Carlo Barbieri, Simona Cocco, R\'emi Monasson

TL;DR
This paper introduces a continuous-space version of Infotaxis, analyzing its trajectories and success metrics in 2D and 3D, and discusses potential extensions beyond greedy strategies.
Contribution
It develops a continuous-space formulation of Infotaxis and provides analytical and numerical insights into its trajectories and performance.
Findings
Trajectories characterized in 2D and 3D
Success probability estimates provided
Search time estimates analyzed
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.
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.
