Distributed Computing by Mobile Robots: Gathering
From MaRDI portal
Publication:3143295
DOI10.1137/100796534zbMath1286.68484OpenAlexW2087073465MaRDI QIDQ3143295
Mark Cieliebak, Nicola Santoro, Giuseppe Prencipe, Paola Flocchini
Publication date: 29 November 2012
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8dede91b7e7952d520c693903b1eb3cef20c87d7
Related Items (88)
TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications ⋮ Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots ⋮ Byzantine gathering in networks ⋮ Formal verification of mobile robot protocols ⋮ On asynchronous rendezvous in general graphs ⋮ Rendezvous in networks in spite of delay faults ⋮ Search by a metamorphic robotic system in a finite 2D square grid ⋮ Uniform Dispersal of Robots with Minimum Visibility Range ⋮ Gathering Anonymous, Oblivious Robots on a Grid ⋮ A Continuous Strategy for Collisionless Gathering ⋮ \(k\)-circle formation by disoriented asynchronous robots ⋮ Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement ⋮ Byzantine gathering in polynomial time ⋮ Wait-Free Gathering Without Chirality ⋮ Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings ⋮ Plane formation by synchronous mobile robots without chirality ⋮ Pushing lines helps: efficient universal centralised transformations for programmable matter ⋮ MinMax-Distance Gathering on Given Meeting Points ⋮ Distributed computing by mobile robots: uniform circle formation ⋮ Deterministic geoleader election in disoriented anonymous systems ⋮ Leader Election and Shape Formation with Self-organizing Programmable Matter ⋮ Almost universal anonymous rendezvous in the plane ⋮ Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights ⋮ A structured methodology for designing distributed algorithms for mobile entities ⋮ Gathering problems for autonomous mobile robots with lights ⋮ Asynchronous arbitrary pattern formation: the effects of a rigorous approach ⋮ Fast rendezvous with advice ⋮ Molecular robots with chirality on grids ⋮ Autonomous mobile robots with lights ⋮ A stochastic approach to shortcut bridging in programmable matter ⋮ The mutual visibility problem for fat robots ⋮ Deterministic rendezvous in infinite trees ⋮ 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 ⋮ Deterministic treasure hunt and rendezvous in arbitrary connected graphs ⋮ Team assembling problem for asynchronous heterogeneous mobile robots ⋮ Meeting in a polygon by anonymous oblivious robots ⋮ On deterministic rendezvous at a node of agents with arbitrary velocities ⋮ Optimum Gathering of Asynchronous Robots ⋮ The agreement power of disagreement ⋮ Distributed Patrolling with Two-Speed Robots (and an Application to Transportation) ⋮ Gathering Asynchronous Robots in the Presence of Obstacles ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ Optimal torus exploration by oblivious robots ⋮ Explicit Communication Among Stigmergic Robots ⋮ Impossibility of gathering, a certification ⋮ Leader election and gathering for asynchronous fat robots without common chirality ⋮ Computing on rings by oblivious robots: a unified approach for different tasks ⋮ Communication and location discovery in geometric ring networks ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ A unified approach for gathering and exclusive searching on rings under weak assumptions ⋮ Distributed algorithms for barrier coverage using relocatable sensors ⋮ Mutual visibility by luminous robots without collisions ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ How to meet asynchronously at polynomial cost ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Gathering in the plane of location-aware robots in the presence of spies ⋮ Gathering in dynamic rings ⋮ Deterministic Rendezvous with Detection Using Beeps ⋮ Rendezvous with constant memory ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement ⋮ On efficient connectivity-preserving transformations in a grid ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots ⋮ Synchronous gathering without multiplicity detection: a certified algorithm ⋮ Collaborative delivery with energy-constrained mobile robots ⋮ Wait-free approximate agreement on graphs ⋮ Near-gathering of energy-constrained mobile agents ⋮ Wait-free approximate agreement on graphs ⋮ Arbitrary pattern formation on infinite grid by asynchronous oblivious robots ⋮ Fault-induced dynamics of oblivious robots on a line ⋮ Probabilistic smallest enclosing ball in high dimensions via subgradient sampling ⋮ Embedded pattern formation by asynchronous robots without chirality ⋮ Asynchronous approach in the plane: a deterministic polynomial algorithm ⋮ Asynchronous Coordination Under Preferences and Constraints ⋮ Deterministic Meeting of Sniffing Agents in the Plane ⋮ Universal Systems of Oblivious Mobile Robots ⋮ On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis ⋮ Dispersion of mobile robots on directed anonymous graphs ⋮ Pattern Formation by Oblivious Asynchronous Mobile Robots ⋮ Rendezvous of Two Robots with Constant Memory ⋮ Optimal Gathering of Oblivious Robots in Anonymous Graphs ⋮ Arbitrary pattern formation on infinite regular tessellation graphs ⋮ Forming sequences of geometric patterns with oblivious mobile robots ⋮ Anonymous meeting in networks
This page was built for publication: Distributed Computing by Mobile Robots: Gathering
