Collaboration without communication: evacuating two robots from a disk
DOI10.1007/978-3-319-57586-5_10zbMATH Open1487.68241OpenAlexW2607458834MaRDI QIDQ5283360FDOQ5283360
Authors: Sebastian F. Brandt, Felix Laufenberg, Yuezhou Lv, David Stolz, Roger Wattenhofer 
Publication date: 21 July 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57586-5_10
Recommendations
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
- Evacuating robots from a disk using face-to-face communication
- Evacuating robots via unknown exit in a disk
- Fast two-robot disk evacuation with wireless communication
- Fast two-robot disk evacuation with wireless communication
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)
Cites Work
- Vertex-to-vertex pursuit in a graph
- The Rendezvous Search Problem
- Online Graph Exploration: New Results on Old and New Algorithms
- Collaborative search on the plane without communication
- Memory lower bounds for randomized collaborative search and implications for biology
- How many ants does it take to find the food?
- Title not available (Why is that?)
- Yet more on the linear search problem
- Deterministic rendezvous in graphs
- Mathematical Foundations of Computer Science 2004
- Lower bounds for the capture time: linear, quadratic, and beyond
- Group search on the line
- Evacuating robots via unknown exit in a disk
- Evacuating two robots from multiple unknown exits in a circle
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
- Distributed Evacuation in Graphs with Multiple Exits
- Fast two-robot disk evacuation with wireless communication
Cited In (25)
- Priority evacuation from a disk: the case of \(n \geq 4\)
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
- Evacuating equilateral triangles and squares in the face-to-face model
- Priority evacuation from a disk: the case of \(n = 1,2,3\)
- Treasure evacuation with one robot on a disk
- Fast two-robot disk evacuation with wireless communication
- Two-agent tree evacuation
- God save the queen
- Searching for a Non-adversarial, Uncooperative Agent on a Cycle
- Evacuating robots via unknown exit in a disk
- Evacuating robots from a disk using face-to-face communication
- Searching for a non-adversarial, uncooperative agent on a cycle
- Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract)
- Energy Consumption of Group Search on a Line
- Title not available (Why is that?)
- Algorithms for \(p\)-Faulty Search on a half-line
- Evacuating from \(\ell_p\) unit disks in the wireless model
- Time-energy tradeoffs for evacuation by two robots in the wireless model
- Evacuating two robots from multiple unknown exits in a circle
- Average case -- worst case tradeoffs for evacuating 2 robots from the disk in the face-to-face model
- Wireless evacuation on \(m\) rays with \(k\) searchers
- Evacuating an equilateral triangle in the face-to-face model
- Triangle evacuation of 2 agents in the wireless model (extended abstract)
- Chauffeuring a crashed robot from a disk
- Evacuation of equilateral triangles by mobile agents of limited communication range
This page was built for publication: Collaboration without communication: evacuating two robots from a disk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283360)
