@inproceedings{01cc76b73a21480a8610953b78715765,

title = "Connected Ad-Hoc swarm of drones",

abstract = "In this paper, we study the following connected version of the covering problem motivated by the coverage of ad-hoc 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 equal radius disks that correspond to the covering radius of each drone. We want to place a set P such that the sum of the weights of the points in S covered by disks from P is maximized and the centers of disks from P form a connected graph, where two centers are connected if the distance between them is at most given value RCOM. We also consider the case of forbidden for fly zones. We present a number of approximate solutions showing trade-off between the quality of coverage and the number of participating drones.",

keywords = "approximation algorithm, connected drones, coverage problem",

author = "Kiril Danilchenko and Michael Segal",

note = "Publisher Copyright: {\textcopyright} 2020 ACM.; 6th ACM Workshop on Micro Aerial Vehicle Networks, Systems, and Applications, DroNet 2020 ; Conference date: 15-06-2020",

year = "2020",

month = jun,

day = "19",

doi = "10.1145/3396864.3399699",

language = "English",

series = "Proceedings of the 6th ACM Workshop on Micro Aerial Vehicle Networks, Systems, and Applications, DroNet 2020",

publisher = "Association for Computing Machinery, Inc",

booktitle = "Proceedings of the 6th ACM Workshop on Micro Aerial Vehicle Networks, Systems, and Applications, DroNet 2020",

}