Construction and Maintenance of Swarm Drones

by   Kiril Danilchenko, et al.

In this paper we study the dynamic version of the covering problem motivated by the coverage of drones' swarm: Let S be a set of n non-negative weighted points in the plane representing users. Also, consider a set P of m disks that correspond to the covering radius of each drone. We want to place (and maintain) set P such that the sum of the weights of the points in S covered by disks from P is maximized. We present a data structure that maintains a small constant factor approximate solution efficiently, under insertions and deletions of points to/from S where each update operation can be performed O(log n) time.



page 1

page 2

page 3

page 4


Dynamic Geometric Set Cover, Revisited

Geometric set cover is a classical problem in computational geometry, wh...

K_1,3-covering red and blue points in the plane

We say that a finite set of red and blue points in the plane in general ...

Assigning Weights to Minimize the Covering Radius in the Plane

Given a set P of n points in the plane and a multiset W of k weights wit...

Dynamic Products of Ranks

We describe a data structure that can maintain a dynamic set of points g...

Reachability Problems for Transmission Graphs

Let P be a set of n points in the plane where each point p of P is assoc...

On Undecided LP, Clustering and Active Learning

We study colored coverage and clustering problems. Here, we are given a ...

Efficient quantization and weak covering of high dimensional cubes

Let ℤ_n = {Z_1, ..., Z_n} be a design; that is, a collection of n points...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.