A tight lower bound for semi-synchronous collaborative grid exploration (Q5090903)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7561265
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight lower bound for semi-synchronous collaborative grid exploration |
scientific article; zbMATH DE number 7561265 |
Statements
21 July 2022
0 references
finite automata
0 references
graph exploration
0 references
mobile robots
0 references
0 references
A tight lower bound for semi-synchronous collaborative grid exploration (English)
0 references
0.9924646019935608
0 references
0.8133427500724792
0 references
0.7217506766319275
0 references
0.7145473957061768
0 references
0.7038299441337585
0 references
