Tell Me Where I Am So I Can Meet You Sooner

DOI10.1007/978-3-642-14162-1_42zbMath1288.68214OpenAlexW1592266906MaRDI QIDQ3587463

Jurek Czyzowicz, Arnaud Labourel, Leszek Gąsieniec, Andrew J. Collins

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_42

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Related Items (20)

Byzantine gathering in networks ⋮ On asynchronous rendezvous in general graphs ⋮ 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 ⋮ A general framework for searching on a line ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ Rendezvous of heterogeneous mobile agents in edge-weighted networks ⋮ Unnamed Item ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ How to meet asynchronously at polynomial cost ⋮ Gathering in the plane of location-aware robots in the presence of spies ⋮ Searching on a line: a complete characterization of the optimal solution ⋮ Synchronous Rendezvous for Location-Aware Agents ⋮ Linear rendezvous with asymmetric clocks ⋮ 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

This page was built for publication: Tell Me Where I Am So I Can Meet You Sooner