Asset Details
Do you wish to reserve the book?
Asymptotically Optimal Deployment of Drones for Surveillance and Monitoring
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Asymptotically Optimal Deployment of Drones for Surveillance and Monitoring
Do you wish to request the book?
Asymptotically Optimal Deployment of Drones for Surveillance and Monitoring
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Asymptotically Optimal Deployment of Drones for Surveillance and Monitoring
2019
Overview
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.
