An Upper and Lower Bound for the Convergence Time of House-Hunting in Temnothorax Ant Colonies
We study the problem of house-hunting in ant colonies, where ants reach consensus on a new nest and relocate their colony to that nest, from a distributed computing perspective. We propose a house-hunting algorithm that is biologically inspired by Temnothorax ants. Each ant is modeled as a probabilistic agent with limited power, and there is no central control governing the ants. We show an Ω(logn) lower bound on the running time of our proposed house-hunting algorithm, where n is the number of ants. Furthermore, we show a matching upper bound of expected O(logn) rounds for environments with only one candidate nest for the ants to move to. Our work provides insights into the house-hunting process, giving a perspective on how environmental factors such as nest quality or a quorum rule can affect the emigration process.
| Medienart: |
E-Artikel |
|---|
| Erscheinungsjahr: |
2022 |
|---|---|
| Erschienen: |
2022 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:29 |
|---|---|
| Enthalten in: |
Journal of computational biology : a journal of computational molecular cell biology - 29(2022), 4 vom: 22. Apr., Seite 344-357 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Zhang, Emily [VerfasserIn] |
|---|
| Links: |
|---|
| Themen: |
Ant colony |
|---|
| Anmerkungen: |
Date Completed 21.02.2023 Date Revised 21.02.2023 published: Print-Electronic Citation Status MEDLINE |
|---|
| doi: |
10.1089/cmb.2021.0364 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
NLM337277923 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLM337277923 | ||
| 003 | DE-627 | ||
| 005 | 20231225234042.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 231225s2022 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1089/cmb.2021.0364 |2 doi | |
| 028 | 5 | 2 | |a pubmed24n1124.xml |
| 035 | |a (DE-627)NLM337277923 | ||
| 035 | |a (NLM)35196137 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Zhang, Emily |e verfasserin |4 aut | |
| 245 | 1 | 3 | |a An Upper and Lower Bound for the Convergence Time of House-Hunting in Temnothorax Ant Colonies |
| 264 | 1 | |c 2022 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ƒaComputermedien |b c |2 rdamedia | ||
| 338 | |a ƒa Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Date Completed 21.02.2023 | ||
| 500 | |a Date Revised 21.02.2023 | ||
| 500 | |a published: Print-Electronic | ||
| 500 | |a Citation Status MEDLINE | ||
| 520 | |a We study the problem of house-hunting in ant colonies, where ants reach consensus on a new nest and relocate their colony to that nest, from a distributed computing perspective. We propose a house-hunting algorithm that is biologically inspired by Temnothorax ants. Each ant is modeled as a probabilistic agent with limited power, and there is no central control governing the ants. We show an Ω(logn) lower bound on the running time of our proposed house-hunting algorithm, where n is the number of ants. Furthermore, we show a matching upper bound of expected O(logn) rounds for environments with only one candidate nest for the ants to move to. Our work provides insights into the house-hunting process, giving a perspective on how environmental factors such as nest quality or a quorum rule can affect the emigration process | ||
| 650 | 4 | |a Journal Article | |
| 650 | 4 | |a Research Support, Non-U.S. Gov't | |
| 650 | 4 | |a Research Support, U.S. Gov't, Non-P.H.S. | |
| 650 | 4 | |a ant colony | |
| 650 | 4 | |a collective behavior | |
| 650 | 4 | |a convergence time | |
| 650 | 4 | |a decision-making | |
| 700 | 1 | |a Zhao, Jiajia |e verfasserin |4 aut | |
| 700 | 1 | |a Lynch, Nancy |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of computational biology : a journal of computational molecular cell biology |d 1998 |g 29(2022), 4 vom: 22. Apr., Seite 344-357 |w (DE-627)NLM074738046 |x 1557-8666 |7 nnns |
| 773 | 1 | 8 | |g volume:29 |g year:2022 |g number:4 |g day:22 |g month:04 |g pages:344-357 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1089/cmb.2021.0364 |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a GBV_NLM | ||
| 951 | |a AR | ||
| 952 | |d 29 |j 2022 |e 4 |b 22 |c 04 |h 344-357 | ||