Skip to main content

This is a preprint.

It has not yet been peer reviewed by a journal.

The National Library of Medicine is running a pilot to include preprints that result from research funded by NIH in PMC and PubMed.

ArXiv logoLink to ArXiv
[Preprint]. 2026 Jan 29:arXiv:2601.22233v1. [Version 1]

Zero-information limit of a collective olfactory search model

Francesco Boccardo, Simone Di Marino, Agnese Seminara
PMCID: PMC12869412  PMID: 41647238

Abstract

We address the problem of how individuals can integrate efficiently their private behavior with information provided by others within a group. To this end, we consider the model of collective search introduced in [https://doi.org/10.1103/PhysRevE.102.012402], under a minimal setting with no olfactory information. Agents combine a private exploratory behavior and a social imitation consisting in aligning to their neighbors, and weigh the two contributions with a single ``trust" parameter that controls their relative influence. We find that an optimal trust parameter exists even in the absence of olfactory information, as was observed in the original model. Optimality is dictated by the need to explore the minimal region of space that contains the target. An optimal trust parameter emerges from this constraint because it it tunes imitation, which induces a collective mechanism of inertia affecting the size and path of the swarm. We predict the optimal trust parameter for cohesive groups where all agents interact with one another. We show how optimality depends on the initialization of the agents and the unknown location of the target, in close agreement with numerical simulations. Our results may be leveraged to optimize the design of swarm robotics or to understand information integration in organisms with decentralized nervous systems such as cephalopods.

Full Text Availability

The license terms selected by the author(s) for this preprint version do not permit archiving in PMC. The full text is available from the preprint server.


Articles from ArXiv are provided here courtesy of arXiv

RESOURCES