Task allocation in ant colonies

Alejandro Cornejo, Anna Dornhaus, Nancy Lynch, Radhika Nagpal

Research output: Chapter in Book/Report/Conference proceedingConference contribution

29 Scopus citations

Abstract

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 languageEnglish (US)
Title of host publicationDistributed Computing - 28th International Symposium, DISC 2014, Proceedings
EditorsFabian Kuhn
PublisherSpringer-Verlag
Pages46-60
Number of pages15
ISBN (Electronic)9783662451731
DOIs
StatePublished - 2014
Event28th International Symposium on Distributed Computing, DISC 2014 - Austin, United States
Duration: Oct 12 2014Oct 15 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8784
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other28th International Symposium on Distributed Computing, DISC 2014
Country/TerritoryUnited States
CityAustin
Period10/12/1410/15/14

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Task allocation in ant colonies'. Together they form a unique fingerprint.

Cite this