Gathering of asynchronous robots with limited visibility
From MaRDI portal
Publication:557818
DOI10.1016/j.tcs.2005.01.001zbMath1108.68120MaRDI 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 computing; Mobile robots; Asynchrony; Cooperation and control; Orientation; Point formation; RendezVous
68T40: Artificial intelligence for robotics
Related Items
Unnamed Item, Unnamed Item, Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults, Searching for a Non-adversarial, Uncooperative Agent on a Cycle, Optimal rendezvous on a line by location-aware robots in the presence of spies*, Continuous Rendezvous Algorithm for Memoryless Agents with Limited Visibility in the Euclidean Space, Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds, How to meet asynchronously at polynomial cost, Pattern Formation by Oblivious Asynchronous Mobile Robots, Explicit Communication Among Stigmergic Robots, Computing by Mobile Robotic Sensors, 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, Connected reconfiguration of lattice-based cellular structures by finite-memory robots, Near-gathering of energy-constrained mobile agents, Convergecast and broadcast by power-aware mobile agents, Anonymous meeting in networks, Gathering fat mobile robots with slim omnidirectional cameras, Optimal probabilistic ring exploration by semi-synchronous oblivious robots, Gathering asynchronous oblivious agents with local vision in regular bipartite graphs, Self-stabilizing gathering with strong multiplicity detection, The optimal tolerance of uniform observation error for mobile robot convergence, 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, Gathering of oblivious robots on infinite grids with minimum traveled distance, Asynchronous deterministic rendezvous in bounded terrains, Synchronous robots vs asynchronous lights-enhanced robots on graphs, Getting close without touching: near-gathering for autonomous mobile robots, Fast rendezvous with advice, Rendezvous of heterogeneous mobile agents in edge-weighted networks, Gathering of robots on anonymous grids and trees without multiplicity detection, Autonomous mobile robots with lights, Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity, Self-deployment of mobile sensors on a ring, Arbitrary pattern formation by asynchronous, anonymous, oblivious robots, Remembering without memory: tree exploration by asynchronous oblivious robots, Optimal Byzantine-resilient convergence in uni-dimensional robot networks, Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring, On asynchronous rendezvous in general graphs, Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane, On time complexity for connectivity-preserving scattering of mobile robots, Gathering of robots on meeting-points: feasibility and optimal resolution algorithms, On deterministic rendezvous at a node of agents with arbitrary velocities, Use of information, memory and randomization in asynchronous gathering, How to meet when you forget: log-space rendezvous in arbitrary graphs, Gathering identical autonomous systems on a circle using stigmergy, Mapping simple polygons: how robots benefit from looking back, The topology of look-compute-move robot wait-free algorithms with hard termination, On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis, Arbitrary pattern formation on infinite regular tessellation graphs, TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications, Ring exploration with myopic luminous robots, Self-stabilizing gathering of mobile robots under crash or Byzantine faults, Meeting in a polygon by anonymous oblivious robots, Evacuating equilateral triangles and squares in the face-to-face model, Randomized gathering of asynchronous mobile robots, Time versus space trade-offs for rendezvous in trees, Gathering on rings under the look-compute-move model, Searching for a non-adversarial, uncooperative agent on a cycle, Embedded pattern formation by asynchronous robots without chirality, Asynchronous approach in the plane: a deterministic polynomial algorithm, Rendezvous in planar environments with obstacles and unknown initial distance, Forming sequences of geometric patterns with oblivious mobile robots, Formal verification of mobile robot protocols, Gathering six oblivious robots on anonymous symmetric rings, Gathering asynchronous oblivious mobile robots in a ring, On the self-stabilization of mobile oblivious robots in uniform rings, Rendezvous in networks in spite of delay faults, Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement, A discrete and continuous study of the \textsc{Max-Chain-Formation} problem, Gathering problems for autonomous mobile robots with lights, The agreement power of disagreement, Deterministic Meeting of Sniffing Agents in the Plane, Rendezvous of Two Robots with Constant Memory, Pattern Formation by Mobile Robots with Limited Visibility, Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract), 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, Optimum Gathering of Asynchronous Robots, Gathering Asynchronous Robots in the Presence of Obstacles, Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots, Convergence of Mobile Robots with Uniformly-Inaccurate Sensors, Evacuating an Equilateral Triangle in the Face-to-Face Model, Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses, Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
Cites Work
