Shuwei Qiu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shuwei Qiu has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Xiaoqing Dong
School of Physics and Electronic Engineering, Hanshan Normal University, Chaozhou, China
2 shared publications Chang Wang
School of Physics and Electronic Engineering, Hanshan Normal University, Chaozhou, China
1 shared publicationGengzhong Zheng
School of Physics and Electronic Engineering, Hanshan Normal University, Chaozhou, China
1 shared publication- Gengzhong Zheng
Department of Computer Science and Engineering, Hanshan Normal University, Chaozhou, China
1 shared publication - Liming Miao
Hanshan Normal University, Chaozhou 521041, China
1 shared publication - Mahammad Humayoo
Hanshan Normal University, Chaozhou 521041, China
1 shared publication
Latest Publications
- Open Access
- 20 November 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (11) , 729
Segmenting Action-Value Functions over Time Scales in SARSA via TD(Δ)
In numerous episodic reinforcement learning (RL) environments, SARSA-based methodologies are employed to enhance policies aimed at maximizing returns over long horizons. Traditional SARSA algorithms face challenges in achieving an optimal balance between bias and variation, primarily due to their dependence on a single, constant discount factor (). This study enhances the temporal difference decomposition method, TD(), by applying it to the SARSA algorithm, wherein the action-value function is segmented into several components based on the differences between action-value functions linked to specific discount factors. Each component, referred to as a delta estimator (D), is linked to a specific discount factor and learned independently. This modified technique is referred to as SARSA(). SARSA is a widely used on-policy RL method that enhances action-value functions via temporal difference updates. This decomposition, namely SARSA(), facilitates learning across a range of time scales. This analysis makes learning more effective and guarantees consistency, especially in situations where long-horizon improvement is needed. The results of this research show that the proposed technique works to lower bias in SARSA’s updates and speed up convergence in both deterministic and stochastic settings, even in dense-reward Atari environments. Experimental results from a variety of benchmark settings show that the proposed SARSA() outperforms existing TD learning techniques in both tabular and deep RL environments.- 20 November 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (11) , 729
Open AccessSegmenting Action-Value Functions over Time Scales in SARSA via TD(Δ)
In numerous episodic reinforcement learning (RL) environments, SARSA-based methodologies are employed to enhance policies aimed at maximizing returns over long horizons. Traditional SARSA algorithms face challenges in achieving an optimal balance between bias and variation, primarily due to their dependence on a single, constant discount factor (). This study enhances the temporal difference decomposition method, TD(), by applying it to the SARSA algorithm, wherein the action-value function is segmented into several components based on the differences between action-value functions linked to specific discount factors. Each component, referred to as a delta estimator (D), is linked to a specific discount factor and learned independently. This modified technique is referred to as SARSA(). SARSA is a widely used on-policy RL method that enhances action-value functions via temporal difference updates. This decomposition, namely SARSA(), facilitates learning across a range of time scales. This analysis makes learning more effective and guarantees consistency, especially in situations where long-horizon improvement is needed. The results of this research show that the proposed technique works to lower bias in SARSA’s updates and speed up convergence in both deterministic and stochastic settings, even in dense-reward Atari environments. Experimental results from a variety of benchmark settings show that the proposed SARSA() outperforms existing TD learning techniques in both tabular and deep RL environments. - Top Cited PapersOpen Access
- 5 May 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-38
Coverage and connectivity maximization for wireless sensor networks using improved chaotic grey wolf optimization
Efficient network coverage and connectivity in wireless sensor networks (WSNs) is critical for modern data-driven applications requiring seamless data collection and transmission. One of the key challenges is the optimal placement of sensor nodes, which directly impacts network performance and deployment costs. This study presents an Improved Chaotic Grey Wolf Optimization (ICGWO) algorithm to enhance WSN coverage and connectivity while addressing challenges like high deployment costs, limited coverage, and insufficient connectivity. A mathematical model for the WSN coverage and connectivity optimization problem is developed as the foundation. The Grey Wolf Optimizer (GWO) is enhanced using a chaotic map, improving its ability to find the best solutions and achieve faster convergence, resulting in the ICGWO algorithm. The performance of ICGWO is evaluated using CEC_22 benchmark functions and compared with other optimization methods, demonstrating clear improvements in efficiency. In practical applications, the proposed ICGWO obtained superior results for sensor node placement. For example, with 20 sensor nodes in Case 1, the coverage rate reaches 95.9077%, while for 30 nodes in Case 2, it achieves 98.2211%. Similarly, in Case 3, with 40 sensor nodes, the coverage rate is 91.6875%, and in Case 4, with 50 sensor nodes, it is 99.4940%. In addition, in Case 5 and Case 6, with 60 and 70 sensor nodes, the coverage rates are 99.7801% and 99.7822%, respectively. These outcomes reflect average improvements of 16.41%, 5.36%, 3.45%,2.371%,2.80%, and 2.18%, respectively, compared to other state-of-the-art methods. These metrics emphasize the effectiveness of ICGWO in maximizing network coverage and connectivity. The findings confirm that ICGWO efficiently improves the coverage and connectivity, making it a reliable solution for addressing deployment challenges in diverse scenarios. By maximizing the coverage and connectivity, ICGWO significantly contributes to the advancement of WSN technology.
- 5 May 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-38
Top Cited PapersOpen AccessCoverage and connectivity maximization for wireless sensor networks using improved chaotic grey wolf optimization
Efficient network coverage and connectivity in wireless sensor networks (WSNs) is critical for modern data-driven applications requiring seamless data collection and transmission. One of the key challenges is the optimal placement of sensor nodes, which directly impacts network performance and deployment costs. This study presents an Improved Chaotic Grey Wolf Optimization (ICGWO) algorithm to enhance WSN coverage and connectivity while addressing challenges like high deployment costs, limited coverage, and insufficient connectivity. A mathematical model for the WSN coverage and connectivity optimization problem is developed as the foundation. The Grey Wolf Optimizer (GWO) is enhanced using a chaotic map, improving its ability to find the best solutions and achieve faster convergence, resulting in the ICGWO algorithm. The performance of ICGWO is evaluated using CEC_22 benchmark functions and compared with other optimization methods, demonstrating clear improvements in efficiency. In practical applications, the proposed ICGWO obtained superior results for sensor node placement. For example, with 20 sensor nodes in Case 1, the coverage rate reaches 95.9077%, while for 30 nodes in Case 2, it achieves 98.2211%. Similarly, in Case 3, with 40 sensor nodes, the coverage rate is 91.6875%, and in Case 4, with 50 sensor nodes, it is 99.4940%. In addition, in Case 5 and Case 6, with 60 and 70 sensor nodes, the coverage rates are 99.7801% and 99.7822%, respectively. These outcomes reflect average improvements of 16.41%, 5.36%, 3.45%,2.371%,2.80%, and 2.18%, respectively, compared to other state-of-the-art methods. These metrics emphasize the effectiveness of ICGWO in maximizing network coverage and connectivity. The findings confirm that ICGWO efficiently improves the coverage and connectivity, making it a reliable solution for addressing deployment challenges in diverse scenarios. By maximizing the coverage and connectivity, ICGWO significantly contributes to the advancement of WSN technology.