Compatibility of convergence algorithms for autonomous mobile robots
From MaRDI portal
Cites work
- A new approach for analyzing convergence algorithms for mobile robots
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Compatibility of convergence algorithms for autonomous mobile robots (extended abstract)
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Distributed computing by mobile robots: gathering
- Forming sequences of geometric patterns with oblivious mobile robots
- From ants to a(ge)nts: a special issue on ant-robotics
- scientific article; zbMATH DE number 1629980 (Why is no real title available?)
- scientific article; zbMATH DE number 1049494 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- scientific article; zbMATH DE number 7650877 (Why is no real title available?)
- Monotonic self-stabilization and its application to robust and adaptive pattern formation
- On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks
- Plane formation by synchronous mobile robots in the three-dimensional Euclidean space
- The gathering problem for two oblivious robots with unreliable compasses
This page was built for publication: Compatibility of convergence algorithms for autonomous mobile robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969922)
