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 probabili...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Mary Ann Liebert Inc
2022
|
| Online Access: | https://hdl.handle.net/1721.1/144295 |