4.8 Article

Dynamic Charging Scheme Problem With Actor-Critic Reinforcement Learning

期刊

IEEE INTERNET OF THINGS JOURNAL
卷 8, 期 1, 页码 370-380

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JIOT.2020.3005598

关键词

Actor-critic reinforcement learning (ACRL); charging scheme; mobile charger (MC); wireless rechargeable sensor networks (WRSNs)

资金

  1. National Natural Science Foundation of China [61572113, 61877009]
  2. Fundamental Research Funds for the Central Universities [ZYGX2019J075]

向作者/读者索取更多资源

In this article, a novel dynamic charging scheme based on actor-critic reinforcement learning algorithm in WRSN is proposed. The use of GRUs to capture the relationships of charging actions in time sequence is introduced. Extensive simulations show that the proposed ACRL algorithm surpasses heuristic algorithms in average lifetime and tour length.
The energy problem is one of the most important challenges in the application of sensor networks. With the development of wireless charging technology and intelligent mobile charger (MC), the energy problem can be solved by the wireless charging strategy. In the practical application of wireless rechargeable sensor networks (WRSNs), the energy consumption rate of nodes is dynamically changed due to many uncertainties, such as the death and different transmission tasks of sensor nodes. However, existing works focus on on-demand schemes, which not fully consider real-time global charging scheduling. In this article, a novel dynamic charging scheme (DCS) in WRSN based on the actor-critic reinforcement learning (ACRL) algorithm is proposed. In the ACRL, we introduce gated recurrent units (GRUs) to capture the relationships of charging actions in time sequence. Using the actor network with one GRU layer, we can pick up an optimal or near-optimal sensor node from candidates as the next charging target more quickly and speed up the training of the model. Meanwhile, we take the tour length and the number of dead nodes as the reward signal. Actor and critic networks are updated by the error criterion function of R and V. Compared with current on-demand charging scheduling algorithms, extensive simulations show that the proposed ACRL algorithm surpasses heuristic algorithms, such as the Greedy, DP, nearest job next with preemption, and TSCA in the average lifetime and tour length, especially against the size and complexity increasing of WRSNs.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据