Connected Ad-Hoc swarm of drones

Kiril Danilchenko, Michael Segal

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

3 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings of the 6th ACM Workshop on Micro Aerial Vehicle Networks, Systems, and Applications, DroNet 2020
PublisherAssociation for Computing Machinery, Inc
ISBN (Electronic)9781450380102
DOIs
StatePublished - 19 Jun 2020
Event6th ACM Workshop on Micro Aerial Vehicle Networks, Systems, and Applications, DroNet 2020 - Toronto, Canada
Duration: 15 Jun 2020 → …

Publication series

NameProceedings of the 6th ACM Workshop on Micro Aerial Vehicle Networks, Systems, and Applications, DroNet 2020

Conference

Conference6th ACM Workshop on Micro Aerial Vehicle Networks, Systems, and Applications, DroNet 2020
Country/TerritoryCanada
CityToronto
Period15/06/20 → …

Keywords

  • approximation algorithm
  • connected drones
  • coverage problem

Cite this