Optimal Dynamic Recharge Scheduling for Two-Stage Wireless Power Transfer

摘要

Many industrial-Internet-of-Things applications require autonomous operation and incorporate devices in inaccessible locations. Recent advances in wireless power transfer (WPT) and autonomous vehicle technologies, in combination, have the potential to solve a number of residual problems concerning the maintenance of, and data collection from embedded devices. Equipping inexpensive unmanned aerial vehicles (UAV) and embedded devices with subsystems to facilitate WPT allows a UAV to become a viable mobile power delivery vehicle (PDV) and data collection agent. A key challenge is, therefore, to ensure that a PDV can optimally schedule power delivery across the network, such that it is as reliable and resource efficient as possible. To achieve this and out-perform naive on-demand recharging strategies, in this article, we propose a two-stage wireless power network (WPN) approach in which a large network of devices may be grouped into small clusters, where packets of energy inductively delivered to each cluster by the PDV are acoustically distributed to devices within the cluster. In this article, we describe a novel dynamic recharge scheduling algorithm that combines genetic weighted clustering with nearest neighbor search to jointly minimize PDV travel distance and WPT losses. The efficacy and performance of the algorithm are evaluated in simulation using experimentally derived traces, and the algorithm is shown to achieve similar to 90% throughput for large, dense networks.