Abstract
We study the distributed task allocation problem in multi-agent systems, where each agent selects a task in such a way that, collectively, they achieve a proper global task allocation. In this paper, inspired by specialization on division of labor in ant colonies, we propose several scalable and efficient algorithms to dynamically allocate the agents as the task demands change. The algorithms have their own pros and cons, with respect to (1) how fast they react to dynamic demands change, (2) how many agents need to switch tasks, (3) whether extra agents are needed, and (4) whether they are resilient to faults.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Notes
- 1.
Although the assumption that every agent knows all the demands seems to be strong, as long as each demand is known by some agent, all the demands can be propagated to everyone in \(O(\log n )\) rounds by gossiping (see broadcasting in Sect. 2).
- 2.
With high probability, which means with probability at least \(1 - 1/{\text {poly}}(n)\). Note that if there are \({\text {poly}}(n)\) events and each one holds w.h.p., then all of them simultaneously hold w.h.p. by an union bound argument.
References
Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235–253 (2006)
Beshers, S.N., Fewell, J.H.: Models of division of labor in social insects. Annu. Rev. Entomol. 46(1), 413–440 (2001)
Bonabeau, E., Theraulaz, G., Deneubourg, J.-L.: Quantitative study of the fixed threshold model for the regulation of division of labour in insect societies. Proc. R. Soc. Lond. B: Biol. Sci. 263(1376), 1565–1569 (1996)
Bonabeau, E., Theraulaz, G., Deneubourg, J.-L.: Fixed response thresholds and the regulation of division of labor in insect societies. Bull. Math. Biol. 60, 753–807 (1998)
Cornejo, A., Dornhaus, A., Lynch, N., Nagpal, R.: Task allocation in ant colonies. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 46–60. Springer, Heidelberg (2014). doi:10.1007/978-3-662-45174-8_4
Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proceedings of 6th ACM Symposium on Principles of Distributed Computing (PODC), pp. 1–12 (1987)
Dertouzos, M.L., Mok, A.K.: Multiprocessor online scheduling of hard-real-time tasks. IEEE Trans. Softw. Eng. 15(12), 1497–1506 (1989)
Dornhaus, A., Franks, N.: Individual and collective cognition in ants and other insects (Hymenoptera: Formicidae). Myrmecological News 11, 215–226 (2008)
Drucker, A., Kuhn, F., Oshman, R.: The communication complexity of distributed task allocation. In: Proceedings of 31st ACM Symposium on Principles of Distributed Computing (PODC), pp. 67–76 (2012)
Feinerman, O., Korman, A.: The ANTS problem. Distrib. Comput. 30, 149–168 (2012). Extended abstracts appeared in PODC, : (together with Z, p. 2012. Lotker and J.S, Sereni) and in DISC
Frieze, A.M., Grimmett, G.R.: The shortest-path problem for graphs with random arc-lengths. Discret. Appl. Math. 10(1), 57–77 (1985)
Gerkey, B.P., Matarić, M.J.: A formal analysis and taxonomy of task allocation in multi-robot systems. Int. J. Robot. Res. 23(9), 939–954 (2004)
Ghaffari, M., Musco, C., Radeva, T., Lynch, N.A.: Distributed house-hunting in ant colonies. In: Proceedings of 34th ACM Symposium on Principles of Distributed Computing (PODC), pp. 57–66 (2015)
Giakkoupis, G., Kermarrec, A.-M., Woelfel, P.: Gossip protocols for renaming and sorting. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 194–208. Springer, Heidelberg (2013). doi:10.1007/978-3-642-41527-2_14
Gordon, D.M.: The organization of work in social insect colonies. Complexity 8(1), 43–46 (2002)
Gordon, D.M., Goodwin, B.C., Trainor, L.: A parallel distributed model of the behaviour of ant colonies. J. of Theor. Biol. 156(3), 293–307 (1992)
Greene, M.J., Gordon, D.M.: Interaction rate informs harvester ant task decisions. Behav. Ecol. 18(2), 451–455 (2007)
Hughes, W.O., Sumner, S., Borm, S.V., Boomsma, J.J.: Worker caste polymorphism has a genetic basis in acromyrmex leafcutting ants. Proc. Nat. Acad. Sci. 100(16), 9394–9397 (2003)
Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: IEEE 44th Symposium on Foundations of Computer Science (FOCS), pp. 482–491 (2003)
Kozub, S.: Amazons new drone delivery plan includes package parachutes. The Verge (2017)
Langner, T., Uitto, J., Stolz, D., Wattenhofer, R.: Fault-tolerant ANTS. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 31–45. Springer, Heidelberg (2014). doi:10.1007/978-3-662-45174-8_3
Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46–61 (1973)
Liu, L., Shell, D.A.: Large-scale multi-robot task allocation via dynamic partitioning and distribution. Auton. Robot. 33(3), 291–307 (2012)
Musco, C., Su, H., Lynch, N.A.: Ant-inspired density estimation via random walks: extended abstract. In Procceedings of 35th ACM Symposium on Principles of Distributed Computing (PODC), pp. 469–478 (2016)
Pacala, S.W., Gordon, D.M., Godfray, H.C.J.: Effects of social group size on information transfer and task allocation. Evol. Ecol. 10(2), 127–165 (1996)
Pereira, H.M., Gordon, D.M.: A trade-off in task allocation between sensitivity to the environment and response time. J. Theor. Bio. 208(2), 165–184 (2001)
Radeva, T.: A Symbiotic Perspective on Distributed Algorithms and Social Insects. Dissertation, Massachusetts Institute of Technology (2017)
Radeva, T., Dornhaus, A., Lynch, N., Nagpal, R., Su, H.-H.: Costs of task allocation with local feedback: effects of colony size and extra workers in social insects and other multi-agent systems. Preliminary version appeared as a brief announcement In: Proceedings of 28th Symposium on Distributed Computing (DISC), pp. 657–658 (2014, submitted)
Robinson, G.E.: Regulation of division of labor in insect societies. Annu. Rev. Entomol. 37(1), 637–665 (1992)
Sendova-Franks, A.B., Franks, N.R.: Spatial relationships within nests of the ant leptothorax unifasciatus (latr.) and their implications for the division of labour. Anim. Behav. 50(1), 121–136 (1995)
Tripet, F., Nonacs, P.: Foraging for work and age-based polyethism: the roles of age and previous experience on task choice in ants. Ethology 110(11), 863–877 (2004)
Wilson, E.O.: Caste and division of labor in leaf-cutter ants (Hymenoptera: Formicidae: Atta). Behav. Ecol. Sociobiol. 7(2), 157–165 (1980)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Su, HH., Su, L., Dornhaus, A., Lynch, N. (2017). Ant-Inspired Dynamic Task Allocation via Gossiping. In: Spirakis, P., Tsigas, P. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2017. Lecture Notes in Computer Science(), vol 10616. Springer, Cham. https://doi.org/10.1007/978-3-319-69084-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-69084-1_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-69083-4
Online ISBN: 978-3-319-69084-1
eBook Packages: Computer ScienceComputer Science (R0)