{"title":"Filming runners with drones is hard","authors":"José-Miguel Díaz-Báñez, Ruy Fabila-Monroy","doi":"arxiv-2403.14033","DOIUrl":null,"url":null,"abstract":"The use of drones or Unmanned Aerial Vehicles (UAVs) for aerial photography\nand cinematography is becoming widespread. The following optimization problem\nhas been recently considered. Let us imagine a sporting event where a group of\nrunners are competing and a team of drones with cameras are used to cover the\nevent. The media \\emph{director} selects a set of \\emph{filming scenes}\n(determined by locations and time intervals) and the goal is to maximize the\ntotal \\emph{filming time} (the sum of recordings) achieved by the aerial\ncinematographers. Recently, it has been showed that this problem can be solved\nin polynomial time assuming the drones have unlimited battery endurance. In\nthis paper, we prove that the problem is NP-hard for the more realistic case in\nwhich the battery endurance of the drones is limited.","PeriodicalId":501570,"journal":{"name":"arXiv - CS - Computational Geometry","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computational Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2403.14033","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
