Online Drone Coverage of Targets on a Line
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908934430785536 |
|---|---|
| author | Dobrev, Stefan Georgiou, Konstantinos Kranakis, Evangelos Krizanc, Danny Narayanan, Lata Opatrny, Jaroslav Pankratov, Denis Shende, Sunil |
| author_facet | Dobrev, Stefan Georgiou, Konstantinos Kranakis, Evangelos Krizanc, Danny Narayanan, Lata Opatrny, Jaroslav Pankratov, Denis Shende, Sunil |
| contents | We study a problem of online targets coverage by a drone or a sensor that is equipped with a camera or an antenna of fixed half-angle of view $α$. The targets to be monitored appear at arbitrary positions on a line barrier in an online manner. When a new target appears, the drone has to move to a location that covers the newly arrived target, as well as already existing targets. The objective is to design a coverage algorithm that optimizes the total length of the drone's trajectory. Our results are reported in terms of an algorithm's competitive ratio, i.e., the worst-case ratio (over all inputs) of its cost to that of an optimal offline algorithm.
In terms of upper bounds, we present three online algorithms and prove bounds on their competitive ratios for every $α\in [0, π/2]$. The best of them, called \FA is significantly better than the other two for $π/6 < α< π/3$. In particular, for $α=π/4$, its worst case, \FA has competitive ratio $1.25$, while the other two have competitive ratio $\sqrt{2}$. Finally, we prove a lower bound on the competitive ratio of online algorithms for a drone with half-angle $α\in [0, π/4]$; this bound is a function of $α$ that achieves its maximum value at $α= π/4$ equal to $(1+\sqrt{2})/2 \approx 1.207$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_02491 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Online Drone Coverage of Targets on a Line Dobrev, Stefan Georgiou, Konstantinos Kranakis, Evangelos Krizanc, Danny Narayanan, Lata Opatrny, Jaroslav Pankratov, Denis Shende, Sunil Data Structures and Algorithms We study a problem of online targets coverage by a drone or a sensor that is equipped with a camera or an antenna of fixed half-angle of view $α$. The targets to be monitored appear at arbitrary positions on a line barrier in an online manner. When a new target appears, the drone has to move to a location that covers the newly arrived target, as well as already existing targets. The objective is to design a coverage algorithm that optimizes the total length of the drone's trajectory. Our results are reported in terms of an algorithm's competitive ratio, i.e., the worst-case ratio (over all inputs) of its cost to that of an optimal offline algorithm. In terms of upper bounds, we present three online algorithms and prove bounds on their competitive ratios for every $α\in [0, π/2]$. The best of them, called \FA is significantly better than the other two for $π/6 < α< π/3$. In particular, for $α=π/4$, its worst case, \FA has competitive ratio $1.25$, while the other two have competitive ratio $\sqrt{2}$. Finally, we prove a lower bound on the competitive ratio of online algorithms for a drone with half-angle $α\in [0, π/4]$; this bound is a function of $α$ that achieves its maximum value at $α= π/4$ equal to $(1+\sqrt{2})/2 \approx 1.207$. |
| title | Online Drone Coverage of Targets on a Line |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2604.02491 |