دورية أكاديمية
Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time
| العنوان: | Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time |
|---|---|
| المؤلفون: | William Evans, David Kirkpatrick |
| المصدر: | Algorithms, Vol 17, Iss 6, p 246 (2024) |
| بيانات النشر: | MDPI AG, 2024. |
| سنة النشر: | 2024 |
| المجموعة: | LCC:Industrial engineering. Management engineering LCC:Electronic computers. Computer science |
| مصطلحات موضوعية: | data in motion, uncertain inputs, collision avoidance, online algorithms, competitive analysis, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95 |
| الوصف: | 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 as collision avoidance, may be unavoidable. However, the associated difficulties are compounded if there is uncertainty about the precise location of entities, giving rise to potential encroachment and, more generally, potential congestion within the full collection. We adopt a model in which entities can be queried for their current location (at some cost) and the uncertainty region associated with an entity grows in proportion to the time since that entity was last queried. The goal is to maintain low potential congestion, measured in terms of the (dynamic) intersection graph of uncertainty regions, at specified (possibly all) times, using the lowest possible query cost. Previous work in the same uncertainty model addressed the problem of minimizing the congestion potential of point entities using location queries of some bounded frequency. It was shown that it is possible to design query schemes that are O(1)-competitive, in terms of worst-case congestion potential, with other, even clairvoyant query schemes (that exploit knowledge of the trajectories of all entities), subject to the same bound on query frequency. In this paper, we initiate the treatment of a more general problem with the complementary optimization objective: minimizing the query frequency, measured as the reciprocal of the minimum time between queries (granularity), while guaranteeing a fixed bound on congestion potential of entities with positive extent at one specified target time. This complementary objective necessitates quite different schemes and analyses. Nevertheless, our results parallel those of the earlier papers, specifically tight competitive bounds on required query frequency. |
| نوع الوثيقة: | article |
| وصف الملف: | electronic resource |
| اللغة: | English |
| تدمد: | 1999-4893 |
| العلاقة: | https://www.mdpi.com/1999-4893/17/6/246Test; https://doaj.org/toc/1999-4893Test |
| DOI: | 10.3390/a17060246 |
| الوصول الحر: | https://doaj.org/article/dbb17b42e27b434296d6d0fdd6416fbaTest |
| رقم الانضمام: | edsdoj.bb17b42e27b434296d6d0fdd6416fba |
| قاعدة البيانات: | Directory of Open Access Journals |
Full Text Finder | تدمد: | 19994893 |
|---|---|
| DOI: | 10.3390/a17060246 |