Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
From MaRDI portal
Recommendations
Cited in
(70)- On asynchronous rendezvous in general graphs
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots
- Distributed computing by mobile robots: uniform circle formation
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Team assembling problem for asynchronous heterogeneous mobile robots
- Use of information, memory and randomization in asynchronous gathering
- How many oblivious robots can explore a line
- The topology of look-compute-move robot wait-free algorithms with hard termination
- Search on a line with faulty robots
- On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- k-circle formation by disoriented asynchronous robots
- Fault-induced dynamics of oblivious robots on a line
- Asynchronous approach in the plane: a deterministic polynomial algorithm
- Group search of the plane with faulty robots
- Deterministic polynomial approach in the plane
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Convergecast and broadcast by power-aware mobile agents
- Anonymous meeting in networks
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Price of asynchrony in mobile agents computing
- Rendezvous of two robots with constant memory
- A new approach for analyzing convergence algorithms for mobile robots
- Network exploration by silent and oblivious robots
- Collisionless gathering of robots with an extent
- Synchronous rendezvous for location-aware agents
- Convergence of Mobile Robots with Uniformly-Inaccurate Sensors
- Local Algorithms for Autonomous Robot Systems
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Energy-efficient strategies for building short chains of mobile robots locally
- The optimal tolerance of uniform observation error for mobile robot convergence
- A survey on relay placement with runtime and approximation guarantees
- Leader election and gathering for asynchronous fat robots without common chirality
- Position discovery for a system of bouncing robots
- Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
- Optimal rendezvous on a line by location-aware robots in the presence of spies*
- Mobile robots with uncertain visibility sensors: possibility results and lower bounds
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- Pattern formation by oblivious asynchronous mobile robots
- Mutual visibility by luminous robots without collisions
- Structural Information and Communication Complexity
- Computing by mobile robotic sensors
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Algorithms – ESA 2004
- Gathering despite mischief
- Stand up indulgent gathering
- Stand up indulgent gathering
- Gathering in the plane of location-aware robots in the presence of spies
- Near-gathering of energy-constrained mobile agents
- Gathering in dynamic rings
- Synchronous gathering without multiplicity detection: a certified algorithm
- Rendezvous with constant memory
- Almost universal anonymous rendezvous in the plane
- Unifying gathering protocols for swarms of mobile robots
- Search on a Line by Byzantine Robots
- Compatibility of convergence algorithms for autonomous mobile robots (extended abstract)
- On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
- A further study on weak Byzantine gathering of mobile agents
- Want to gather? No need to chatter!
- Gathering semi-synchronously scheduled two-state robots
- Minimum algorithm sizes for the gathering and related problems of autonomous mobile robots
- Compatibility of convergence algorithms for autonomous mobile robots
- On the computational power of energy-constrained mobile robots
- Universal pattern formation by oblivious robots under sequential schedulers
- Getting close without touching: near-gathering for autonomous mobile robots
- Optimal strategies for maintaining a chain of relays between an explorer and a base camp
- Autonomous mobile robots with lights
- Local spreading algorithms for autonomous robot systems
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks
This page was built for publication: Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317209)
