On fast pattern formation by autonomous robots
From MaRDI portal
Publication:2139095
Recommendations
Cites work
- A distributed algorithm for gathering many fat mobile robots in the plane
- A new approach for analyzing convergence algorithms for mobile robots
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Asynchronous arbitrary pattern formation: the effects of a rigorous approach
- Asynchronous embedded pattern formation without orientation
- Autonomous mobile robots with lights
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Constant-time complete visibility for asynchronous robots with lights
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Distributed Computing – IWDC 2005
- Distributed computing by mobile robots: uniform circle formation
- Forming sequences of geometric patterns with oblivious mobile robots
- Leader election problem versus pattern formation problem
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
- On fast pattern formation by autonomous robots
- Pattern formation by mobile robots with limited visibility
- Pattern formation by oblivious asynchronous mobile robots
- Structural Information and Communication Complexity
- Universally optimal gathering under limited visibility
Cited in
(3)
This page was built for publication: On fast pattern formation by autonomous robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139095)