Group search on the line
In this paper we consider the group search problem, or evacu-ation problem, in which k
mobile entities (\calM\calE s) located on the line perform search for a specific destination …
mobile entities (\calM\calE s) located on the line perform search for a specific destination …
[HTML][HTML] Linear search by a pair of distinct-speed robots
Two mobile robots are initially placed at the same point on an infinite line. Each robot may
move on the line in either direction not exceeding its maximal speed. The robots need to find …
move on the line in either direction not exceeding its maximal speed. The robots need to find …
Almost-optimal deterministic treasure hunt in unweighted graphs
S Bouchard, Y Dieudonné, A Labourel… - ACM Transactions on …, 2023 - dl.acm.org
A mobile agent navigating along edges of a simple connected unweighted graph, either
finite or countably infinite, has to find an inert target (treasure) hidden in one of the nodes …
finite or countably infinite, has to find an inert target (treasure) hidden in one of the nodes …
Fast two-robot disk evacuation with wireless communication
In the fast evacuation problem, we study the path planning problem for two robots who want
to minimize the worst-case evacuation time on the unit disk. The robots are initially placed at …
to minimize the worst-case evacuation time on the unit disk. The robots are initially placed at …
Almost-optimal deterministic treasure hunt in arbitrary graphs
S Bouchard, Y Dieudonné, A Labourel… - arXiv preprint arXiv …, 2020 - arxiv.org
A mobile agent navigating along edges of a simple connected graph, either finite or
countably infinite, has to find an inert target (treasure) hidden in one of the nodes. This task …
countably infinite, has to find an inert target (treasure) hidden in one of the nodes. This task …
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 …
Deterministic treasure hunt in the plane with angular hints
S Bouchard, Y Dieudonné, A Pelc, F Petit - Algorithmica, 2020 - Springer
A mobile agent equipped with a compass and a measure of length has to find an inert
treasure in the Euclidean plane. Both the agent and the treasure are modeled as points. In …
treasure in the Euclidean plane. Both the agent and the treasure are modeled as points. In …
Reaching a target in the plane with no information
A Pelc - Information Processing Letters, 2018 - Elsevier
A mobile agent has to reach a target in the Euclidean plane. Both the agent and the target
are modeled as points. At the beginning, the agent is at distance at most D> 0 from the …
are modeled as points. At the beginning, the agent is at distance at most D> 0 from the …
Pebble guided optimal treasure hunt in anonymous graphs
We study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph
are anonymous and the edges at any node v of degree deg (v) are labeled arbitrarily as 0 …
are anonymous and the edges at any node v of degree deg (v) are labeled arbitrarily as 0 …
Advice complexity of treasure hunt in geometric terrains
Treasure hunt is finding an inert target by a mobile agent. We consider treasure hunt in
polygonal terrains with polygonal obstacles. The agent finds the treasure when there is a …
polygonal terrains with polygonal obstacles. The agent finds the treasure when there is a …