Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots (Q2118868)
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 7496382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots |
scientific article; zbMATH DE number 7496382 |
Statements
Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots (English)
0 references
23 March 2022
0 references
robots
0 references
idle time
0 references
lower bound
0 references
patrolling
0 references
0 references
0.898344874382019
0 references
0.7683544754981995
0 references
0.7679364681243896
0 references
0.765078604221344
0 references
0.7625595927238464
0 references
