On the trajectories and performance of Infotaxis, an information-based greedy search algorithm
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
‘Infotaxis’ as a strategy for searching without gradients
Vergassola, M., Villermaux, E., & Shraiman, B. I. (2007) · Nature · doi:10.1038/nature05464 · Cited by 890
Cited by
Hutchinson, M., Oh, H., & Chen, W.-H. (2017) · Information Fusion · doi:10.1016/j.inffus.2016.11.010 · Cited by 349
Olfactory Sensing and Navigation in Turbulent Environments
Reddy, G., Murthy, V. N., & Vergassola, M. (2022) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-031720-032754 · Cited by 100
Emergent behaviour and neural dynamics in artificial agents tracking odour plumes
Singh, S. H., van Breugel, F., Rao, R. P. N., & Brunton, B. W. (2023) · Nature Machine Intelligence · doi:10.1038/s42256-022-00599-w · Cited by 61
“However, in intermittent odour landscapes, gradient-based algorithms cannot be successful, and the Infotaxis algorithm was developed as an alternative 57–60 .”
MethodInformation Theory of Chemotactic Agents Using Both Spatial and Temporal Gradient Sensing
Rode, J., Novak, M., & Friedrich, B. M. (2024) · PRX Life · doi:10.1103/prxlife.2.023012 · Cited by 26
Optimal policies for Bayesian olfactory search in turbulent flows
Heinonen, R. A., Biferale, L., Celani, A., & Vergassola, M. (2023) · Physical Review E · doi:10.1103/physreve.107.055105 · Cited by 19
“Spiraling behavior under infotaxis is well-known, having been observed in the original paper [24] as well as subsequent work [25, 34, 46], and it can be connected to the theory of search games: one can show that the optimal minimax trajectory for searching for a single point in a plane is an…”
Background
Metadata
- Authors
- Barbieri, C., Cocco, S., & Monasson, R.
- Venue
- EPL (Europhysics Letters)
- Publisher
- IOP Publishing
- Published
- 2011-04-01
- Volume
- 94
- Issue
- 2
- Pages
- 20005
- ISSN
- 0295-5075 (ISSN-L)
- 1286-4854
- OpenAlex
- W2084487808
- Cited by
- 33
- References
- 1
- FWCI
- 0.71
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the trajectories and performance of Infotaxis, an information-based greedy search algorithm. https://app.cochat.ai/papers/10.1209/0295-5075/94/20005
- The paper
- Barbieri, C., Cocco, S., & Monasson, R. (2011). On the trajectories and performance of Infotaxis, an information-based greedy search algorithm. EPL (Europhysics Letters). https://doi.org/10.1209/0295-5075/94/20005
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.