Related papers: Deterministic ants in labirynth -- information gai…
We consider deterministic walks on square, triangular and hexagonal two dimensional lattices. In each case, there is a scatterer at every site that can be in one of two states that force the walker to turn either to his/her immediate right…
We discuss various features of the trajectories of spider monkeys looking for food in a tropical forest, as observed recently in an extensive {\it in situ} study. Some of the features observed can be interpreted as the result of social…
Pheromones are a chemical substance produced and released by ants as means of communication. In this work we present the minimum amount of pheromones necessary and sufficient for a colony of ants (identical mobile agents) to…
A dynamic autonomy allocation framework automatically shifts how much control lies with the human versus the robotics autonomy, for example based on factors such as environmental safety or user preference. To investigate the question of…
We study a distributed coordination mechanism for uniform agents located on a circle. The agents perform their actions in synchronised rounds. At the beginning of each round an agent chooses the direction of its movement from clockwise,…
This paper proposes a cooperative environmental learning algorithm working in a fully distributed manner. A multi-robot system is more effective for exploration tasks than a single robot, but it involves the following challenges: 1) online…
A spacially extended model of the collective behavior of a large number of locally acting organisms is proposed in which organisms move probabilistically between local cells in space, but with weights dependent on local morphogenetic…
We show that two independent elephant random walks on the integer lattice $\mathbb{Z}$ meet each other finitely often or infinitely often depends on whether the memory parameter $p$ is strictly larger than $3/4$ or not. Asymptotic results…
There are three fundamental asks from a ranking algorithm: it should scale to handle a large number of items, sort items accurately by their utility, and impose a total order on the items for logical consistency. But here's the catch-no…
Most of the grand challenges of humanity today involve complex agent-based systems, such as epidemiology, economics or ecology. However, remains as a pending task the challenge of identifying the general principles underlying their…
Path planning in robotics often requires finding high-quality solutions to continuously valued and/or high-dimensional problems. These problems are challenging and most planning algorithms instead solve simplified approximations. Popular…
We develop an analytical method to calculate encounter times of two random walkers in one dimension when each individual is segregated in its own spatial domain and shares with its neighbor only a fraction of the available space, finding…
We introduce a model for information spreading among a population of N agents diffusing on a square LxL lattice, starting from an informed agent (Source). Information passing from informed to unaware agents occurs whenever the relative…
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…
How choices are made within noisy environments is a central question in the neuroscience of decision making. Previous work has characterized temporal accumulation of evidence for decision-making in static environments. However, real-world…
The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…
This article concerns the review of a special class of swarm intelligence based algorithms for solving optimization problems and these algorithms can be referred to as social algorithms. Social algorithms use multiple agents and the social…
Gradual pattern mining allows for extraction of attribute correlations through gradual rules such as: "the more X, the more Y". Such correlations are useful in identifying and isolating relationships among the attributes that may not be…
Ants are very small insects.They are capable to find food even they are complete blind. The ants lives in their nest and their job is to search food while they get hungry. We are not interested in their living style, such as how they live,…
In a rendezvous task, some mobile agents dispersed in a network have to gather at an arbitrary common site. We consider the rendezvous problem on the infinite labeled line, with $2$ agents, without communication, and a synchronous notion of…