The polygon exploration problem (Q2784471)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1732359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The polygon exploration problem |
scientific article; zbMATH DE number 1732359 |
Statements
23 April 2002
0 references
angle hull
0 references
competitive strategy
0 references
computational geometry
0 references
curve length
0 references
motion planning
0 references
navigation
0 references
on-line algorithm
0 references
optimum watchman tour
0 references
polygon
0 references
robot
0 references
The polygon exploration problem (English)
0 references
0.8923769593238831
0 references
0.8493061065673828
0 references
0.8373494148254395
0 references
0.8294088840484619
0 references
