How to meet asynchronously (almost) everywhere
From MaRDI portal
Publication:3189080
DOI10.1145/2344422.2344427zbMath1295.68171arXiv1001.0890OpenAlexW2621800709MaRDI QIDQ3189080
Arnaud Labourel, Andrzej Pelc, Jurek Czyzowicz
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.0890
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Related Items (28)
Byzantine gathering in networks ⋮ On asynchronous rendezvous in general graphs ⋮ Rendezvous in networks in spite of delay faults ⋮ Verification of agent navigation in partially-known environments ⋮ Byzantine gathering in polynomial time ⋮ Price of asynchrony in mobile agents computing ⋮ Beyond Rings: Gathering in 1-Interval Connected Graphs ⋮ Almost universal anonymous rendezvous in the plane ⋮ Fast rendezvous with advice ⋮ Rendezvous Problem ⋮ Unnamed Item ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Meeting in a polygon by anonymous oblivious robots ⋮ On deterministic rendezvous at a node of agents with arbitrary velocities ⋮ Gathering of robots in a ring with mobile faults ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ Time versus space trade-offs for rendezvous in trees ⋮ How to meet asynchronously at polynomial cost ⋮ Gathering in dynamic rings ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Near-gathering of energy-constrained mobile agents ⋮ Asynchronous approach in the plane: a deterministic polynomial algorithm ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Deterministic rendezvous with different maps ⋮ Deterministic polynomial approach in the plane ⋮ Distributed graph searching with a sense of direction ⋮ Anonymous meeting in networks
This page was built for publication: How to meet asynchronously (almost) everywhere
