Sweep coverage is to realize the periodic coverage of targets by planning the periodic sweeping paths of mobile sensors. It is difficult for sensors to reduce energy consumption by reducing the moving distances. Therefore, charging technology is the best way to extend the lifetime of the sweep coverage network. This paper studies the sweep coverage of rechargeable sensors: the sensors are rechargeable, constantly sweep between the target points and the charging stations not only tp meet the periodic coverage requirement of the target points, but also need to return to the charging stations during the charging period to avoid running out of energy. This paper proposes the general definition of Chargeable Sweep Coverage (CSC) problem for the first time, and studies the complexity of the CSC problem by analyzing CSC problems under different constraints, and then proposes two kinds of CSC problems under special constraints: 1) The sensors need to return to their original charging stations for charging; 2) The sensors can go to different charging stations for charging, and the number of charging stations is 2. Both of these problems are NP-hard. In this paper, these two problems are modeled as the maximum set coverage problem, and the approximation algorithms are obtained by reducing the number of candidate paths to polynomials. The validity and scalability of the proposed algorithms is proved by theoretical proof and experimental simulation.

中文翻译：

---

可变扫描范围问题

扫描范围是通过计划移动传感器的周期性扫描路径来实现对目标的周期性覆盖。传感器难以通过减小移动距离来减少能量消耗。因此，充电技术是延长扫描覆盖网络寿命的最佳方法。本文研究了可充电传感器的扫描范围：这些传感器是可充电的，在目标点和充电站之间不断进行扫描，不仅满足目标点的周期性覆盖要求，而且在充电过程中还需要返回到充电站期间，以免耗尽能量。本文首次提出了收费扫描范围（CSC）问题的一般定义，通过分析不同约束条件下的CSC问题，研究了CSC问题的复杂性，提出了特殊约束条件下的两种CSC问题：1）传感器需要返回原充电站进行充电；2）传感器可以到不同的充电站充电，充电站的数量为2。这两个问题都是NP难题。在本文中，将这两个问题建模为最大集覆盖问题，并通过减少多项式的候选路径的数量来获得近似算法。理论证明和实验仿真证明了所提算法的有效性和可扩展性。2）传感器可以到不同的充电站充电，充电站的数量为2。这两个问题都是NP难题。本文将这两个问题建模为最大集覆盖问题，并通过减少多项式的候选路径数来获得近似算法。理论证明和实验仿真证明了所提算法的有效性和可扩展性。2）传感器可以到不同的充电站充电，充电站的数量为2。这两个问题都是NP难题。在本文中，将这两个问题建模为最大集覆盖问题，并通过减少多项式的候选路径的数量来获得近似算法。理论证明和实验仿真证明了所提算法的有效性和可扩展性。