Construction and Maintenance of Swarm Drones
Kiril Danilchenko, Michael Segal

TL;DR
This paper introduces a data structure for efficiently maintaining an approximate solution to a dynamic drone coverage problem, maximizing coverage of weighted points with insertions and deletions in logarithmic time.
Contribution
It proposes a novel data structure that maintains a constant-factor approximation for the dynamic drone coverage problem with efficient update operations.
Findings
Supports insertions and deletions in O(log n) time
Provides a constant-factor approximation for coverage maximization
Efficiently handles dynamic changes in drone coverage scenarios
Abstract
In this paper we study the dynamic version of the covering problem motivated by the coverage of drones' swarm: Let be a set of non-negative weighted points in the plane representing users. Also, consider a set of disks that correspond to the covering radius of each drone. We want to place (and maintain) set such that the sum of the weights of the points in covered by disks from is maximized. We present a data structure that maintains a small constant factor approximate solution efficiently, under insertions and deletions of points to/from where each update operation can be performed time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsUAV Applications and Optimization · Robotic Path Planning Algorithms · Distributed Control Multi-Agent Systems
