Arbitrary pattern formation on infinite regular tessellation graphs
From MaRDI portal
Recommendations
Cites work
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Arbitrary pattern formation by opaque fat robots with lights
- Arbitrary pattern formation with four robots
- Asynchronous arbitrary pattern formation: the effects of a rigorous approach
- Autonomous mobile robots with lights
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- 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
- Embedded pattern formation by asynchronous robots without chirality
- Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement
- Forming sequences of geometric patterns with oblivious mobile robots
- Gathering of asynchronous robots with limited visibility
- Gathering of oblivious robots on infinite grids with minimum traveled distance
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Gathering robots in graphs: the central role of synchronicity
- Half domination arrangements in regular and semi-regular tessellation type graphs
- scientific article; zbMATH DE number 3968590 (Why is no real title available?)
- Leader election problem versus pattern formation problem
Cited in
(9)- Distributions of several infinite families of mesh patterns
- Molecular robots with chirality on grids
- Molecular pattern formation on grids in the \textsc{Moblot} model
- Time optimal gathering of myopic robots on an infinite triangular grid
- Mutual visibility of luminous robots despite angular inaccuracy
- Arbitrary pattern formation on a continuous circle by oblivious robot swarm
- Optimal gathering of robots in anonymous butterfly networks via leader election
- Characterizing and computing in linear time mutual-visibility parameters in distance-hereditary graphs
- Move-optimal arbitrary pattern formation by mobile robots on rectangular grid using near-optimal spatial area
This page was built for publication: Arbitrary pattern formation on infinite regular tessellation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2110359)
