Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time
Consider a collection of entities moving continuously with bounded speed, but otherwise unpredictably, in some low-dimensional space. Two such entities encroach upon one another at a fixed time if their separation is less than some specified threshold. Encroachment, of concern in many settings such...
| Автори: | , |
|---|---|
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
MDPI AG
2024-06-01
|
| Серія: | Algorithms |
| Предмети: | |
| Онлайн доступ: | https://www.mdpi.com/1999-4893/17/6/246 |