Scheduling drones to cover outdoor events

O. Aichholzer, L. E. Caraballo, J.M. Díaz-Báñez, Ruy Fabila-Monroy, I. Parada, I. Ventura, B. Vogtenhuber

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review


Task allocation is an important aspect of many multi-robot systems. In this paper, we consider a new task allocation problem that appears in multi-robot aerial cinematography. The main goal is to distribute a set of tasks (shooting actions) among the team members optimizing a certain objective function. The tasks are given as sequences of waypoints with associated time intervals (scenes). We prove that the task allocation problem maximizing the total filmed time by $k$ aerial robots (drones) can be solved in polynomial time when the drones do not require battery recharge. We also consider the problem in which the drones have a limited battery endurance and must periodically go to a static base station. For this version, we show how to solve the problem in polynomial time when only one drone is available.
Original languageEnglish
Title of host publicationProceedings of the 36th European Workshop on Computational Geometry (EuroCG 2020))
Place of PublicationWürzburg, Germany
Number of pages7
Publication statusPublished - 2020
Event36th European Workshop on Computational Geometry : EuroCG 2020 - University of Würzburg, Würzburg, Virtuell, Germany
Duration: 16 Mar 202018 Mar 2020


Conference36th European Workshop on Computational Geometry
Abbreviated titleEuroCG 2020
CityWürzburg, Virtuell
Internet address

Fields of Expertise

  • Information, Communication & Computing


Dive into the research topics of 'Scheduling drones to cover outdoor events'. Together they form a unique fingerprint.

Cite this