Optimal cooperative searching using purely repulsive interactions
From MaRDI portal
Publication:485673
DOI10.1016/J.JTBI.2014.07.027zbMATH Open1303.92136arXiv1311.1549OpenAlexW2963294713WikidataQ46622956 ScholiaQ46622956MaRDI QIDQ485673FDOQ485673
Alan Blatt, Noriyuki P. Tani, David A. Quint, Ajay Gopinathan
Publication date: 13 January 2015
Published in: Journal of Theoretical Biology (Search for Journal in Brave)
Abstract: Foraging, either solitarily or collectively, is a necessary behavior for survival that is demonstrated by many organisms. Foraging can be collectively optimized by utilizing communication between the organisms. Examples of such communication range from high level strategic foraging by animal groups to rudimentary signaling among unicellular organisms. Here we systematically study the simplest form of communication via long range repulsive interactions between two diffusing Brownian searchers on a one-dimensional lattice. We show that the mean first passage time for either of them to reach a fixed target depends non-monotonically on the range of the interaction and can be optimized for a repulsive range that is comparable to the average spacing between searchers. Our results suggest that even the most rudimentary form of collective searching does in fact lower the search time for the foragers suggesting robust mechanisms for search optimization in cellular communities
Full work available at URL: https://arxiv.org/abs/1311.1549
Recommendations
- Collaborative search on the plane without communication
- Optimal foraging by zooplankton within patches: The case of \(Daphnia\)
- Natural strategies for search
- Optimality of collective choices: a stochastic approach
- Biomimicry of social foraging bacteria for distributed optimization: Models, principles, and emergent behaviors
Cites Work
Cited In (3)
This page was built for publication: Optimal cooperative searching using purely repulsive interactions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q485673)