Pages that link to "Item:Q2310768"
From MaRDI portal
The following pages link to Gathering anonymous, oblivious robots on a grid (Q2310768):
Displaying 11 items.
- Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation (Q2098190) (← links)
- Gathering a Euclidean closed chain of robots in linear time (Q2148881) (← links)
- Meeting in a polygon by anonymous oblivious robots (Q2204780) (← links)
- Gathering robots in graphs: the central role of synchronicity (Q2215970) (← links)
- A continuous strategy for collisionless gathering (Q2220827) (← links)
- Mutual visibility on grid by asynchronous luminous robots (Q2672588) (← links)
- Gathering Anonymous, Oblivious Robots on a Grid (Q5056061) (← links)
- Self-organised aggregation in swarms of robots with informed robots (Q6073014) (← links)
- Time optimal gathering of myopic robots on an infinite triangular grid (Q6155253) (← links)
- The Max-Line-Formation Problem (Q6488442) (← links)
- Stand-up indulgent gathering on lines (Q6614023) (← links)