Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
From MaRDI portal
Publication:5317209
DOI10.1137/S0097539704446475zbMath1081.68110OpenAlexW2041571902MaRDI QIDQ5317209
Publication date: 16 September 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539704446475
Kinematics of mechanisms and robots (70B15) Parallel algorithms in computer science (68W10) Artificial intelligence for robotics (68T40)
Related Items (58)
TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications ⋮ On asynchronous rendezvous in general graphs ⋮ 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 ⋮ 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* ⋮ Price of asynchrony in mobile agents computing ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds ⋮ When patrolmen become corrupted: monitoring a graph using faulty mobile robots ⋮ Energy-efficient strategies for building short chains of mobile robots locally ⋮ Distributed computing by mobile robots: uniform circle formation ⋮ Almost universal anonymous rendezvous in the plane ⋮ Unifying gathering protocols for swarms of mobile robots ⋮ Search on a Line by Byzantine Robots ⋮ Autonomous mobile robots with lights ⋮ Compatibility of convergence algorithms for autonomous mobile robots (extended abstract) ⋮ How many oblivious robots can explore a line ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Team assembling problem for asynchronous heterogeneous mobile robots ⋮ The optimal tolerance of uniform observation error for mobile robot convergence ⋮ A survey on relay placement with runtime and approximation guarantees ⋮ Computing by Mobile Robotic Sensors ⋮ 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 ⋮ A New Approach for Analyzing Convergence Algorithms for Mobile Robots ⋮ Arbitrary pattern formation by asynchronous, anonymous, oblivious robots ⋮ 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 ⋮ Search on a line with faulty robots ⋮ Optimal Byzantine-resilient convergence in uni-dimensional robot networks ⋮ Unnamed Item ⋮ Network Exploration by Silent and Oblivious Robots ⋮ Gathering in the plane of location-aware robots in the presence of spies ⋮ Gathering in dynamic rings ⋮ Rendezvous with constant memory ⋮ Synchronous gathering without multiplicity detection: a certified algorithm ⋮ Collisionless Gathering of Robots with an Extent ⋮ Stand up indulgent gathering ⋮ Stand up indulgent gathering ⋮ Near-gathering of energy-constrained mobile agents ⋮ Arbitrary pattern formation on infinite grid by asynchronous oblivious robots ⋮ Getting close without touching: near-gathering for autonomous mobile robots ⋮ Fault-induced dynamics of oblivious robots on a line ⋮ Synchronous Rendezvous for Location-Aware Agents ⋮ 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 ⋮ On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis ⋮ Unnamed Item ⋮ Pattern Formation by Oblivious Asynchronous Mobile Robots ⋮ Rendezvous of Two Robots with Constant Memory ⋮ Deterministic polynomial approach in the plane ⋮ Convergecast and broadcast by power-aware mobile agents ⋮ Anonymous meeting in networks
This page was built for publication: Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
