Mobile Agent Rendezvous in a Synchronous Torus
From MaRDI portal
Publication:3525798
DOI10.1007/11682462_60zbMath1145.68330OpenAlexW1544628825MaRDI QIDQ3525798
Euripides Markou, Danny Krizanc, Evangelos Kranakis
Publication date: 18 September 2008
Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://ir.library.carleton.ca/pub/2818
Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)
Related Items
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* ⋮ Move-optimal partial gathering of mobile agents in asynchronous trees ⋮ Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings ⋮ MinMax-Distance Gathering on Given Meeting Points ⋮ Mapping simple polygons: how robots benefit from looking back ⋮ Rendezvous Problem ⋮ Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty ⋮ Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model ⋮ Ten Open Problems in Rendezvous Search ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Partial gathering of mobile agents in asynchronous unidirectional rings ⋮ A unified approach for gathering and exclusive searching on rings under weak assumptions ⋮ Mobile Agent Rendezvous in a Ring Using Faulty Tokens ⋮ Gathering in dynamic rings ⋮ Optimal Gathering of Oblivious Robots in Anonymous Graphs
