Linear Search by a Pair of Distinct-Speed Robots

DOI10.1007/978-3-319-48314-6_13zbMath1410.68055OpenAlexW2548659391MaRDI QIDQ2835026

Jurek Czyzowicz, David Ilcinkas, Dominik Pająk, Evangelos Bampas, Tomasz Kociumaka, Ralf Klasing, Leszek Gąsieniec

Publication date: 1 December 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/116160

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Search theory (90B40) Distributed systems (68M14) Artificial intelligence for robotics (68T40)

Related Items

Linear Search with Terrain-Dependent Speeds, Evacuating two robots from multiple unknown exits in a circle, Search on a Line by Byzantine Robots, Unnamed Item, Priority evacuation from a disk: the case of \(n \geq 4\), Wireless evacuation on \(m\) rays with \(k\) searchers

Cites Work

• Unnamed Item
• Unnamed Item
• Searching in the plane
• An annotated bibliography on guaranteed graph searching
• The lonely runner with seven runners
• The theory of search games and rendezvous.
• 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
• 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
• Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
• Collective tree exploration
• Online Searching
• Localizing a Robot with Minimum Travel
• Group Search on the Line
• Evacuating Robots via Unknown Exit in a Disk