Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (Q1699417)
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: Gathering of robots on meeting-points: feasibility and optimal resolution algorithms |
scientific article; zbMATH DE number 6842771
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Gathering of robots on meeting-points: feasibility and optimal resolution algorithms |
scientific article; zbMATH DE number 6842771 |
Statements
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (English)
0 references
23 February 2018
0 references
distributed computing
0 references
autonomous mobile robots
0 references
obliviousness
0 references
asynchronous system
0 references
unlimited visibility
0 references
gathering
0 references
optimization problems
0 references
Weber-point
0 references
0 references
0 references
0 references
0.9186307787895204
0 references
0.878082811832428
0 references
0.8632195591926575
0 references
0.8532752394676208
0 references
