Exploiting submodularity to quantify near-optimality in multi-agent coverage problems (Q1737663)
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: Exploiting submodularity to quantify near-optimality in multi-agent coverage problems |
scientific article; zbMATH DE number 7047085
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploiting submodularity to quantify near-optimality in multi-agent coverage problems |
scientific article; zbMATH DE number 7047085 |
Statements
Exploiting submodularity to quantify near-optimality in multi-agent coverage problems (English)
0 references
24 April 2019
0 references
optimal coverage
0 references
multi-agent systems
0 references
submodular set function
0 references
greedy algorithm
0 references
gradient method
0 references
0 references
0 references
0 references
0.8183785676956177
0 references
0.7430019974708557
0 references
0.7377960681915283
0 references
0.7232529520988464
0 references
0.7224032282829285
0 references
