Abstract This paper models the problem of providing an unmanned aerial vehicle (UAV)-based wireless network in a disaster area as a set covering problem that takes into consideration the operational constraints and benefits of UAVs. The research presents a branch-and-price algorithm and two approximation models of the quadratic coverage radius constraint in a simple discretization and a linear pairwise-conflict constraint based on Jung’s theorem. In computational experiments, we found that the exact branch-and-price algorithm and two approximation models are applicable for realistic-scaled problems with up to 100 demand points and 2,000 m of coverage radius.

中文翻译：

---

考虑固定半径覆盖约束的无人机集合覆盖问题

摘要 本文将在灾区提供基于无人机 (UAV) 的无线网络的问题建模为一个集合覆盖问题，该问题考虑了无人机的操作限制和优势。该研究提出了一种分支和价格算法以及简单离散化中的二次覆盖半径约束和基于荣格定理的线性成对冲突约束的两个近似模型。在计算实验中，我们发现精确的分支和价格算法和两个近似模型适用于具有多达 100 个需求点和 2,000 m 覆盖半径的现实规模问题。