Gathering of asynchronous robots with limited visibility
From MaRDI portal
Publication:557818
DOI10.1016/j.tcs.2005.01.001zbMath1108.68120OpenAlexW2010017329MaRDI QIDQ557818
Paola Flocchini, Nicola Santoro, Peter Widmayer, Giuseppe Prencipe
Publication date: 30 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.01.001
Distributed computingMobile robotsAsynchronyCooperation and controlOrientationPoint formationRendezVous
Related Items (97)
TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications ⋮ Formal verification of mobile robot protocols ⋮ On asynchronous rendezvous in general graphs ⋮ Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane ⋮ Gathering fat mobile robots with slim omnidirectional cameras ⋮ Rendezvous in networks in spite of delay faults ⋮ Ring exploration with myopic luminous robots ⋮ Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults ⋮ Searching for a Non-adversarial, Uncooperative Agent on a Cycle ⋮ 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* ⋮ On time complexity for connectivity-preserving scattering of mobile robots ⋮ Continuous Rendezvous Algorithm for Memoryless Agents with Limited Visibility in the Euclidean Space ⋮ Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds ⋮ Evacuating an Equilateral Triangle in the Face-to-Face Model ⋮ Optimal probabilistic ring exploration by semi-synchronous oblivious robots ⋮ Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract) ⋮ A discrete and continuous study of the \textsc{Max-Chain-Formation} problem ⋮ Gathering asynchronous oblivious agents with local vision in regular bipartite graphs ⋮ Ring exploration of myopic luminous robots with visibility more than one ⋮ Almost universal anonymous rendezvous in the plane ⋮ Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights ⋮ Gathering problems for autonomous mobile robots with lights ⋮ Fast rendezvous with advice ⋮ Rendezvous of heterogeneous mobile agents in edge-weighted networks ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Gathering identical autonomous systems on a circle using stigmergy ⋮ Gathering of robots on anonymous grids and trees without multiplicity detection ⋮ Autonomous mobile robots with lights ⋮ Mapping simple polygons: how robots benefit from looking back ⋮ Deterministic rendezvous in infinite trees ⋮ Self-stabilizing gathering with strong multiplicity detection ⋮ Time optimal gathering of myopic robots on an infinite triangular grid ⋮ Rendezvous of Asynchronous Mobile Robots with Lights ⋮ 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 ⋮ Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses ⋮ Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots ⋮ Optimal Gathering Over Weber Meeting Nodes in Infinite Grid ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Deterministic treasure hunt and rendezvous in arbitrary connected graphs ⋮ Self-stabilizing gathering of mobile robots under crash or Byzantine faults ⋮ 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 ⋮ Evacuating equilateral triangles and squares in the face-to-face model ⋮ The optimal tolerance of uniform observation error for mobile robot convergence ⋮ Gathering Asynchronous Robots in the Presence of Obstacles ⋮ Asynchronous deterministic rendezvous in bounded terrains ⋮ Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity ⋮ Gathering six oblivious robots on anonymous symmetric rings ⋮ Explicit Communication Among Stigmergic Robots ⋮ Randomized gathering of asynchronous mobile robots ⋮ Computing by Mobile Robotic Sensors ⋮ Self-deployment of mobile sensors on a ring ⋮ The kissing problem: how to end a gathering when everyone kisses everyone else goodbye ⋮ Leader election and gathering for asynchronous fat robots without common chirality ⋮ Position discovery for a system of bouncing robots ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ Arbitrary pattern formation by asynchronous, anonymous, oblivious robots ⋮ Gathering asynchronous oblivious mobile robots in a ring ⋮ Time versus space trade-offs for rendezvous in trees ⋮ Gathering of oblivious robots on infinite grids with minimum traveled distance ⋮ Remembering without memory: tree exploration by asynchronous oblivious robots ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ Gathering on rings under the look-compute-move model ⋮ How to meet asynchronously at polynomial cost ⋮ Optimal Byzantine-resilient convergence in uni-dimensional robot networks ⋮ Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Gathering in the plane of location-aware robots in the presence of spies ⋮ Gathering in dynamic rings ⋮ Searching for a non-adversarial, uncooperative agent on a cycle ⋮ Deterministic Rendezvous with Detection Using Beeps ⋮ Rendezvous with constant memory ⋮ On the self-stabilization of mobile oblivious robots in uniform rings ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Synchronous robots vs asynchronous lights-enhanced robots on graphs ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots ⋮ Near-gathering of energy-constrained mobile agents ⋮ Getting close without touching: near-gathering for autonomous mobile robots ⋮ Embedded pattern formation by asynchronous robots without chirality ⋮ Asynchronous approach in the plane: a deterministic polynomial algorithm ⋮ Deterministic Meeting of Sniffing Agents in the Plane ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots ⋮ Convergence of Mobile Robots with Uniformly-Inaccurate Sensors ⋮ 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 ⋮ Pattern Formation by Mobile Robots with Limited Visibility ⋮ Arbitrary pattern formation on infinite regular tessellation graphs ⋮ Forming sequences of geometric patterns with oblivious mobile robots ⋮ Convergecast and broadcast by power-aware mobile agents ⋮ Anonymous meeting in networks
Cites Work
This page was built for publication: Gathering of asynchronous robots with limited visibility
