[HTML][HTML] How many ants does it take to find the food?
Abstract Consider the Ants Nearby Treasure Search (ANTS) problem, where n mobile
agents, initially placed at the origin of an infinite grid, collaboratively search for an …
agents, initially placed at the origin of an infinite grid, collaboratively search for an …
[PDF][PDF] Evacuating robots from a disk using face-to-face communication
J Czyzowicz, K Georgiou, E Kranakis… - Discrete …, 2020 - dmtcs.episciences.org
4+ 2≈ 5.199. We improve both the upper and lower bound on the evacuation time of a unit
disk. Namely, we present a new non-trivial algorithm whose evacuation time is at most 5.628 …
disk. Namely, we present a new non-trivial algorithm whose evacuation time is at most 5.628 …
Exploring an infinite space with finite memory scouts
Consider a small number of scouts exploring the infinite d-dimensional grid with the aim of
hitting a hidden target point. Each scout is controlled by a probabilistic finite automaton that …
hitting a hidden target point. Each scout is controlled by a probabilistic finite automaton that …
The ANTS problem
O Feinerman, A Korman - Distributed Computing, 2017 - Springer
Abstract We introduce the Ants Nearby Treasure Search problem, which models natural
cooperative foraging behavior such as that performed by ants around their nest. In this …
cooperative foraging behavior such as that performed by ants around their nest. In this …
A tight lower bound for semi-synchronous collaborative grid exploration
Recently, there has been a growing interest in grid exploration by agents with limited
capabilities. We show that the grid cannot be explored by three semi-synchronous finite …
capabilities. We show that the grid cannot be explored by three semi-synchronous finite …
Line recovery by programmable particles
GA Di Luna, P Flocchini, G Prencipe… - Proceedings of the 19th …, 2018 - dl.acm.org
Shape formation has been recently studied in distributed systems of programmable
particles. In this paper we consider the shape recovery problem of restoring the shape when …
particles. In this paper we consider the shape recovery problem of restoring the shape when …
Distributed house-hunting in ant colonies
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 …
computing perspective. When an ant colony's nest becomes unsuitable due to size …
[HTML][HTML] Lower and upper competitive bounds for online directed graph exploration
KT Foerster, R Wattenhofer - Theoretical Computer Science, 2016 - Elsevier
We study the problem of exploring all nodes of an unknown directed graph. A searcher has
to construct a tour that visits all nodes, but only has information about the parts of the graph it …
to construct a tour that visits all nodes, but only has information about the parts of the graph it …
Evacuating from ℓp unit disks in the wireless model
K Georgiou, S Leizerovich, J Lucier, S Kundu - Theoretical Computer …, 2023 - Elsevier
The search-type problem of evacuating 2 robots in the wireless model from the (Euclidean)
unit disk was first introduced and studied by Czyzowicz et al.(2014)[13]. Since then, the …
unit disk was first introduced and studied by Czyzowicz et al.(2014)[13]. Since then, the …
Fault-tolerant ANTS
In this paper, we study a variant of the Ants Nearby Treasure Search problem, where n
mobile agents, controlled by finite automata, search collaboratively for a treasure hidden by …
mobile agents, controlled by finite automata, search collaboratively for a treasure hidden by …