Deploying the Minimum Number of Rechargeable UAVs for a Quarantine Barrier

Abstract

To control the rapid spread of COVID-19, we consider deploying a set of Unmanned Aerial Vehicles (UAVs) to form a quarantine barrier such that anyone crossing the barrier can be detected. We use a charging pile to recharge UAVs. The problem is scheduling UAVs to cover the barrier, and, for any scheduling strategy, estimating the minimum number of UAVs needed to cover the barrier forever. We propose breaking the barrier into subsegments so that each subsegment can be monitored by a single UAV. We then analyze two scheduling strategies, where the first one is simple to implement and the second one requires fewer UAVs. The first strategy divides UAVs into groups with each group covering a subsegment. For this strategy, we derive a closed-form formula for the minimum number of UAVs. In the case of insufficient UAVs, we give a recursive function to compute the exact coverage time and give a dynamic-programming algorithm to allocate UAVs to subsegments to maximize the overall coverage time. The second strategy schedules all UAVs dynamically. We prove a lower and an upper bound on the minimum number of UAVs. We implement a prototype system to verify the proposed coverage model and perform simulations to investigate the performance.