Seeking and sharing information in collective olfactory search.

Searching for a target is a task of fundamental importance for many living organisms. Long-distance search guided by olfactory cues is a prototypical example of such a process. The searcher receives signals that are sparse and very noisy, making the task extremely difficult. Information-seeking strategies have thus been proven to be effective for individual olfactory search and their extension to collective search has been the subject of some exploratory studies. Here, we study in detail how sharing information among members of a group affects the search behavior when agents adopt information-seeking strategies as Infotaxis and its recently introduced variant, Space-Aware Infotaxis. Our results show that even in absence of explicit coordination, sharing information leads to an effective partitioning of the search space among agents that results in a significant decrease of mean search times.

More Is Faster: Why Population Size Matters in Biological Search.

Many biological scenarios have multiple cooperating searchers, and the timing of the initial first contact between any one of those searchers and its target is critically important. However, we are unaware of biological models that predict how long it takes for the first of many searchers to discover a target. We present a novel mathematical model that predicts initial first contact times between searchers and targets distributed at random in a volume. We compare this model with the extreme first passage time approach in physics that assumes an infinite number of searchers all initially positioned at the same location. We explore how the number of searchers, the distribution of searchers and targets, and the initial distances between searchers and targets affect initial first contact times. Given a constant density of uniformly distributed searchers and targets, the initial first contact time decreases linearly with both search volume and the number of searchers. However, given only a single target and searchers placed at the same starting location, the relationship between the initial first contact time and the number of searchers shifts from a linear decrease to a logarithmic decrease as the number of searchers grows very large. More generally, we show that initial first contact times can be dramatically faster than the average first contact times and that the initial first contact times decrease with the number of searchers, while the average search times are independent of the number of searchers. We suggest that this is an underappreciated phenomenon in biology and other collective search problems.

Distributed Adaptive Search in T Cells: Lessons From Ants.

There are striking similarities between the strategies ant colonies use to forage for food and immune systems use to search for pathogens. Searchers (ants and cells) use the appropriate combination of random and directed motion, direct and indirect agent-agent interactions, and traversal of physical structures to solve search problems in a variety of environments. An effective immune response requires immune cells to search efficiently and effectively for diverse types of pathogens in different tissues and organs, just as different species of ants have evolved diverse search strategies to forage effectively for a variety of resources in a variety of habitats. Successful T cell search is required to initiate the adaptive immune response in lymph nodes and to eradicate pathogens at sites of infection in peripheral tissue. Ant search strategies suggest novel predictions about T cell search. In both systems, the distribution of targets in time and space determines the most effective search strategy. We hypothesize that the ability of searchers to sense and adapt to dynamic targets and environmental conditions enhances search effectiveness through adjustments to movement and communication patterns. We also suggest that random motion is a more important component of search strategies than is generally recognized. The behavior we observe in ants reveals general design principles and constraints that govern distributed adaptive search in a wide variety of complex systems, particularly the immune system.