Related papers: Self-organizing nest migration dynamics synthesis …
In this paper, we study a probabilistic reinforcement-learning model for ants searching for the shortest path(s) between their nest and a source of food. In this model, the nest and the source of food are two distinguished nodes $N$ and $F$…
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…
We propose a physical framework for ant navigation of chemical trails. For this, we use controlled experiments in which individuals follow narrow pheromone trails, for which ants display oscillatory motion, as previously reported in the…
Using a simple model for the trail formation of ants, the relation between i)the schedule of feeding which represents the unsteady natural environment, ii)emerging patterns of trails connecting a nest with food resources, and iii)the…
The Ant Colony System (ACS) is, next to Ant Colony Optimization (ACO) and the MAX-MIN Ant System (MMAS), one of the most efficient metaheuristic algorithms inspired by the behavior of ants. In this article we present three novel parallel…
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 this paper, a novel swarm intelligent algorithm is proposed called ant nesting algorithm (ANA). The algorithm is inspired by Leptothorax ants and mimics the behavior of ants searching for positions to deposit grains while building a new…
Over the years, population protocols with the goal of reaching consensus have been studied in great depth. However, many systems in the real-world do not result in all agents eventually reaching consensus, but rather in the opposite: they…
Many species of ants forage by building up two files: an outbound one moving from the nest to the foraging area, and a nestbound one, returning from it to the nest. Those files are eventually submitted to different threats. If the danger is…
Core periphery structure represents a meso-scale structure in networks, characterized by a dense interconnection of core nodes and sparse connections among peripheral nodes. In this paper, we introduce an innovative approach for detecting…
The Santa Fe Ant model problem has been extensively used to investigate, test and evaluate Evolutionary Computing systems and methods over the past two decades. There is however no literature on its program structures that are…
In this work we present an algorithm for covering continuous connected domains by ant-like robots with very limited capabilities. The robots can mark visited places with pheromone marks and sense the level of the pheromone in their local…
The paper presents an ant colony optimization metaheuristic for collaborative planning. Collaborative planning is used to coordinate individual plans of self-interested decision makers with private information in order to increase the…
Social insect colonies and ensemble machine learning methods represent two of the most successful examples of decentralized information processing in nature and computation respectively. Here we develop a rigorous mathematical framework…
Local interactions of uncoordinated individuals produce the collective behaviors of many biological systems, inspiring much of the current research in programmable matter. A striking example is the spontaneous assembly of fire ants into…
The evolution of ants is marked by remarkable adaptations that allowed the development of very complex social systems. To identify how ant-specific adaptations are associated with patterns of molecular evolution, we searched for signs of…
This study proposes a distributed algorithm that makes agents' adaptive grouping entrap multiple targets via automatic decision making, smooth flocking, and well-distributed entrapping. Agents make their own decisions about which targets to…
In this paper we analyze a system of PDEs recently introduced in [P. Amorim, {\it Modeling ant foraging: a {chemotaxis} approach with pheromones and trail formation}], in order to describe the dynamics of ant foraging. The system is made of…
We present a dynamic algorithm for solving the Longest Common Subsequence Problem using Ant Colony Optimization Technique. The Ant Colony Optimization Technique has been applied to solve many problems in Optimization Theory, Machine…
Self-organizing complex systems typically are comprised of a large number of frequently similar components or events. Through their process, a pattern at the global-level of a system emerges solely from numerous interactions among the…