Linqing He

Mr. Linqing He

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
23 August 2025 in Sensors
Verified
Journal Article
Open access
PDF file
MZMengfan Zhang
Mengfan Zhang
WLWeifeng Liu
Weifeng Liu
LHLinqing He
Linqing He
DWDi Wang
Di Wang
Reconstruction-based unsupervised detection methods have demonstrated strong generalization capabilities in the field of tablet anomaly detection, but there are still problems such as poor reconstruction effect and inaccurate positioning of abnormal areas. To address these problems, this paper proposes an unsupervised Diffusion-based Tablet Defect Detection (DTDD) method. This method uses an Assisted Reconstruction (AR) network to introduce original image information to assist in the reconstruction of abnormal areas, thereby improving the reconstruction effect of the diffusion model. It also uses a Scale Fusion (SF) network and an improved anomaly measurement method to improve the accuracy of abnormal area positioning. Finally, the effectiveness of the algorithm is verified on the tablet dataset. The experimental results show that the algorithm in this paper is superior to the algorithms in the same field, effectively improving the detection accuracy and abnormal positioning accuracy, and performing well in the tablet defect detection task.

1 January 2026 in IET Cyber-Systems and Robotics
Verified
Journal Article
Open access
LHLinqing He
Linqing He
WLWeifeng Liu
Weifeng Liu
Unmanned aerial vehicle (UAV) swarms hold significant promise for scalable environment exploration, cooperative transportation and urban air mobility. Nevertheless, trajectory planning for swarms remains challenging due to high computational complexity, stringent spatiotemporal constraints and limited attention to energy efficiency. In this work, we present a unified trajectory planning framework that simultaneously promotes energy efficiency and ensures spatiotemporal consistency. Building upon the minimum control (MINCO) trajectory representation, we extend the differentially flat parameterisation from single‐UAV settings to multiagent systems, enabling efficient representation of swarm trajectories through sparse spatiotemporal parameters. Differentiable cost functions are designed to explicitly capture synchronised arrivals, temporal logic of tasks and collision‐avoidance constraints, whereas analytical gradients are derived to facilitate scalable optimisation. Extensive simulations with swarms of up to 15 UAVs demonstrate the scalability of our method in generating smooth and dynamically feasible trajectories. Compared to state‐of‐the‐art baselines, the proposed framework significantly improves the interagent safety margin (by 35%) and achieves substantial energy efficiency, reducing physical energy consumption by over 10% and control effort by up to 22%.

22 May 2026 in Sensors
Verified
Journal Article
Open access
PDF file
LHLinqing He
Linqing He
WLWeifeng Liu
Weifeng Liu
WLWanyu Li
Wanyu Li
With recent advances in deep reinforcement learning (DRL) and graph neural networks (GNNs), graph-based autonomous exploration methods have significantly improved decision-making performance in complex environments. However, under partial observability and sparse-reward conditions, existing methods still struggle with long-horizon decision-making and sustained exploration. To address these challenges, we propose a spatiotemporal graph learning framework, termed ST-GICM, that improves the robustness and efficiency of autonomous exploration by integrating graph-structured encoding, temporal memory, and an intrinsic curiosity mechanism. Specifically, a Graph Attention Network (GAT) and a Spatiotemporal Reasoning Core (STRC) are employed to dynamically encode the viewpoint graph and fuse temporal memory, thereby alleviating perceptual aliasing in graph-based exploration. In addition, an Intrinsic Prediction Module (IPM) is designed to generate intrinsic rewards based on the prediction error of graph-level latent representations, thereby encouraging sustained exploration. Experiments conducted in procedurally generated complex topological environments show that the proposed method outperforms existing baselines in terms of coverage rate, success rate, repeated revisit rate, and oscillation count, while maintaining trajectory costs comparable to those of the baselines. These results demonstrate the effectiveness and superiority of ST-GICM in partially observable environments under sparse-reward conditions.