About: Ant mill is a research topic. Over the lifetime, 3 publications have been published within this topic receiving 6 citations. The topic is also known as: death spiral.
TL;DR: Evaluated pheromone-based searching algorithm, which creates ant mills and provides a solution to overcome them, brings a significantly better food delivery.
Abstract: Computer scientists use animal-based phenomenon as source of inspiration to develop swarm algorithm and simulate their behaviors. One example is ants foraging. For finding food the ants are moving randomly in any direction. After they found food, they spread pheromones to make it easy for other ants to find it. The more ants, the better the pheromone trail. This pheromone-based search algorithm should increase the efficiency of food delivery. However, this phenomenon includes a problem termed ant mill, which is well known. An ant mill is happening when many ants are spreading their pheromones in a closed area. This causes an overlapping of the pheromones and creates a circle trail. Consequently, the ants move in a never-ending loop without ever reaching the food source. The result is starvation and death. In this paper, we take a closer look at three types of search algorithms. Especially pheromone-based searching algorithm, which creates ant mills and provide a solution to overcome them. Our evaluation shows that a pheromone-based search algorithm with ant mill prevention brings a significantly better food delivery.
TL;DR: It is shown that on any finite graph which is not a tree, and on $\mathbb Z^d$ with $d\geq 2$, the Ant RW almost surely gets eventually trapped into some directed circuit which will be followed forever, and eventually escapes to infinity and satisfies a law of large number with a random limit which is explicitly identified.
Abstract: We define here a \textit{directed edge reinforced random walk} on a connected locally finite graph. As the name suggests, this walk keeps track of its past, and gives a bias towards directed edges previously crossed proportional to the exponential of the number of crossings. The model is inspired by the so called \textit{Ant Mill phenomenon}, in which a group of army ants forms a continuously rotating circle until they die of exhaustion. For that reason we refer to the walk defined in this work as the \textit{Ant RW}. Our main result justifies this name. Namely, we will show that on any finite graph which is not a tree, and on $\mathbb Z^d$ with $d\geq 2$, the Ant RW almost surely gets eventually trapped into some directed circuit which will be followed forever. In the case of~$\mathbb Z$ we show that the Ant RW eventually escapes to infinity and satisfies a law of large number with a random limit which we explicitly identify.
TL;DR: In this paper, a continuous random walk model based on diffusion-advection partial differential equations that combine memory and reinforcement is presented. And the model is shown to be stable.
Abstract: Under certain circumstances, a swarm of a species of trail-laying ants known as army ants can become caught in a doomed revolving motion known as the death spiral, in which each ant follows the one in front of it in a never-ending loop until they all drop dead from exhaustion. This phenomenon, as well as the ordinary motions of many ant species and certain slime molds, can be modeled using reinforced random walks and random walks with memory. In a reinforced random walk, the path taken by a moving particle is influenced by the previous paths taken by other particles. In a random walk with memory, a particle is more likely to continue along its line of motion than change its direction. Both memory and reinforcement have been studied independently in random walks with interesting results. However, real biological motion is a result of a combination of both memory and reinforcement. In this paper, we construct a continuous random walk model based on diffusion-advection partial differential equations that combine memory and reinforcement. We find an axi-symmetric, time-independent solution to the equations that resembles the death spiral. Finally, we prove numerically that the obtained steady-state solution is stable.