Related papers: Ant foraging and minimal paths in simple graphs
Collective behavior of active elements inspired by mass of biological organisms is addressed. Especially, two topics are focused on among amazing behaviors performed by colony of ants. First, task allocation phenomena are treated from the…
When studying unconstrained behaviour and allowing mice to leave their cage to navigate a complex labyrinth, the mice exhibit foraging behaviour in the labyrinth searching for rewards, returning to their home cage now and then, e.g. to…
Collective motion by animal groups is affected by internal interactions, external constraints and the influx of information. A quantitative understanding of how these different factors give rise to different modes of collective motion is,…
Detecting communities from complex networks has recently triggered great interest. Aiming at this problem, a new ant colony optimization strategy building on the Markov random walks theory, which is named as MACO, is proposed in this paper.…
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…
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…
Using elementary distributed computing techniques we suggest an explanation for two unexplained phenomena in regards to ant colonies, (a) a substantial amount of ants in an ant colony are idle, and (b) the observed low survivability of new…
The shortest path problem is among the most fundamental combinatorial optimization problems to answer reachability queries. It is hard to deter-mine which vertices or edges are visited during shortest path traversals. In this paper, we…
Random walks have been proposed as a simple method of efficiently searching, or disseminating information throughout, communication and sensor networks. In nature, animals (such as ants) tend to follow correlated random walks, i.e., random…
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.…
We prove that metric graph with the minimal growth of the number of possible endpoints of a random walk is the union of several linear paths coming out of the same vertex
Coverage Path Planning (CPP) aims at finding an optimal path that covers the whole given space. Due to the NP-hard nature, CPP remains a challenging problem. Bio-inspired algorithms such as Ant Colony Optimisation (ACO) have been exploited…
A team of identical and oblivious ant-like agents - a(ge)nts - leaving pheromone traces, are programmed to jointly patrol an area modeled as a graph. They perform this task using simple local interactions, while also achieving the important…
This paper studies the asymptotic behavior of several continuous-time dynamical systems which are analogs of ant colony optimization algorithms that solve shortest path problems. Local asymptotic stability of the equilibrium corresponding…
Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…
Continuous Ant-based Topology Search (CANTS) is a previously introduced novel nature-inspired neural architecture search (NAS) algorithm that is based on ant colony optimization (ACO). CANTS utilizes a continuous search space to…
Social insects such as ants communicate via pheromones which allows them to coordinate their activity and solve complex tasks as a swarm, e.g. foraging for food. This behavior was shaped through evolutionary processes. In computational…
During route discovery of mobile ad hoc network, broadcasting of route request and route reply packets are the essential operations for finding the path between two ends. In such situations, intermediate node which may or may not belongs…
There is great potential if we understand how nature functions, particularly the animals taking down from the ant to the larger animals. In this paper we will make an attempt to learn about ants colonization processing by studying their…
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…