Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
From MaRDI portal
Publication:5425977
Recommendations
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
- Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses
- Navigation integration of a mobile robot in dynamic environments
- Navigation and execution for mobile robots in dynamic environments: an integrated approach
- The gathering problem for two oblivious robots with unreliable compasses
- scientific article; zbMATH DE number 872791
- Mobile robot autonomous exploration based on dynamically simplified hybrid map
Cited in
(16)- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Self-deployment of mobile sensors on a ring
- Optimal strategies for maintaining a chain of relays between an explorer and a base camp
- The gathering problem for two oblivious robots with unreliable compasses
- Convergence of Mobile Robots with Uniformly-Inaccurate Sensors
- Leader election and gathering for asynchronous fat robots without common chirality
- The optimal tolerance of uniform observation error for mobile robot convergence
- Computing by mobile robotic sensors
- Gathering anonymous, oblivious robots on a grid
- Gathering Anonymous, Oblivious Robots on a Grid
- Distributed algorithms for partitioning a swarm of autonomous mobile robots
- Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses
- Pattern formation by oblivious asynchronous mobile robots
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
This page was built for publication: Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425977)