The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
From MaRDI portal
Publication:2884572
DOI10.1137/100797916zbMath1242.68178arXiv1111.1492OpenAlexW2049232787MaRDI QIDQ2884572
Taisuke Izumi, Koichi Wada, Nobuhiro Inuzuka, Xavier Défago, Yoshiaki Katayama, Samia Souissi, Masafumi Yamashita
Publication date: 30 May 2012
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.1492
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Artificial intelligence for robotics (68T40)
Related Items
Byzantine gathering in networks, Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults, Gathering Anonymous, Oblivious Robots on a Grid, Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement, 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, Wait-Free Gathering Without Chirality, When patrolmen become corrupted: monitoring a graph using faulty mobile robots, Distributed computing by mobile robots: uniform circle formation, 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, Compatibility of convergence algorithms for autonomous mobile robots (extended abstract), Rendezvous of Asynchronous Mobile Robots with Lights, Unnamed Item, Gathering of robots on meeting-points: feasibility and optimal resolution algorithms, The agreement power of disagreement, Randomized gathering of asynchronous mobile robots, A unified approach for gathering and exclusive searching on rings under weak assumptions, Mutual visibility by luminous robots without collisions, The topology of look-compute-move robot wait-free algorithms with hard termination, Search on a line with faulty robots, Unnamed Item, Gathering in the plane of location-aware robots in the presence of spies, Rendezvous with constant memory, Arbitrary pattern formation on infinite grid by asynchronous oblivious robots, Fault-induced dynamics of oblivious robots on a line, Gathering anonymous, oblivious robots on a grid, Linear rendezvous with asymmetric clocks, Asynchronous approach in the plane: a deterministic polynomial algorithm, Deterministic rendezvous with different maps, Group search of the plane with faulty robots, Monotonic self-stabilization and its application to robust and adaptive pattern formation, On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis, Pattern Formation by Oblivious Asynchronous Mobile Robots, Rendezvous of Two Robots with Constant Memory
