Related papers: Ants on the highway
We present two generalised ants (LLRRRL and LLRLRLL) which admit both highway behaviours and other kinds of emergent behaviours from initially finite configurations. This limits the well known Highway conjecture on Langton's ant as it shows…
Many insects like ants communicate chemically via chemotaxis. This allows them to build large trail systems which in many respects are similar to human-build highway networks. Using a recently proposed stochastic cellular automaton model we…
The automaton known as `Langton's ant' exhibits a dynamical transition from a disordered phase to an ordered phase where the particle dynamics (the ant) produces a regular periodic pattern (called `highway'). Despite the simplicity of its…
A modified version of Langton's ant is considered. The modified automaton is allowed to go straight $N$-th step instead of turning. The cell state, however, is changed as usually. Depending on the value of $N$ the automaton exhibits…
Motivated by recent experimental work of Burd et al., we propose a model of bi-directional ant-traffic on pre-existing ant-trails. It captures in a simple way some of the generic collective features of movements of real ants on a trail.…
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 report experimental results on unidirectional traffic-like collective movement of ants on trails. Our work is primarily motivated by fundamental questions on the collective spatio-temporal organization in systems of interacting motile…
The idea of sensitivity in ant colony systems has been exploited in hybrid ant-based models with promising results for many combinatorial optimization problems. Heterogeneity is induced in the ant population by endowing individual ants with…
The virtual ant introduced by C. Langton has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate any boolean circuit with the trajectory of a single ant. This proves the P-hardness…
A class of countable infinite graphs with unbounded vertex degree is considered. In these graphs, the vertices of large degree `repel' each other, which means that the path distance between two such vertices cannot be smaller than a certain…
In 2002, Chowdhury et al. introduced a simplified model aimed at depicting the dynamics of single-lane unidirectional ant traffic. Despite efforts, an exact solution for the stationary state of this ant-trail model remains elusive. The…
Efficient transportation, a hot topic in nonlinear science, is essential for modern societies and the survival of biological species. Biological evolution has generated a rich variety of successful solutions, which have inspired engineers…
We investigate the organization of traffic flow on preexisting uni- and bidirectional ant trails. Our investigations comprise a theoretical as well as an empirical part. We propose minimal models of uni- and bi-directional traffic flow…
We present a model of ant traffic considering individual ants as self-propelled particles undergoing single file motion on a one-dimensional trail. Recent experiments on unidirectional ant traffic in well-formed natural trails showed that…
We consider a mechanical system of three ants on the floor, which move according to two independt rules: Rule A - forces the velocity of any given ant to always point at a neighboring ant, and Rule B - forces the velocity of every ant to be…
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…
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…
If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…
A geometric graph is a graph embedded in the plane with vertices at points and edges drawn as curves (which are usually straight line segments) between those points. The average transversal complexity of a geometric graph is the number of…
In this paper we consider a model for the diffusion of a population in a strip-shaped field, where the growth of the species is governed by a Fisher-KPP equation and which is bounded on one side by a road where the species can have a…