Searching for a source without gradients: how good is infotaxis and how to beat it
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Infotaxis is a popular search algorithm designed to track a source of odour in a turbulent environment using information provided by odour detections. To exemplify its capabilities, the source-tracking task was framed as a partially observable Markov decision process consisting in finding, as fast as possible, a stationary target hidden in a two-dimensional grid using stochastic partial observations of the target location. Here, we provide an extended review of infotaxis, together with a toolkit for devising better strategies. We first characterize the performance of infotaxis in domains from one dimension to four dimensions. Our results show that, while being suboptimal, infotaxis is reliable (the probability of not reaching the source approaches zero), efficient (the mean search time scales as expected for the optimal strategy) and safe (the tail of the distribution of search times decays faster than any power law, though subexponentially). We then present three possible ways of beating infotaxis, all inspired by methods used in artificial intelligence: tree search, heuristic approximation of the value function, and deep reinforcement learning. The latter is able to find, without any prior human knowledge, the (near) optimal strategy. Altogether, our results provide evidence that the margin of improvement of infotaxis towards the optimal strategy gets smaller as the dimensionality increases.
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
Planning and acting in partially observable stochastic domains
Kaelbling, L. P., Littman, M. L., & Cassandra, A. R. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00023-x · Cited by 4,149
‘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 9×
“The physical intuition behind this algorithm is, quoting the authors, that “information accumulates faster close to the source because cues arrive at a higher rate, hence tracking the maximum rate of information acquisition will guide the searcher to the source much like concentration gradients in chemotaxis” [8].”
BackgroundResultInfluentialOdor Landscapes in Turbulent Environments
Celani, A., Villermaux, E., & Vergassola, M. (2014) · Physical Review X · doi:10.1103/physrevx.4.041015 · Cited by 203 · cited 1×
“An animal able to detect concentration levels would receive a highly intermittent signal consisting of sharp peaks separated by long periods with no measurable concentration [7, 9].”
BackgroundOlfactory 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
Machine learning strategies for path-planning microswimmers in turbulent flows
Alageshan, J. K., Verma, A. K., Bec, J., & Pandit, R. (2020) · Physical Review E · doi:10.1103/physreve.101.043110 · Cited by 88
Surfing on Turbulence: A Strategy for Planktonic Navigation
Monthiller, R., Loisy, A., Koehl, M. A. R., Favier, B., & Eloy, C. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.064502 · Cited by 36
Self-citation
Cited by
Information 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
“One recent and promising variant, dubbed “space-aware infotaxis” (SAI), essentially combines infotaxis with the QMDP policy [25].”
BackgroundMethodInfluentialBiological processes as exploratory dynamics
Kondev, J., Kirschner, M., Garcia, H. G., Salmon, G. L., & Phillips, R. (2026) · Biophysical Journal · doi:10.1016/j.bpj.2025.09.009 · Cited by 4
Biological Processes as Exploratory Dynamics
(2025) · doi:10.1101/2025.06.06.657857 · Cited by 4
Metadata
- Authors
- Loisy, A., & Eloy, C.
- Venue
- Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Publisher
- The Royal Society
- Published
- 2022-06
- Volume
- 478
- Issue
- 2262
- ISSN
- 1364-5021 (ISSN-L)
- 1471-2946
- OpenAlex
- W4226211339
- Cited by
- 50
- References
- 6
- FWCI
- 2.49
- 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
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.