Due to the merit without requiring charging cable, wireless power transfer technology has drawn rising attention as a new method to replenish energy for Wireless Rechargeable Sensor Networks. In this article, we study the mobile charger scheduling problem for multi-node recharging with deadline constraints. Our target is to maximize the overall effective charging utility and minimize the traveling time for moving as well. Instead of charging only once over a scheduling cycle, we incorporate the multi-node charging strategy with deadline constraints, where charging spots and tour are jointly optimized. Specifically, we formulate the effective charging utility maximization problem as a monotone submodular function optimization subject to a partition matroid constraint, and we propose a simple but effective ½-approximation greedy algorithm. After that, we derive the result of global scheduling and present the grid-based skip-substitute operation to further save the traveling time, which can increase the charging utility. Finally, we conduct the evaluation for the performance of our scheduling scheme. The simulation and field experiment results show that our algorithm excels in terms of effective charging utility.

中文翻译：

---

更多的

由于不需要充电电缆的优点，无线电力传输技术作为一种为无线可充电传感器网络补充能量的新方法越来越受到关注。在本文中，我们研究了具有期限约束的多节点充电的移动充电器调度问题。我们的目标是最大限度地提高整体有效充电效用，同时最大限度地减少移动的旅行时间。我们不是在一个调度周期内只计费一次，而是将多节点计费策略与截止日期限制相结合，其中计费点和旅游联合优化。具体来说，我们将有效充电效用最大化问题表述为受分区拟阵约束的单调子模函数优化，并提出了一种简单但有效的 ½ 近似贪心算法。跳过替代进一步节省出行时间，增加充电实用性。最后，我们对调度方案的性能进行评估。仿真和现场实验结果表明，我们的算法在有效充电效用方面表现出色。