Chasing information to search in random environments
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
We discuss search strategies for finding sources of particles transported in a random environment and detected by the searcher(s). The mixing of the particles in the environment is supposed to be strong, so that strategies based on concentration-gradient ascent are not viable. These dilute conditions are common in natural environments typical of searches performed by insects and birds. The sparseness of the detections constitutes the major stumbling block in developing efficient olfactory robots to detect mines, chemical leaks, etc. We first discuss a search strategy, 'infotaxis', recently introduced for the search of a single source by a single robot. Decisions are made by locally maximizing the rate of acquisition of information on the location of the source and they balance exploration and exploitation. We present numerical simulations demonstrating the efficiency of the method and, most importantly, its robustness to lack of detailed modeling of the transport of particles in the random environment. We then introduce a novel formulation of infotaxis for collective searches where a swarm of robots is available and must be coordinated. Gains in the search time are impressive and the method can be further generalized to deal with conflicts arising in the identification of multiple sources.
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
Self-citation
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
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
Self-citationEmergent 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
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
“On the other hand, the present diffusive model has seen significant use in past work (e.g. [24, 25, 34]) and in any case leads to a good benchmark search problem which is far from trivial to solve.”
BackgroundSelf-citation
Metadata
- Authors
- Masson, J.-B., Bechet, M. B., & Vergassola, M.
- Venue
- Journal of Physics A: Mathematical and Theoretical
- Publisher
- IOP Publishing
- Published
- 2009-10-13
- Volume
- 42
- Issue
- 43
- Pages
- 434009
- ISSN
- 1751-8113 (ISSN-L)
- 1751-8121
- OpenAlex
- W1974274407
- Cited by
- 72
- References
- 1
- FWCI
- 1.20
- Type
- journal article
- Language
- en
- Open access
- closed
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: Chasing information to search in random environments. https://app.cochat.ai/papers/10.1088/1751-8113/42/43/434009
- The paper
- Masson, J.-B., Bechet, M. B., & Vergassola, M. (2009). Chasing information to search in random environments. Journal of Physics A: Mathematical and Theoretical. https://doi.org/10.1088/1751-8113/42/43/434009
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.