A tight lower bound for semi-synchronous collaborative grid exploration (Q2220396)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A tight lower bound for semi-synchronous collaborative grid exploration |
scientific article; zbMATH DE number 7300285
| 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 7300285 |
Statements
A tight lower bound for semi-synchronous collaborative grid exploration (English)
0 references
22 January 2021
0 references
The paper is related to the problem of exploring an infinite grid with a set of agents. The main result is the proof of the fact that three semi-synchronous agents controlled by a finite automaton are not sufficient to explore the infinite grid. This main result involves a complex theoretical model that is nicely described in detail in the paper.
0 references
agents
0 references
graph exploration
0 references
finite automata
0 references
mobile robots
0 references
0 references
0.8133427500724792
0 references
0.7358241081237793
0 references
0.6778096556663513
0 references
0.6534774303436279
0 references
