Filming runners with drones is hard
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909144573804544 |
|---|---|
| author | Díaz-Báñez, José-Miguel Fabila-Monroy, Ruy |
| author_facet | Díaz-Báñez, José-Miguel Fabila-Monroy, Ruy |
| contents | The use of drones or Unmanned Aerial Vehicles (UAVs) for aerial photography and cinematography is becoming widespread. The following optimization problem has been recently considered. Let us imagine a sporting event where a group of runners are competing and a team of drones with cameras are used to cover the event. The media \emph{director} selects a set of \emph{filming scenes} (determined by locations and time intervals) and the goal is to maximize the total \emph{filming time} (the sum of recordings) achieved by the aerial cinematographers. Recently, it has been showed that this problem can be solved in polynomial time assuming the drones have unlimited battery endurance. In this paper, we prove that the problem is NP-hard for the more realistic case in which the battery endurance of the drones is limited. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_14033 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Filming runners with drones is hard Díaz-Báñez, José-Miguel Fabila-Monroy, Ruy Computational Geometry The use of drones or Unmanned Aerial Vehicles (UAVs) for aerial photography and cinematography is becoming widespread. The following optimization problem has been recently considered. Let us imagine a sporting event where a group of runners are competing and a team of drones with cameras are used to cover the event. The media \emph{director} selects a set of \emph{filming scenes} (determined by locations and time intervals) and the goal is to maximize the total \emph{filming time} (the sum of recordings) achieved by the aerial cinematographers. Recently, it has been showed that this problem can be solved in polynomial time assuming the drones have unlimited battery endurance. In this paper, we prove that the problem is NP-hard for the more realistic case in which the battery endurance of the drones is limited. |
| title | Filming runners with drones is hard |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2403.14033 |