Name
Title | ||
|---|---|---|
Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots |
Abstract | ||
|---|---|---|
We consider swarms of asynchronous oblivious robots evolving into an anonymous grid-shaped network. In this context, we investigate optimal (w.r.t. the number of robots) deterministic solutions for the terminating exploration problem. We first show lower bounds in the semi-synchronous model. Precisely, we show that at least three robots are required to explore any grid of at least three nodes, eve... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1093/comjnl/bxz166 | The Computer Journal |
Keywords | DocType | Volume |
oblivious robots,terminating exploration,finite discrete space,grid | Journal | 64 |
Issue | ISSN | Citations |
1 | 0010-4620 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stéphane Devismes | 1 | 192 | 25.74 |
| Anissa Lamani | 2 | 118 | 11.31 |
| Franck Petit | 3 | 736 | 60.02 |
| Pascal Raymond | 4 | 0 | 0.34 |
| S. Tixeuil | 5 | 70 | 4.34 |