Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids

DOI10.1007/978-3-642-15763-9_28zbMath1290.68118OpenAlexW1493636406MaRDI QIDQ3588310

Evangelos Bampas, David Ilcinkas, Jurek Czyzowicz, Arnaud Labourel, Leszek Gąsieniec

Publication date: 10 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15763-9_28

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Related Items (30)

Byzantine gathering in networks ⋮ On asynchronous rendezvous in general graphs ⋮ Rendezvous in networks in spite of delay faults ⋮ Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults ⋮ Optimal rendezvous on a line by location-aware robots in the presence of spies* ⋮ Byzantine gathering in polynomial time ⋮ Price of asynchrony in mobile agents computing ⋮ Almost universal anonymous rendezvous in the plane ⋮ Fast rendezvous with advice ⋮ Rendezvous of heterogeneous mobile agents in edge-weighted networks ⋮ Gathering of robots on anonymous grids and trees without multiplicity detection ⋮ Deterministic rendezvous in infinite trees ⋮ Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty ⋮ Unnamed Item ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Deterministic treasure hunt and rendezvous in arbitrary connected graphs ⋮ Computing on rings by oblivious robots: a unified approach for different tasks ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ A unified approach for gathering and exclusive searching on rings under weak assumptions ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ Gathering on rings under the look-compute-move model ⋮ How to meet asynchronously at polynomial cost ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Synchronous Rendezvous for Location-Aware Agents ⋮ Asynchronous approach in the plane: a deterministic polynomial algorithm ⋮ Deterministic Meeting of Sniffing Agents in the Plane ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Deterministic polynomial approach in the plane ⋮ Anonymous meeting in networks ⋮ Fast rendezvous on a cycle by agents with different speeds

This page was built for publication: Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids