Infinite grid exploration by disoriented robots
We study the infinite grid exploration (IGE) problem by a swarm of autonomous mobile
robots. Those robots are opaque, have limited visibility capabilities, and run using …
robots. Those robots are opaque, have limited visibility capabilities, and run using …
Black hole search in dynamic tori
We investigate the black hole search problem by a set of mobile agents in a dynamic torus.
Black hole is defined to be a dangerous stationary node which has the capability to destroy …
Black hole is defined to be a dangerous stationary node which has the capability to destroy …
Energy consumption of group search on a line
J Czyzowicz, K Georgiou, R Killick, E Kranakis… - arXiv preprint arXiv …, 2019 - arxiv.org
Consider two robots that start at the origin of the infinite line in search of an exit at an
unknown location on the line. The robots can only communicate if they arrive at the same …
unknown location on the line. The robots can only communicate if they arrive at the same …
Building a nest by an automaton
A robot modeled as a deterministic finite automaton has to build a structure from material
available to it. The robot navigates in the infinite oriented grid Z * ZZ× Z. Some cells of the …
available to it. The robot navigates in the infinite oriented grid Z * ZZ× Z. Some cells of the …
Probabilistically faulty searching on a half-line
Abstract We study p-Faulty Search, a variant of the classic cow-path optimization problem,
where a unit speed robot searches the half-line (or 1-ray) for a hidden item. The searcher is …
where a unit speed robot searches the half-line (or 1-ray) for a hidden item. The searcher is …
[PDF][PDF] Finding water on poleless using melomaniac myopic chameleon robots
Q Bramas, P Lafourcade… - … Conference on Fun with …, 2020 - drops.dagstuhl.de
In 2042, the exoplanet exploration program, launched in 2014 by NASA, finally discovers a
new exoplanet so-called Poleless, due to the fact that it is not subject to any magnetism. A …
new exoplanet so-called Poleless, due to the fact that it is not subject to any magnetism. A …
Graph exploration by a deterministic memoryless automaton with pebbles
D Pattanayak, A Pelc - Discrete Applied Mathematics, 2024 - Elsevier
A mobile agent, which is an autonomous device navigating in a graph, has to explore a
given graph by visiting all of its nodes. We adopt the (arguably) weakest possible model of …
given graph by visiting all of its nodes. We adopt the (arguably) weakest possible model of …
Weighted group search on a line
K Georgiou, J Lucier - … Symposium on Algorithms and Experiments for …, 2020 - Springer
We introduce and study a new search-type problem on the line with 2 searchers. As in so-
called evacuation search problems with multiple searchers, we require that all searchers …
called evacuation search problems with multiple searchers, we require that all searchers …
Weighted group search on a line & implications to the priority evacuation problem
K Georgiou, J Lucier - Theoretical Computer Science, 2023 - Elsevier
We introduce and study a new search-type problem on the line with 2 searchers. As in so-
called evacuation search problems with multiple searchers, we require that all searchers …
called evacuation search problems with multiple searchers, we require that all searchers …
Exploration of high-dimensional grids by finite automata
S Dobrev, L Narayanan, J Opatrny… - 46th International …, 2019 - drops.dagstuhl.de
We consider the problem of finding a treasure at an unknown point of an n-dimensional
infinite grid, n>= 3, by initially collocated finite automaton agents (scouts/robots). Recently …
infinite grid, n>= 3, by initially collocated finite automaton agents (scouts/robots). Recently …