Distributed House-Hunting in Ant Colonies
We introduce the study of the ant colony house-hunting problem from a distributed computing perspective. When an ant colony's nest becomes unsuitable due to size constraints or damage, the colony relocates to a new nest. The task of identifying and evaluating the quality of potential new nests...
Main Authors: | Ghaffari, Mohsen, Musco, Cameron Nicholas, Radeva, Tsvetomira T., Lynch, Nancy Ann |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery (ACM)
2016
|
Online Access: | http://hdl.handle.net/1721.1/100843 https://orcid.org/0000-0003-2197-6806 https://orcid.org/0000-0003-3045-265X https://orcid.org/0000-0003-4213-9898 https://orcid.org/0000-0003-1261-6681 |
Similar Items
-
A MODEL AND ANALYSIS OF HOUSE-HUNTING IN ANT COLONIES
by: Nancy Lynch
Published: (2022) -
An Upper and Lower Bound for the Convergence Time of House-Hunting in Temnothorax Ant Colonies
by: Zhang, Emily, et al.
Published: (2022) -
The Power of Social Information in Ant-Colony House-Hunting: A Computational Modeling Approach
by: Zhao, Jiajia, et al.
Published: (2022) -
Brief Announcement: Partial Reversal Acyclicity
by: Radeva, Tsvetomira, et al.
Published: (2012) -
Ant-inspired density estimation via random walks
by: Musco, Cameron Nicholas, et al.
Published: (2018)