The robot routing problem for collecting aggregate stochastic rewards (Q5111626)
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: The robot routing problem for collecting aggregate stochastic rewards |
scientific article; zbMATH DE number 7204930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The robot routing problem for collecting aggregate stochastic rewards |
scientific article; zbMATH DE number 7204930 |
Statements
27 May 2020
0 references
path planning
0 references
graph games
0 references
quantitative objectives
0 references
discounting
0 references
cs.SY
0 references
cs.CC
0 references
cs.DS
0 references
cs.GT
0 references
math.OC
0 references
0 references
The Robot Routing Problem for Collecting Aggregate Stochastic Rewards (English)
0 references
0.7631201148033142
0 references
0.7408947944641113
0 references
0.7180712819099426
0 references
0.6708989143371582
0 references
