Convergence properties of the gravitational algorithm in asynchronous robot systems
From MaRDI portal
Recommendations
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Robot convergence via center-of-gravity algorithms
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- A new approach for analyzing convergence algorithms for mobile robots
Cited in
(18)- Gathering few fat mobile robots in the plane
- Distributed algorithms for partitioning a swarm of autonomous mobile robots
- A continuous strategy for collisionless gathering
- Impossibility of gathering by a set of autonomous mobile robots
- Asymptotic behaviour in the robot rendezvous problem
- Gathering fat mobile robots with slim omnidirectional cameras
- A new approach for analyzing convergence algorithms for mobile robots
- Local Algorithms for Autonomous Robot Systems
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- A Continuous Strategy for Collisionless Gathering
- Robot convergence via center-of-gravity algorithms
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Gathering of asynchronous robots with limited visibility
- The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots
- Local spreading algorithms for autonomous robot systems
- Self-deployment of mobile sensors on a ring
- 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 Q5464581)