Group Search on the Line
From MaRDI portal
Publication:5175102
DOI10.1007/978-3-662-46078-8_14zbMath1410.68159MaRDI QIDQ5175102
Thomas Gorry, Russell Martin, Marek Chrobak, Leszek Gąsieniec
Publication date: 20 February 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46078-8_14
Related Items
A tight lower bound for semi-synchronous collaborative grid exploration, Querying with Uncertainty, Linear rendezvous with asymmetric clocks, Energy Consumption of Group Search on a Line, Exploration of High-Dimensional Grids by Finite Automata, Collaboration Without Communication: Evacuating Two Robots from a Disk, Linear Search with Terrain-Dependent Speeds, Fast two-robot disk evacuation with wireless communication, Wireless evacuation on \(m\) rays with \(k\) searchers, Time-energy tradeoffs for evacuation by two robots in the wireless model, Search on a Line by Byzantine Robots, Search and rescue on the line, Overcoming probabilistic faults in disoriented linear search, Bike assisted evacuation on a line, Evacuating two robots from multiple unknown exits in a circle, Linear search by a pair of distinct-speed robots, Search on a line with faulty robots, Weighted group search on a line \& implications to the priority evacuation problem, A symbolic programming approach to the rendezvous search problem, Further connections between contract-scheduling and ray-searching problems, Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract), Evacuating equilateral triangles and squares in the face-to-face model, Priority evacuation from a disk: the case of \(n \geq 4\), A tight lower bound for semi-synchronous collaborative grid exploration, Treasure evacuation with one robot on a disk, Search-and-rescue rendezvous, Group search of the plane with faulty robots, Evacuating from \(\ell_p\) unit disks in the wireless model, Linear Search by a Pair of Distinct-Speed Robots, Distributed Evacuation in Graphs with Multiple Exits, Better Upper Bounds for Searching on a Line with Byzantine Robots, Evacuating an Equilateral Triangle in the Face-to-Face Model
