Rendezvous of two robots with visible bits
From MaRDI portal
Publication:1796443
DOI10.1007/978-3-642-45346-5_21zbMath1397.68190arXiv1211.6039OpenAlexW2123785131MaRDI QIDQ1796443
Publication date: 17 October 2018
Full work available at URL: https://arxiv.org/abs/1211.6039
Related Items (16)
Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds ⋮ Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights ⋮ Gathering problems for autonomous mobile robots with lights ⋮ Autonomous mobile robots with lights ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Optimum Gathering of Asynchronous Robots ⋮ The agreement power of disagreement ⋮ Unnamed Item ⋮ Explicit Communication Among Stigmergic Robots ⋮ Mutual visibility by luminous robots without collisions ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ Unnamed Item ⋮ Rendezvous with constant memory ⋮ Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement ⋮ On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis ⋮ Pattern Formation by Oblivious Asynchronous Mobile Robots
This page was built for publication: Rendezvous of two robots with visible bits
