Wireless evacuation on \(m\) rays with \(k\) searchers
From MaRDI portal
Publication:5919422
DOI10.1016/j.tcs.2018.10.032zbMath1437.68203OpenAlexW2899097534WikidataQ129023514 ScholiaQ129023514MaRDI QIDQ5919422
Roger Wattenhofer, Sebastian F. Brandt, Klaus-Tycho Foerster, Benjamin Richner
Publication date: 13 February 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.10.032
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14) Artificial intelligence for robotics (68T40) Online algorithms; streaming algorithms (68W27)
Related Items
Further connections between contract-scheduling and ray-searching problems, Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract), Evacuating from \(\ell_p\) unit disks in the wireless model, Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs, Two-agent tree evacuation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower and upper competitive bounds for online directed graph exploration
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Searching in the plane
- How many ants does it take to find the food?
- Search-and-fetch with one robot on a disk (track: wireless and geometry)
- Evacuating two robots from multiple unknown exits in a circle
- Evacuation from a disc in the presence of a faulty robot
- Parallel search with no coordination
- The power of a pebble: Exploring and mapping directed graphs
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
- Parallel searching in the plane
- Structural information and communication complexity. 13th international colloquium, SIROCCO 2006, Chester, UK, July 2--5, 2006. Proceedings.
- Multi-processor search and scheduling problems with setup cost
- The ANTS problem
- Multi-target ray searching problems
- Online searching with an autonomous robot
- Online searching with turn cost
- Searching on a line: a complete characterization of the optimal solution
- On the linear search problem
- Yet more on the linear search problem
- Graph exploration by a finite automaton
- A General Framework for Searching on a Line
- Linear Search by a Pair of Distinct-Speed Robots
- Distributed Evacuation in Graphs with Multiple Exits
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
- Byzantine Gathering in Networks with Authenticated Whiteboards
- Treasure Hunt with Advice
- Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond
- Collaborative Exploration by Energy-Constrained Mobile Robots
- Rendezvous of Mobile Agents without Agreement on Local Orientation
- Online Searching
- Searching for an Agent Who May OR May Not Want to be Found
- Minimax Solutions for Linear Search Problems
- Optimal Constructions of Hybrid Algorithms
- Exploring an Infinite Space with Finite Memory Scouts
- Search on a Line by Byzantine Robots
- Group Search on the Line
- Collaboration Without Communication: Evacuating Two Robots from a Disk
- Linear Search with Terrain-Dependent Speeds
- Parallel exhaustive search without coordination
- Search on a Line with Faulty Robots
- Evacuating Robots via Unknown Exit in a Disk
- Experimental and Efficient Algorithms
- Wireless evacuation on \(m\) rays with \(k\) searchers
- The ultimate strategy to search on \(m\) rays?
- Parallel searching on \(m\) rays