Ren-Long Qi

Ren-Long Qi

Auto-generated profile, based on publicly available information

Ren-Long Qi

School of Electrical Engineering, Zhengzhou University of Science and Technology, Zhengzhou, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
7 November 2024 in Journal of Bionic Engineering
Verified
Journal Article
Closed access
PDF file
TLTaishan Lou
Taishan Lou
YWYu Wang
Yu Wang
GGGuangsheng Guan
Guangsheng Guan
YLYingBo Lu
YingBo Lu
RQRenlong Qi
Renlong Qi

26 August 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
RQRenlong Qi
Renlong Qi
PLPengtao Lv
Pengtao Lv
QZQinghui Zhang
Qinghui Zhang
MWMeng Wu
Meng Wu
Chinese medical texts contain a large number of medically named entities. Automatic recognition of these medical entities from medical texts is the key to developing medical informatics. In the field of Chinese medical information extraction, annotated Chinese medical text data are very few. In the named entity recognition task, there is insufficient labeled data, which leads to low model recognition performance. Therefore, this paper proposes a Chinese medical entity recognition model based on multi-neural network fusion and the improved Tri-Training algorithm. The model performs semi-supervised learning by improving the Tri-Training algorithm. According to the characteristics of the medical entity recognition task and medical data, the method in this paper is improved in terms of the division of the initial sub-training set, the construction of the base classifier, and the integration of the learning voting method. In addition, this paper also proposes a multi-neural network fusion entity recognition model for base classifier construction. The model learns feature information jointly by combining Iterated Dilated Convolutional Neural Network (IDCNN) and BiLSTM. Through experimental verification, the model proposed in this paper outperforms other models and improves the performance of the Chinese medical entity recognition model by incorporating and improving the semi-supervised learning algorithm.

7 April 2025 in Evolving Systems
Verified
Journal Article
Closed access
PDF file
TLTai-Shan Lou
Tai-Shan Lou
ZYZhepeng Yue
Zhepeng Yue
ZCZhi-Wu Chen
Zhi-Wu Chen
RQRen-Long Qi
Ren-Long Qi
GLGuang Li
Guang Li

28 March 2024 in Research Square
Verified
Preprint
Open access
PDF file
TLTai-Shan Lou
Tai-Shan Lou
ZYZhepeng Yue
Zhepeng Yue
ZCZhi-Wu Chen
Zhi-Wu Chen
RQRen-Long Qi
Ren-Long Qi
GLGuang Li
Guang Li
To address the problems of low convergence efficiency and easy to fall into local extremes in the sand cat swarm optimization algorithm for solving the path planning problem of mobile robots. A hybrid multi-strategy based sand cat swarm optimization (HMSCSO) algorithm is proposed to solve the path planning problem of mobile robots. First, the nonlinear adjustment strategy is used to increase the convergence accuracy of the algorithm; Then, the logarithmic weight strategy is introduced into the position update to balance the exploration and exploitation ability of the algorithm; Next, the alternate selection strategy is used to improve the ability of the algorithm to jump out of local extremes; Finally, the position update formula of Lévy flight is introduced into the algorithm to alleviate the situation that the algorithm falls into stagnation. To verify the effectiveness of the proposed HMSCSO algorithm, 23 benchmark test functions and CEC2022 test functions are selected for comparison with other advanced optimizers. In addition, the HMSCSO algorithm is subjected to ablation experiments in three groups of environments with different obstacles. The experimental results show that the HMSCSO algorithm can effectively improve the solution accuracy.

20 August 2026 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
PDF file
RQRenlong Qi
Renlong Qi
MMMinghui Ma
Minghui Ma
XZXiaohui Zhu
Xiaohui Zhu
LSLei Shi
Lei Shi
Distributed coordination of multi-agent systems must remain reliable despite communication delays and the coexistence of cooperative and adversarial interactions induced by resource contention or misbehaving nodes. The central difficulty beyond conventional formation containment is that, once cooperative and adversarial couplings coexist on a sampled network with nonuniform delays, the closed-loop comparison dynamics lose row-stochasticity and individual transition steps become expansive, so neither standard delayed-consensus analysis nor a single Lyapunov or spectral certificate applies; the contribution is a transformation and a row-sum contraction argument that recover a closed-form resilience guarantee in this regime. This paper investigates resilient time-varying formation containment for second-order discrete-time multi-agent systems with cooperative-adversarial interactions modeled by signed graphs and subject to nonuniform delays. A distributed protocol combining each follower’s instantaneous self-state with delayed neighbor and leader states is designed; an explicit model transformation recasts the closed-loop dynamics as an augmented nonnegative comparison system whose row sums can exceed one due to competition. Using sub-stochastic and super-stochastic matrix theory, closed-form design conditions and a quantitative input-to-state stability bound are established, relating the steady-state formation error to the corrected leader- and sign-induced residual and exposing the trade-off among controller gains, sampling period, and cooperation-competition balance. Numerical experiments up to 144 agents confirm graceful error degradation with competitive intensity, bounded behavior in the super-stochastic regime, divergence when the competition margin is violated, and a clear advantage over cooperative-only baselines.

15 April 2024 in arXiv
Verified
Preprint
Open access
PDF file
TLTai-Shan Lou
Tai-Shan Lou
GGGuang-Sheng Guan
Guang-Sheng Guan
ZYZhe-Peng Yue
Zhe-Peng Yue
YWYu Wang
Yu Wang
RQRen-Long Qi
Ren-Long Qi
STShi-Hao Tong
Shi-Hao Tong
To solve the Unmanned Aerial Vehicle (UAV) path planning problem, a meta-heuristic optimization algorithm called competitive game optimizer (CGO) is proposed. In the CGO model, three phases of exploration and exploitation, and candidate replacement, are established, corresponding to the player's search for supplies and combat, and the movement toward a safe zone. In the algorithm exploration phase, Levy flight is introduced to improve the global convergence of the algorithm. The encounter probability which adaptively changes with the number of iterations is also introduced in the CGO. The balance between exploration and exploitation of solution space of optimization problem is realized, and each step is described and modeled mathematically. The performance of the CGO was evaluated on a set of 41 test functions taken from CEC2017 and CEC2022. It was then compared with eight widely recognized meta-heuristic optimization algorithms. The simulation results demonstrate that the proposed algorithm successfully achieves a balanced trade-off between exploration and exploitation, showcasing remarkable advantages when compared to seven classical algorithms. In addition, in order to further verify the effectiveness of the CGO, the CGO is applied to 8 practical engineering design problems and UAV path planning, and the results show that the CGO has strong performance in dealing with these practical optimization problems, and has a good application prospect.