The dynamics of collective sorting robot-like ants and ant-like robots
Proceedings of the first international conference on simulation of adaptive behavior on From animals to animats
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Editor's introduction: stigmergy
Artificial Life
An object oriented approach to lattice gas modeling
Future Generation Computer Systems - Special issue on high performance computing and networking Europe 1999
A Minimal Model for the Formation of an Ant Cemetery
Proceedings of the Fourth International Conference on Cellular Automata for Research and Industry: Theoretical and Practical Issues on Cellular Automata
A survey on parallel ant colony optimization
Applied Soft Computing
| Hi-index | 0.00 |
Some ant species are known to gather and sort corpses in an auto-organized way. In this contribution, we propose a new cellular ant colony algorithm for sorting and clustering. This algorithm mimics the behavior of real ants. The cellular automata nature of our algorithm implies a straightforward parallelization. The rule consists of a pick-up, a deposition and a diffusion. Our probabilistic pick-up rule is based on some spatial neighborhood information. We observe that probabilistic pick-up yields compact clusters and also speeds up the clustering process. In the long run, a single cluster emerges. Moreover, in the presence of several corpse species, our algorithm sorts the corpses into distinct clusters. Thus our model reproduces realistic results, but however we do not observe any collective effect.