CLEARING A POLYGON WITH TWO 1-SEARCHERS (Q3628102)
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 5554997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | CLEARING A POLYGON WITH TWO 1-SEARCHERS |
scientific article; zbMATH DE number 5554997 |
Statements
CLEARING A POLYGON WITH TWO 1-SEARCHERS (English)
0 references
19 May 2009
0 references
numerical examples
0 references
pursuit-evasion
0 references
visibility
0 references
motion planning
0 references
robotics
0 references
sensing
0 references
0 references
0.8978396058082581
0 references
0.8467972874641418
0 references
0.8391578197479248
0 references
0.8370527625083923
0 references
