Want to gather? No need to chatter!
From MaRDI portal
Publication:6663095
DOI10.1137/20m1362899MaRDI QIDQ6663095
Andrzej Pelc, Yoann Dieudonné, Sébastien Bouchard
Publication date: 14 January 2025
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Anonymous meeting in networks
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Gathering of asynchronous robots with limited visibility
- How to meet in anonymous network
- The theory of search games and rendezvous.
- Universal traversal sequences with backtracking.
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Byzantine gathering in networks
- Asynchronous deterministic rendezvous in graphs
- Gathering asynchronous oblivious mobile robots in a ring
- Deterministic rendezvous in graphs
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
- Distributed Computing by Mobile Robots: Gathering
- How to meet asynchronously (almost) everywhere
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
- Undirected connectivity in log-space
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Two Dimensional Rendezvous Search
- Finding Your Kids When They Are Lost
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- Rendezvous search when marks are left at the starting points
- Rendezvous search on labeled networks
- Rendezvous Search on the Line
- Minimax Rendezvous on the Line
- The Rendezvous Search Problem
- Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
- Symmetry Breaking in the Plane
- How to meet asynchronously at polynomial cost
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring
- Randomized Rendez-Vous with Limited Memory
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Self-stabilizing robots in highly dynamic environments
This page was built for publication: Want to gather? No need to chatter!