Related papers: The two-nest ants process on triangle-series-paral…
In this work we studied the trajectories, velocities and densities of ants when egressing under controlled levels of stress produced by a chemical repellent at different concentrations. We found that, unlike other animals escaping under…
We introduce the study of the ant colony house-hunting problem from a distributed computing perspective. When an ant colony's nest becomes unsuitable due to size constraints or damage, the colony must relocate to a new nest. The task of…
In recent experiments by Richardson et al. ((2010), PLoS ONE 5(3): e9621. doi:10.1371/ journal.pone.0009621) ant motion out of the nest is shown to be a non-stationary process intriguingly similar to the dynamics encountered in…
The traffic-like collective movement of ants on a trail can be described by a stochastic cellular automaton model. We have earlier investigated its unusual flow-density relation by using various mean field approximations and computer…
Stochastic modeling of movement behavior provides a valuable way to understand how complex motion can be generated from relatively simple building blocks. Ants demonstrate sophisticated social behavior ranging from foraging to nest…
Many ant species employ distributed population density estimation in applications ranging from quorum sensing [Pra05], to task allocation [Gor99], to appraisal of enemy colony strength [Ada90]. It has been shown that ants estimate density…
We consider the problem of extracting accurate average ant trajectories from many (possibly inaccurate) input trajectories contributed by citizen scientists. Although there are many generic software tools for motion tracking and specific…
In a self-organizing particle system, an abstraction of programmable matter, simple computational elements called particles with limited memory and communication self-organize to solve system-wide problems of movement, coordination, and…
We consider a continuous mathematical description of a population of ants and simulate numerically their foraging behavior using a system of partial differential equations of chemotaxis type. We show that this system accurately reproduces…
In this review we integrate results of long term experimental study on ant "language" and intelligence which were fully based on fundamental ideas of Information Theory, such as the Shannon entropy, the Kolmogorov complexity, and the…
A mathematical model of garden ants (Laius japonicus) is introduced herein to investigate the relationship between the distribution of the degree of stochasticity in following pheromone trails and the group foraging efficiency. Numerical…
A few of ant robots are dropped to a labirynth, formed by a square lattice with a small number of nodes removed. Ants move according to a deterministic algorithm designed to explore all corridors. Each ant remembers the shape of corridors…
With the increasing demand and complexity of networks, factors such as balancing the load, improving the performance, reducing delay and finding optimal path between nodes in a computer network have become crucial. The traditional routing…
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…
We propose two modeling approaches to describe the dynamics of ant battles, starting from laboratory experiments on the behavior of two ant species, the invasive Lasius neglectus and the authocthonus Lasius paralienus. This work is mainly…
A recently proposed stochastic cellular automaton model ({\it J. Phys. A 35, L573 (2002)}), motivated by the motions of ants in a trail, is investigated in detail in this paper. The flux of ants in this model is sensitive to the probability…
We propose an active walker model for the motion of individual ants communicating via chemical signals. It is assumed that communication takes the form of a time-dependent pheromone field that feedbacks into the motion ants through…
We propose a new probabilistic ant-based heuristic (ANTH-LS) for the longest simple cycle problem. This NP-hard problem has numerous real-world applications in complex networks, including efficient construction of graph layouts, analysis of…
We investigated the emerging traffic patterns of Argentine ants (Linepithema humile) as they navigated a narrow bridge between their nest and a food source. By tracking ant movements in experiments with varying bridge widths and colony…
We analyse the dynamics of fishing vessels with different home ports in an area where these vessels, in choosing where to fish, are influenced by their own experience in the past and by their current observation of the locations of other…