Deterministic polynomial approach in the plane

DOI10.1007/s00446-014-0216-5zbMath1331.68225MaRDI QIDQ2353250

Yoann Dieudonné, Andrzej Pelc

Publication date: 8 July 2015

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-014-0216-5

zbMATH Keywords

rendezvous; polynomial time; plane; deterministic algorithm; mobile agent; infinite grid

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68T40: Artificial intelligence for robotics

68W15: Distributed algorithms

Related Items

Almost universal anonymous rendezvous in the plane, On deterministic rendezvous at a node of agents with arbitrary velocities, Meeting in a polygon by anonymous oblivious robots, Asynchronous approach in the plane: a deterministic polynomial algorithm, Deterministic Meeting of Sniffing Agents in the Plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
• 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
• Delays Induce an Exponential Memory Gap for Rendezvous in Trees
• How to meet asynchronously (almost) everywhere
• Tell Me Where I Am So I Can Meet You Sooner
• Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
• How to Meet in Anonymous Network
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Rendezvous search on a graph
• Rendezvous search on labeled networks
• Minimax Rendezvous on the Line
• The Rendezvous Search Problem
• How to meet asynchronously at polynomial cost
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Randomized Rendez-Vous with Limited Memory
• Probability and Computing
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Anonymous Meeting in Networks
• The rendezvous problem on discrete locations
• LATIN 2004: Theoretical Informatics