In this paper we propose a mathematical model for studying the phenomenon of division of labor in ant colonies. Inside this model we investigate how simple task allocation mechanisms can be used to achieve an optimal division of labor.
We believe the proposed model captures the essential biological features of division of labor in ant colonies and is general enough to study a variety of different task allocation mechanisms. Within this model we propose a distributed randomized algorithm for task allocation that imposes only minimal requirements on the ants; it uses a constant amount of memory and relies solely on a primitive binary feedback function to sense the current labor allocation. We show that with high probability the proposed algorithm converges to a near-optimal division of labor in time which is proportional to the logarithm of the colony size.
|Original language||English (US)|
|Title of host publication||Distributed Computing - 28th International Symposium, DISC 2014, Proceedings|
|Number of pages||15|
|State||Published - 2014|
|Event||28th International Symposium on Distributed Computing, DISC 2014 - Austin, United States|
Duration: Oct 12 2014 → Oct 15 2014
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||28th International Symposium on Distributed Computing, DISC 2014|
|Period||10/12/14 → 10/15/14|
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)