Scheduling drones to cover outdoor events O. Aichholzer 1 , L. E. - - PowerPoint PPT Presentation

scheduling drones to cover outdoor events
SMART_READER_LITE
LIVE PREVIEW

Scheduling drones to cover outdoor events O. Aichholzer 1 , L. E. - - PowerPoint PPT Presentation

Scheduling drones to cover outdoor events O. Aichholzer 1 , L. E. Caraballo 2 , J.M. D nez 2 , R. az-B a Fabila-Monroy 3 , I. Parada 1,4 , I. Ventura 2 , and B. Vogtenhuber 1 TU 1 Graz University of Technology, Austria Graz 2 University


slide-1
SLIDE 1

Scheduling drones to cover outdoor events

  • O. Aichholzer1, L. E. Caraballo2, J.M. D´

ıaz-B´ a˜ nez2, R. Fabila-Monroy3, I. Parada1,4, I. Ventura2, and B. Vogtenhuber1

1Graz University of Technology, Austria 2University of Seville, Spain 3Cinvestav, Mexico 3TU Eindhoven, The Netherlands

TU

Graz

slide-2
SLIDE 2

One drone (unlimited battery)

Each event i has:

  • a location pi and
  • a time interval Ii.

Goal: Film as much (time) as possible.

p2 = (1, 10) 11:30–12:15 11:30–12:00 p1 = (12, 5) 9:15–12:00 9:15–11:00 p4 = (26, 2) 15:00–17:00 15:00–17:00 p3 = (19, 12) 12:30–16:00 12:45–14:30 base p∗ = (6, 2)

Lemma: There is an optimal plan in which the drone does not leave an event before it has ended.

slide-3
SLIDE 3

One drone (unlimited battery)

Goal: Film as much (time) as possible. Lemma: There is an optimal plan in which the drone does not leave an event before it has ended.

11 12 13 9 10 15 16 17 14 I1 I3 I2 I4 I1 I3 I2 I4 I1 I3 I2 I4 shift shift

slide-4
SLIDE 4

One drone (unlimited battery)

We construct a directed (acyclic) graph G = (V, E).

  • V : base p∗ and the points pi.
  • E: (pi, pj) iff a drone leaving pi at the end of Ii can

arrive to pj at a time t ∈ Ij := [a, b]; weight = b − t. Every (p∗, pi) is an edge with weight |Ii|. Our problem translates to finding a directed path in G from p∗ of max weight: topo. sort + dynamic programming. We can compute E efficiently in O(n5/3 + |E|) time: (x, y) at time t ⇒ (x, y, t) ∈ R3 ⇒ (x, y, t, x2, y2, z2) ∈ R6 using halfspace reporting queries in R6 we determine E. Optimal flight plan in O(n5/3 + |E|) time.

slide-5
SLIDE 5

k drones (unlimited battery)

Lemma: There is an optimal plan in which: a) no drone leaves an event before it has ended and b) no two drones film at the same point at the same time. We introduce a second operation:

swap

  • Do shifts until every drone leaves an event either at the

end or when another drone arrives.

  • Do swaps until a) is satisfied.
slide-6
SLIDE 6

k drones (unlimited battery)

Lemma: There is an optimal plan in which: a) no drone leaves an event before it has ended and b) no two drones film at the same point at the same time. We construct the same DAG G = (V, E) as before. Our problem translates to finding a set of k disjoint paths in G starting at p∗ of max weight. NP-complete for general graphs, but polynomial for DAGs. Optimal flight plan in O(n2(log n + k) + n|E|) time.

  • Min. # drones to cover it all in O(n5/3 + √n|E′|) time.
slide-7
SLIDE 7

One drone with limited battery

The set of theoretically relevant event-times for an optimal solution can be discretized. Moreover, an optimal solution can be encoded using a linear number of driving instructions. Applying dynamic programming we can compute an

  • ptimal sequence of instructions in polynomial time.
slide-8
SLIDE 8

Conclusions

We studied the problem of optimally scheduling drones to film n events happening at certain time intervals in different places.

  • One drone with no battery constraints:

O(n5/3 + |E|) algorithm, where |E| = O(n2).

  • k drones with no battery constraints:

O(n2(log n + k) + n|E|) algorithm, where |E| = O(n2).

  • Polynomial algorithm for one drone with limited battery.

Thank you!

  • NEW! k drones with limited battery: NP-hard.