Qingran Su

Dr. Qingran Su

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 August 2022 in Drones
Verified
Journal Article
Open access
PDF file
Yongfeng YinYongfeng Yin
Yongfeng Yin
YGYang Guo
Yang Guo
QSQingran Su
Qingran Su
ZWZhetao Wang
Zhetao Wang
With the development of UAV technology, the task allocation problem of multiple UAVs is remarkable, but most of these existing heuristic methods are easy to fall into the problem of local optimization. In view of this limitation, deep transfer reinforcement learning is applied to the task allocation problem of multiple unmanned aerial vehicles, which provides a new idea about solving this kind of problem. The deep migration reinforcement learning algorithm based on QMIX is designed. The algorithm first compares the target task with the source task in the strategy base to find the task with the highest similarity, and then migrates the network parameters obtained from the source task after training, stored in the strategy base, so as to accelerate the convergence of the QMIX algorithm. Simulation results show that the proposed algorithm is significantly better than the traditional heuristic method of allocation in terms of efficiency and has the same running time.

21 June 2024 in Electronics
Verified
Journal Article
Open access
PDF file
Yongfeng YinYongfeng Yin
Yongfeng Yin
ZWZhetao Wang
Zhetao Wang
LZLili Zheng
Lili Zheng
QSQingran Su
Qingran Su
YGYang Guo
Yang Guo
Unmanned aerial vehicle (UAV) navigation plays a crucial role in its ability to perform autonomous missions in complex environments. Most of the existing reinforcement learning methods to solve the UAV navigation problem fix the flight altitude and velocity, which largely reduces the difficulty of the algorithm. But the methods without adaptive control are not suitable in low-altitude environments with complex situations, generally suffering from weak obstacle avoidance. Some UAV navigation studies with adaptive flight only have weak obstacle avoidance capabilities. To address the problem of UAV navigation in low-altitude environments, we construct autonomous UAV navigation in 3D environments with adaptive control as a Markov decision process and propose a deep reinforcement learning algorithm. To solve the problem of weak obstacle avoidance, we creatively propose the guide attention method to make a UAV’s decision focus shift between the navigation task and obstacle avoidance task according to changes in the obstacle. We raise a novel velocity-constrained loss function and add it to the original actor loss to improve the UAV’s velocity control capability. Simulation experiment results demonstrate that our algorithm outperforms some of the state-of-the-art deep reinforcement learning algorithms performing UAV navigation tasks in a 3D environment and has outstanding performance in algorithm effectiveness, with the average reward increasing by 9.35, the success rate of navigation tasks increasing by 14%, and the collision rate decreasing by 14%.

1 January 2023 in Mathematical Biosciences and Engineering
Verified
Journal Article
Open access
PDF file
YYYongfeng Yin
Yongfeng Yin
RZRouting Zhang
Routing Zhang
QSQingran Su
Qingran Su
Target threat assessment is a critical aspect of information warfare and can offer valuable auxiliary support to combat command decision-making. Aiming to address the shortcomings of three decision-making methods in air combat target assessment, such as the inability to effectively handle uncertain situation information and quantitatively rank the decision-making targets according to their importance, a dynamic intuitionistic fuzzy decision model based on the improved GRA-TOPSIS method and three-way decisions is proposed. First, the target attribute weight is obtained by cosine intuitionistic fuzzy entropy algorithm; then, a novel intuitionistic fuzzy distance measure is introduced, and grey incidence analysis and TOPSIS are used to build the conditional probability for three-way decisions that fully utilize the existing information and reflect the consistency of dynamic change trend; finally, the comprehensive loss function matrix is constructed and the threat classification results are obtained using the decision rules. The example analysis shows that the proposed method can not only effectively handle complex battlefield situations and dynamic uncertain information, but it can also classify targets, improving the effectiveness and rationality of decision-making and providing a reference basis for scientific command decision-making.

17 January 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Ruinan QiuRuinan Qiu
Ruinan Qiu
Yongfeng YinYongfeng Yin
Yongfeng Yin
QSQingran Su
Qingran Su
TGTianyi Guan
Tianyi Guan
In the field of ensemble learning, bagging and stacking are two widely used ensemble strategies. Bagging enhances model robustness through repeated sampling and weighted averaging of homogeneous classifiers, while stacking improves classification performance by integrating multiple models using meta-learning strategies, taking advantage of the diversity of heterogeneous classifiers. However, the fixed weight distribution strategy in traditional bagging methods often has limitations when handling complex or imbalanced datasets. This paper combines the concept of heterogeneous classifier integration in stacking with the weighted averaging strategy of bagging, proposing a new adaptive weight distribution approach to enhance bagging’s performance in heterogeneous ensemble settings. Specifically, we propose three weight generation functions with “high at both ends, low in the middle” curve shapes and demonstrate the superiority of this strategy over fixed weight methods on two datasets. Additionally, we design a specialized neural network, and by training it adequately, validate the rationality of the proposed adaptive weight distribution strategy, further improving the model’s robustness. The above methods are collectively called func-bagging. Experimental results show that func-bagging has an average 1.810% improvement in extreme performance compared to the base classifier, and is superior to stacking and bagging methods. It also has better dataset adaptability and interpretability than stacking and bagging. Therefore, func-bagging is particularly effective in scenarios with class imbalance and is applicable to classification tasks with imbalanced classes, such as anomaly detection.

19 February 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
QSQingran Su
Qingran Su
XLXingze Li
Xingze Li
YRYuming Ren
Yuming Ren
Ruinan QiuRuinan Qiu
Ruinan Qiu
CHChunming Hu
Chunming Hu
Yongfeng YinYongfeng Yin
Yongfeng Yin
Continuous integration (CI), a crucial technology for accelerating software delivery, employs prioritization methods to optimize testing efficiency. Reinforcement-learning-based prioritization techniques of test cases can dynamically adjust the prioritization strategy based on test feedback. However, existing reinforcement learning models either use feature information from individual test cases or the complete feature of all test cases as input. The model’s input is fixed and does not vary based on the characteristics of the test case set. This leads to the model’s inability to handle various ranking scenarios in CI. In this paper, we propose a novel Attention Transfer Reinforcement Learning for Test Case Prioritization (ATRL-TCP) method. ATRL-TCP first leverages the richness of historical information and error rates to assess the test case set. It then determines whether the model’s input should be the feature information of a single test case or the relative order between them. This method allows for the shifting of focus based on the dataset characteristics. We validate the method on four industrial datasets and examine the impact of historical information length and error rate on its performance. The results demonstrate that ATRL-TCP has good generalization ability and achieves good ranking performance within an acceptable time.

16 February 2026 in Computational Intelligence
Verified
Journal Article
Open access
QSQingran Su
Qingran Su
XLXingze Li
Xingze Li
YRYuming Ren
Yuming Ren
BFBing Fu
Bing Fu
CHChunming Hu
Chunming Hu
YYYongfeng Yin
Yongfeng Yin
Graph Neural Networks (GNNs) are widely applied in 3D computer vision tasks. However, validating their reliability is limited by the high cost of labeling large‐scale test data. Existing test case prioritization techniques for deep learning often rely on single‐dimensional heuristics or mutation‐based analysis (e.g., GraphPrior, PCPrior). However, these methods often limit fault diversity or incur prohibitive computational overhead. To address these issues, this paper proposes LeF‐MTP, a multi‐dimensional test prioritization framework. Unlike these state‐of‐the‐art methods that depend on computationally intensive external mutations, LeF‐MTP directly exploits the model's internal cognitive states. The method characterizes test cases through two dimensions: the predictive uncertainty and feature‐space confusability. These cognitive features are fused via a Random Forest classifier to predict failure probabilities. The resulting priority list is then optimized by a diversity‐aware re‐ranking process based on feature clustering. We evaluated the framework on four 3D point cloud datasets (including ScanObjectNN and S3DIS) across four GNN architectures. Experimental results demonstrate that LeF‐MTP achieves higher fault detection rates than heuristic and mutation‐based baselines, with Average Percentage of Fault Detection (APFD) improvements ranging from 8.79% to 74.69%. Moreover, an efficiency analysis demonstrates that the proposed approach reduces feature generation time compared to mutation‐based methods, validating its practicality for GNN testing.