Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
From MaRDI portal
Publication:3614159
DOI10.1137/060665257zbMath1178.68594OpenAlexW2136023420MaRDI QIDQ3614159
Publication date: 16 March 2009
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060665257
Related Items
Optimal strategies for maintaining a chain of relays between an explorer and a base camp ⋮ Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults ⋮ \(k\)-circle formation by disoriented asynchronous robots ⋮ Optimal rendezvous on a line by location-aware robots in the presence of spies* ⋮ Price of asynchrony in mobile agents computing ⋮ When patrolmen become corrupted: monitoring a graph using faulty mobile robots ⋮ Distributed computing by mobile robots: uniform circle formation ⋮ Almost universal anonymous rendezvous in the plane ⋮ Mapping simple polygons: how robots benefit from looking back ⋮ Compatibility of convergence algorithms for autonomous mobile robots (extended abstract) ⋮ Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ The optimal tolerance of uniform observation error for mobile robot convergence ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ How to meet asynchronously at polynomial cost ⋮ Search on a line with faulty robots ⋮ Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring ⋮ Gathering in the plane of location-aware robots in the presence of spies ⋮ Asynchronous approach in the plane: a deterministic polynomial algorithm ⋮ Convergence of Mobile Robots with Uniformly-Inaccurate Sensors ⋮ Group search of the plane with faulty robots ⋮ Unnamed Item ⋮ Pattern Formation by Oblivious Asynchronous Mobile Robots ⋮ Deterministic polynomial approach in the plane ⋮ Anonymous meeting in networks
