Drone Air Traffic Control: Tracking a Set of Moving Objects with Minimal Power
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908868501569536 |
|---|---|
| author | Loi, Chek-Manh Perk, Michael Hoffmann, Malte Fekete, Sándor |
| author_facet | Loi, Chek-Manh Perk, Michael Hoffmann, Malte Fekete, Sándor |
| contents | A common sensing problem is to use a set of stationary tracking locations to monitor a collection of moving devices: Given $n$ objects that need to be tracked, each following its own trajectory, and $m$ stationary traffic control stations, each with a sensing region of adjustable range; how should we adjust the individual sensor ranges in order to optimize energy consumption? We provide both negative theoretical and positive practical results for this important and natural challenge.
On the theoretical side, we show that even if all objects move at constant speed along straight lines, no polynomial-time algorithm can guarantee optimal coverage for a given starting solution. On the practical side, we present an algorithm based on geometric insights that is able to find optimal solutions for the $\min \max$ variant of the problem, which aims at minimizing peak power consumption. Runtimes for instances with 500 moving objects and 25 stations are in the order of seconds for scenarios that take minutes to play out in the real world, demonstrating real-time capability of our methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_05286 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Drone Air Traffic Control: Tracking a Set of Moving Objects with Minimal Power Loi, Chek-Manh Perk, Michael Hoffmann, Malte Fekete, Sándor Computational Geometry F.2.2 A common sensing problem is to use a set of stationary tracking locations to monitor a collection of moving devices: Given $n$ objects that need to be tracked, each following its own trajectory, and $m$ stationary traffic control stations, each with a sensing region of adjustable range; how should we adjust the individual sensor ranges in order to optimize energy consumption? We provide both negative theoretical and positive practical results for this important and natural challenge. On the theoretical side, we show that even if all objects move at constant speed along straight lines, no polynomial-time algorithm can guarantee optimal coverage for a given starting solution. On the practical side, we present an algorithm based on geometric insights that is able to find optimal solutions for the $\min \max$ variant of the problem, which aims at minimizing peak power consumption. Runtimes for instances with 500 moving objects and 25 stations are in the order of seconds for scenarios that take minutes to play out in the real world, demonstrating real-time capability of our methods. |
| title | Drone Air Traffic Control: Tracking a Set of Moving Objects with Minimal Power |
| topic | Computational Geometry F.2.2 |
| url | https://arxiv.org/abs/2603.05286 |