The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
‘Infotaxis’ as a strategy for searching without gradients
Abstract
Chemotactic bacteria rely on local concentration gradients to guide them towards the source of a nutrient. Such local cues pointing towards the location of the source are not always available at macroscopic scales because mixing in a flowing medium breaks up regions of high concentration into random and disconnected patches. Thus, animals sensing odours in air or water detect them only intermittently as patches sweep by on the wind or currents. A macroscopic searcher must devise a strategy of movement based on sporadic cues and partial information. Here we propose a search algorithm, which we call 'infotaxis', designed to work under such conditions. Any search process can be thought of as acquisition of information on source location; for infotaxis, information plays a role similar to concentration in chemotaxis. The infotaxis strategy locally maximizes the expected rate of information gain. We demonstrate its efficiency using a computational model of odour plume propagation and experimental data on mixing flows. Infotactic trajectories feature 'zigzagging' and 'casting' paths similar to those observed in the flight of moths. The proposed search algorithm is relevant to the design of olfactory robots, but the general idea of infotaxis can be applied more broadly in the context of searching with sparse information.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Both Infotaxis 58 and our approach are formulated as solutions to plume tracking as a partially observable Markov decision process 17 .”
From Emergent behaviour and neural dynamics in artificial agents tracking odour plumes (2023) · cites this paper as [58]
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
Berg, H. C. (2025) · Princeton University Press eBooks · doi:10.1515/9780691279886 · Cited by 2,367
Berg, H. C., & Purcell, E. M. (1977) · Biophysical Journal · doi:10.1016/s0006-3495(77)85544-6 · Cited by 1,758
Particles and fields in fluid turbulence
Falkovich, G., Gawȩdzki, K., & Vergassola, M. (2001) · Reviews of Modern Physics · doi:10.1103/revmodphys.73.913 · Cited by 1,264
Self-citationOdor Plumes and How Insects Use Them
Murlis, J., Elkinton, J. S., & Cardé, R. T. (1992) · Annual Review of Entomology · doi:10.1146/annurev.en.37.010192.002445 · Cited by 732
Shraiman, B. I., & Siggia, E. D. (2000) · Nature · doi:10.1038/35015000 · Cited by 675
Self-citationMechanisms in Insect Olfaction
Payne, T. L., BIRCH, M. C., & KENNEDY, C. E. J. (1986) · Medical Entomology and Zoology · Cited by 527
Cited by
A high-bias, low-variance introduction to Machine Learning for physicists
Mehta, P., Bukov, M., Wang, C.-H., Day, A. G. R., Richardson, C., Fisher, C. K., & Schwab, D. J. (2019) · Physics Reports · doi:10.1016/j.physrep.2019.03.001 · Cited by 920
The Psychology and Neuroscience of Curiosity
Kidd, C., & Hayden, B. Y. (2015) · Neuron · doi:10.1016/j.neuron.2015.09.010 · Cited by 1,026
Intermittent search strategies
Bénichou, O., Loverdo, C., Moreau, M., & Voituriez, R. (2011) · Reviews of Modern Physics · doi:10.1103/revmodphys.83.81 · Cited by 765
T cell migration, search strategies and mechanisms
Krummel, M. F., Bartumeus, F., & Gérard, A. (2016) · Nature Reviews Immunology · doi:10.1038/nri.2015.16 · Cited by 423
Locating the Source of Diffusion in Large-Scale Networks
Pinto, P. C., Thiran, P., & Vetterli, M. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.068702 · Cited by 409
Metadata
- Authors
- Vergassola, M., Villermaux, E., & Shraiman, B. I.
- Affiliations
- Centre National de la Recherche Scientifique (FR)
- Aix-Marseille Université (FR)
- University of California, Santa Barbara (US)
- Corresponding author
- Shraiman, Boris I.
- Venue
- Nature
- Published
- 2007-01
- Volume
- 445
- Issue
- 7126
- Pages
- 406-409
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W2046695302
- Cited by
- 890
- References
- 33
- Citations by year
- 2026: 61 · 2025: 62 · 2024: 64 · 2023: 55 · 2022: 71 · 2021: 63 · 2020: 57 · 2019: 66 · 2018: 30 · 2017: 50 · 2016: 39 · 2015: 34 · 2014: 48 · 2013: 38 · 2012: 25
- FWCI
- 12.33
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- HAL (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Topics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Diffusion and Search Dynamics
- Life Sciences › Agricultural and Biological Sciences › Insect Science › Insect Pheromone Research and Control
- Physical Sciences › Engineering › Control and Systems Engineering › Extremum Seeking Control Systems
- Keywords
- infotaxis, search strategies, chemotaxis, information gain, mixing flow, moth flight
- MeSH terms
- Algorithms, Animals, Chemotaxis, Computer Simulation, Models, Biological, Moths, Odorants, Pheromones, Robotics, Smell, Entropy, Biomimetics
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: ‘Infotaxis’ as a strategy for searching without gradients. https://app.cochat.ai/papers/10.1038/nature05464
- The paper
- Vergassola, M., Villermaux, E., & Shraiman, B. I. (2007). ‘Infotaxis’ as a strategy for searching without gradients. Nature. https://doi.org/10.1038/nature05464
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.