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...
| Glavni autori: | , |
|---|---|
| Format: | Članak |
| Jezik: | English |
| Izdano: |
MDPI AG
2024-06-01
|
| Serija: | Algorithms |
| Teme: | |
| Online pristup: | https://www.mdpi.com/1999-4893/17/6/246 |