Gathering in the plane of location-aware robots in the presence of spies
From MaRDI portal
Publication:5918903
DOI10.1016/j.tcs.2020.06.034zbMath1452.68239arXiv1712.02474OpenAlexW3041676593MaRDI QIDQ5918903
Jurek Czyzowicz, Danny Krizanc, Oscar Morales-Ponce, Evangelos Kranakis, Ryan Killick
Publication date: 25 August 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.02474
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multidimensional divide-and-conquer
- Gathering of asynchronous robots with limited visibility
- Computing a centerpoint of a finite planar set of points in linear time
- Time bounds for selection
- The theory of search games and rendezvous.
- Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
- Asynchronous deterministic rendezvous in graphs
- Impossibility of gathering by a set of autonomous mobile robots
- The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
- Synchronous Rendezvous for Location-Aware Agents
- Distributed Computing by Mobile Robots: Gathering
- When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots
- Tell Me Where I Am So I Can Meet You Sooner
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Rendezvous Search: A Personal Perspective
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Search on a Line by Byzantine Robots
- The Rendezvous Search Problem
- Gathering Despite Mischief
- On the computational power of oblivious robots
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Search on a Line with Faulty Robots
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
This page was built for publication: Gathering in the plane of location-aware robots in the presence of spies
