Abstract
Stigmergy describes a class of mechanisms that mediate animal to animal interaction through the environment. Recently this concept has proved interesting for use in multi-agent systems, as it provides a simple framework for agent interaction and coordination. However, determining the global system behavior that will arise from local stigmergetic interactions is a complex problem. In this paper stigmergetic mechanisms are modeled using simple reinforcement learners, called learning automata. We show that using automata to model stigmergy, the learning problem can be asymptotically approximated by an automata game. Existing convergence results for automata games enables us to understand these stigmergetic methods and predict their global behavior. A simple multi-pheromone example is described and analyzed through its corresponding automata game.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beckers, R., Holland, O.E., Deneubourg, J.L.: From local actions to global tasks: Stigmergy and collective robotics. Artificial Life IV 181, 189 (1994)
Brueckner, S.: Return from the Ant: Synthetic Ecosystems for Manufacturing Control. PhD thesis, PhD Dissertation, Humboldt-Universitat Berlin, Germany 1999 (2000)
Dorigo, M., Bonabeau, E., Theraulaz, G.: Ant algorithms and stigmergy. FUTURE GENER. COMPUT. SYST. 16(8), 851–871 (2000)
Dorigo, M., Stützle, T.: Ant Colony Optimization. Bradford Books. MIT Press, Cambridge (2004)
Grassé, P.P.: La reconstruction du nid et les coordinations interindividuelles chez Bellicositermes natalensis et Cubitermes sp. la théorie de la stigmergie: Essai d’interprétation du comportement des termites constructeurs. Insectes Sociaux 6(1), 41–80 (1959)
Holland, O., Melhuish, C.: Stigmergy, self-organization, and sorting in collective robotics. Artificial Life 5(2), 173–202 (1999)
Narendra, K., Thathachar, M.: Learning Automata: An Introduction. Prentice-Hall International, Englewood Cliffs (1989)
Nowé, A., Verbeeck, K., Peeters, M.: Learning automata as a basis for multi-agent reinforcement learning. In: Tuyls, K., et al. (eds.) LAMAS 2005. LNCS (LNAI), vol. 3898, pp. 71–85. Springer, Heidelberg (2006)
Nowé, A., Verbeeck, K., Vrancx, P.: Multi-type ant colony: The edge disjoint paths problem. In: Buell, D.A. (ed.) Algorithmic Number Theory. LNCS, vol. 3076, pp. 202–213. Springer, Heidelberg (2004)
Panait, L., Luke, S.: A pheromone-based utility model for collaborative foraging. In: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004, pp. 36–43 (2004)
Thathachar, M.A.L., Sastry, P.S.: Networks of Learning Automata: Techniques for Online Stochastic Optimization. Kluwer Academic Publishers, Dordrecht (2004)
Theraulaz, G., Bonabeau, E.: Modelling the collective building of complex architectures in social insects with lattice swarms. Journal of Theoretical Biology 177(4), 381–400 (1995)
Theraulaz, G., Bonabeau, E.: A brief history of stigmergy. Artificial Life 5(2), 97–116 (1999)
Valckenears, P., Kollingbaum, M.: Multi-agent coordination and control using stigmergy applied to manufacturing control. Mutli-agents systems and applications, 317–334 (2001)
Verbeeck, K., Nowe, A.: Colonies of learning automata. IEEE Transactions on Systems, Man and Cybernetics, Part B 32(6), 772–780 (2002)
Wheeler Jr., R., Narendra, K.: Decentralized learning in finite Markov chains. IEEE Transactions on Automatic Control 31(6), 519–526 (1986)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Vrancx, P., Verbeeck, K., Nowé, A. (2007). Analyzing Stigmergetic Algorithms Through Automata Games. In: Tuyls, K., Westra, R., Saeys, Y., Nowé, A. (eds) Knowledge Discovery and Emergent Complexity in Bioinformatics. KDECB 2006. Lecture Notes in Computer Science(), vol 4366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71037-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-71037-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71036-3
Online ISBN: 978-3-540-71037-0
eBook Packages: Computer ScienceComputer Science (R0)