Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
From MaRDI portal
Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
Recommendations
Cites work
- Autonomous mobile robots with lights
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Distributed computing by mobile robots: gathering
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Gathering asynchronous oblivious mobile robots in a ring
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
- Impossibility of gathering by a set of autonomous mobile robots
- Mutual visibility by luminous robots without collisions
- Optimum Gathering of Asynchronous Robots
- Rendezvous of two robots with visible bits
- Rendezvous with constant memory
- Self-stabilizing gathering with strong multiplicity detection
- Synchronous robots vs asynchronous lights-enhanced robots on graphs
- The gathering problem for two oblivious robots with unreliable compasses
- The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
Cited in
(8)- Gathering problems for autonomous mobile robots with lights
- Optimum Gathering of Asynchronous Robots
- Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights
- Optimal rendezvous \(\mathcal{L}\)-algorithms for asynchronous mobile robots with external-lights
- Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights
- Rendezvous of Asynchronous Mobile Robots with Lights
- Gathering semi-synchronously scheduled two-state robots
- Autonomous mobile robots with lights
This page was built for publication: Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488454)
