Want to gather? No need to chatter!
From MaRDI portal
Publication:6663095
DOI10.1137/20M1362899MaRDI QIDQ6663095FDOQ6663095
Authors: Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc 
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) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- The theory of search games and rendezvous.
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Asynchronous deterministic rendezvous in graphs
- Gathering asynchronous oblivious mobile robots in a ring
- Deterministic rendezvous in graphs
- Anonymous meeting in networks
- Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
- Title not available (Why is that?)
- 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
- 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
- Title not available (Why is that?)
- The Rendezvous Search Problem
- How to meet asynchronously at polynomial cost
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Gathering of asynchronous robots with limited visibility
- How to meet in anonymous network
- Randomized Rendez-Vous with Limited Memory
- Universal traversal sequences with backtracking.
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring
- Self-stabilizing robots in highly dynamic environments
- Byzantine gathering in networks
- Finding Your Kids When They Are Lost
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- Title not available (Why is that?)
- Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
- Symmetry Breaking in the Plane
This page was built for publication: Want to gather? No need to chatter!
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663095)
