Asymptotically Optimal Deployment of Drones for Surveillance and Monitoring

Sensors

AndreyV. Savkin¹  Hailong Huang¹ 

[1] School of Electrical Engineering and Telecommunications, University of New South Wales, Sydney 2052, Australia;

关键词: drones;    UAVs;    aerial surveillance;    aerial monitoring;    coverage control;    triangular coverage;    flying robots;    internet of flying robots;    internet of drones;    Kershner’s theorem;   

DOI  :  10.3390/s19092068

来源: DOAJ

【 摘 要 】

This paper studies the problem of placing a set of drones for surveillance of a ground region. The main goal is to determine the minimum number of drones necessary to be deployed at a given altitude to monitor the region. An easily implementable algorithm to estimate the minimum number of drones and determine their locations is developed. Moreover, it is proved that this algorithm is asymptotically optimal in the sense that the ratio of the number of drones required by this algorithm and the minimum number of drones converges to one as the area of the ground region tends to infinity. The proof is based on Kershner’s theorem from combinatorial geometry. Illustrative examples and comparisons with other existing methods show the efficiency of the developed algorithm.

【 授权许可】

Unknown