Want to gather? No need to chatter!

DOI10.1137/20M1362899MaRDI QIDQ6663095zbMATH OpenFDO

Authors Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc

Publication date 14 January 2025

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

deterministic algorithmgatheringleader electionmobile agentgossiping

Mathematics Subject Classification ID

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)

Recommendations

• Anonymous Meeting in Networks
• Anonymous meeting in networks
• How to Meet in Anonymous Network
• How to meet in anonymous network
• Gathering despite mischief

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 2006651 (Why is no real title available?)
• scientific article; zbMATH DE number 2102782 (Why is no real title available?)
• A unified approach for gathering and exclusive searching on rings under weak assumptions
• Almost optimal asynchronous rendezvous in infinite multidimensional grids
• Anonymous meeting in networks
• Asynchronous deterministic rendezvous in graphs
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
• Deterministic rendezvous in graphs
• Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
• Distributed computing by mobile robots: gathering
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Finding Your Kids When They Are Lost
• Gathering asynchronous oblivious mobile robots in a ring
• Gathering of asynchronous robots with limited visibility
• How to meet asynchronously (almost) everywhere
• How to meet in anonymous network
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• Minimax Rendezvous on the Line
• Randomized Rendez-Vous with Limited Memory
• Rendezvous Search on the Line
• Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
• Rendezvous search on labeled networks
• Rendezvous search when marks are left at the starting points
• Symmetry Breaking in the Plane
• The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring
• The Rendezvous Search Problem
• The theory of search games and rendezvous.
• Two Dimensional Rendezvous Search
• Undirected connectivity in log-space
• Universal traversal sequences with backtracking.

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)