Linear search by a pair of distinct-speed robots
From MaRDI portal
Publication:1755792
DOI10.1007/s00453-018-0447-0zbMath1412.68019OpenAlexW3028595741WikidataQ92373082 ScholiaQ92373082MaRDI QIDQ1755792
Leszek Gąsieniec, Dominik Pająk, Jurek Czyzowicz, Evangelos Bampas, Tomasz Kociumaka, Ralf Klasing, David Ilcinkas
Publication date: 11 January 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc6390721
Analysis of algorithms and problem complexity (68Q25) Search theory (90B40) Distributed systems (68M14) Artificial intelligence for robotics (68T40)
Related Items (3)
A symbolic programming approach to the rendezvous search problem ⋮ Bike assisted evacuation on a line ⋮ Energy Consumption of Group Search on a Line
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online algorithms for searching and exploration in the plane
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Searching in the plane
- An annotated bibliography on guaranteed graph searching
- On the two-dimensional cow search problem
- The lonely runner with seven runners
- On the optimality of a simple strategy for searching graphs
- The theory of search games and rendezvous.
- Evacuating two robots from multiple unknown exits in a circle
- The power of a pebble: Exploring and mapping directed graphs
- Parallel searching in the plane
- Fast collaborative graph exploration
- Fence patrolling by mobile agents with distinct speeds
- Online searching with turn cost
- Searching on a line: a complete characterization of the optimal solution
- Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
- On the linear search problem
- Collaborative search on the plane without communication
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
- Distributed Patrolling with Two-Speed Robots (and an Application to Transportation)
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
- Collective tree exploration
- Online Searching
- Localizing a Robot with Minimum Travel
- Search on a Line by Byzantine Robots
- Search Theory
- Group Search on the Line
- Search on a Line with Faulty Robots
- Evacuating Robots via Unknown Exit in a Disk
This page was built for publication: Linear search by a pair of distinct-speed robots
