Informative path planning as a maximum traveling salesman problem with submodular rewards (Q2345604)
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: Informative path planning as a maximum traveling salesman problem with submodular rewards |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Informative path planning as a maximum traveling salesman problem with submodular rewards |
scientific article |
Statements
Informative path planning as a maximum traveling salesman problem with submodular rewards (English)
0 references
22 May 2015
0 references
submodular function maximization
0 references
traveling salesman problem
0 references
informative path planning
0 references
0 references
0 references
0 references
0 references
0.742180585861206
0 references
0.7117689251899719
0 references
0.7046619057655334
0 references
0.7014017105102539
0 references
0.6995632648468018
0 references
