Unmanned aerial vehicle (UAV) can act as flying base station to provide ground user (GU) with ubiquitous service in crowded or remote areas. The objective of this letter is to obtain the multi-UAV coverage scheme for maximizing the average capacity of UAV, while simultaneously ensuring that the deployed UAVs can cover all the massive or scattered GUs. We propose the dense boundary prioritized coverage (DBPC) scheme, the main idea of which is the high priority given to cover the dense boundary GU, to deploy multiple UAVs for the average UAV capacity maximization. Particularly, in DBPC scheme, the feasible region division (FRD) algorithm, which utilizes the Lagrange method, is obtained to derive the optimal placement of single UAV for maximizing the UAV capacity. Simulation results are presented to validate the superiority of proposed DBPC scheme.

中文翻译：

---

平均容量最大化的多无人机覆盖方案

无人机（UAV）可以作为飞行基站，为地面用户（GU）在拥挤或偏远地区提供无处不在的服务。这封信的目的是获得多无人机覆盖方案，以最大化无人机的平均容量，同时确保部署的无人机可以覆盖所有海量或分散的 GU。我们提出了密集边界优先覆盖（DBPC）方案，其主要思想是给予密集边界GU覆盖的高优先级，以部署多个无人机以实现平均无人机容量最大化。特别是在DBPC方案中，获得了利用拉格朗日方法的可行区域划分（FRD）算法来推导单个无人机的最佳放置，以最大化无人机容量。仿真结果验证了所提出的 DBPC 方案的优越性。