Papers
Topics
Authors
Recent
Search
2000 character limit reached

Collective olfactory search in a turbulent environment

Published 21 Nov 2019 in physics.bio-ph and cond-mat.stat-mech | (1911.09499v1)

Abstract: Finding the distant source of an odor dispersed by a turbulent flow is a vital task for many organisms, either for foraging or for mating purposes. At the level of individual search, animals like moths have developed effective strategies to solve this very difficult navigation problem based on the noisy detection of odor concentration and wind velocity alone. When many individuals concurrently perform the same olfactory search task, without any centralized control, sharing information about the decisions made by the members of the group can potentially increase the performance. But how much of this information is actually valuable and exploitable for the collective task ? Here we show that, in a model of a swarm of agents inspired by moth behavior, there is an optimal way to blend the private information about odor and wind detections with the publicly available information about other agents' heading direction. At optimality, the time required for the first agent to reach the source is essentially the shortest flight time from the departure point to the target. Conversely, agents who discard public information are several fold slower and groups that do not put enough weight on private information perform even worse. Our results then suggest an efficient multi-agent olfactory search algorithm that could prove useful in robotics, for instance in the identification of sources of harmful volatile compounds.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.