Yangjun Du

Yangjun Du

Auto-generated profile, based on publicly available information

Yangjun Du

Xinjiang University

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
14 October 2025 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
WYWenlong Yan
Wenlong Yan
LHLi He
Li He
HWHongwei Wang
Hongwei Wang
ZLZhening Liu
Zhening Liu
ZLZhiyuan Li
Zhiyuan Li
YDYangjun Du
Yangjun Du
To enhance the social navigation performance of mobile robots in crowded environments, we propose a novel framework—Prediction and Fuzzy Timed Elastic Band (PF-TEB) for robot social navigation. Our framework incorporates predicted pedestrian trajectories into pedestrian proxemics modeling as a social layer cost map, allowing the robot to better interpret pedestrian movement intentions and proactively avoid potential conflicts. Additionally, social constraints are integrated into TEB to ensure that both pedestrian comfort and safety are prioritized during trajectory planning. To address the adaptability limitations of conventional methods in highly dynamic, crowded environments, we introduce three type-2 fuzzy logic controllers. These controllers dynamically adjust the optimization weights of the corresponding constraints in the objective function based on real time environmental data, enabling timely modifications to the planned trajectory and significantly enhancing the flexibility and adaptability of the navigation system. The simulation experiments demonstrate that our method performs well in social metrics by respecting pedestrian comfort and its effectiveness has been validated on the Tracer robot in real-world environments.

21 October 2025 in Measurement Science and Technology
Verified
Journal Article
Closed access
JYJiacheng Yao
Jiacheng Yao
LHLi He
Li He
HWHongwei Wang
Hongwei Wang
ZLZhiyuan Li
Zhiyuan Li
YDYangjun Du
Yangjun Du
YLYuxin Liao
Yuxin Liao
With the widespread deployment of mobile robots in complex task scenarios, enhancing their ability to achieve efficient autonomous navigation in unknown environments has become a major challenge in the field of intelligent robotics. Traditional deep reinforcement learning methods often struggle to capture and model long-term spatio-temporal dependencies, resulting in unstable navigation policies and poor generalization in unseen environments. To address these issues, this paper proposes a vision-based navigation framework that integrates a spatio-temporal adaptive convolutional attention model (SACAM) and an asynchronous meta-variational policy algorithm (AMPA). SACAM enhances the agent’s ability to capture long-term dependencies through self-supervised learning, improving adaptability in complex settings. Meanwhile, AMPA employs an asynchronous update mechanism and a meta-variational approach to handle policy uncertainty, enabling robust decision-making and rapid adaptation. Experimental results in the AI2-THOR simulation environment demonstrate that the proposed method outperforms several advanced baselines in terms of success rate, path efficiency, and generalization capability, showcasing its robust performance and adaptability in challenging navigation tasks.

23 July 2026 in Measurement Science and Technology
Verified
Journal Article
Closed access
PDF file
GSGuihai Shen
Guihai Shen
LHLi He
Li He
HWHongwei Wang
Hongwei Wang
JYJiacheng Yao
Jiacheng Yao
YDYangjun Du
Yangjun Du
ZLZhiyuan Li
Zhiyuan Li
Decentralised multi-agent path finding in congested and obstacle-rich environments remains difficult because agents must coordinate under partial observation, limited bandwidth, and bounded per-step computation. Existing decentralised solvers often address communication efficiency, congestion handling, and execution safety separately, which can reduce their reliability when dense local interactions amplify non-stationarity and make distance-based neighbourhoods poorly aligned with coordination relevance. This paper proposes hierarchical risk shaped structured communication (HiRiSC), a bandwidth-aware decentralised framework that couples hypergraph-sparse communication with CFL-clamped congestion risk shaping. STAGE-Comm constructs feature-space coalitions, converts them into second-order hypergraph priors, and learns a discrete sparse adjacency through straight-through Gumbel–Softmax. Direction-sensitive gating further modulates asymmetric information flow according to relative spatial relations, reducing redundant message updates while preserving task-relevant interactions within the feasible visibility mask. VPG-HCHD builds a congestion look-ahead signal from density, flow coherence, and goal-directed progress. A CFL-clamped finite-volume diagnostic limits non-physical density transport in the predicted density field and provides an interpretable reliability indicator for risk-aware value shaping. Residual conflicts are handled by a bounded execution cascade that combines a constant-time shield, priority inheritance with backtracking-based local arbitration, and short-horizon TE-A* repair under reservation constraints. Experiments on random maps and structured den312d and warehouse benchmarks show that HiRiSC achieves 95%–100% success in the tested dense settings, reduces communication overhead and runtime relative to the corresponding baselines, and maintains stable performance under bandwidth limits, packet loss up to 20%, and effective-speed and sensing heterogeneity. Ablation results further indicate that structured sparse communication, congestion-aware risk shaping, and execution-time arbitration provide complementary contributions.

8 September 2026 in Measurement Science and Technology
Verified
Journal Article
Closed access
PDF file
CLChuang Li
Chuang Li
RTRan Teng
Ran Teng
JWJingchuan Wang
Jingchuan Wang
LHLi He
Li He
YDYangjun Du
Yangjun Du
LYLiang Yuan
Liang Yuan
Early fault prediction in chemical processes remains challenging because incipient signatures are weak, evolve gradually, and are often obscured by dominant process dynamics and measurement noise. This paper proposes a temporal–spectral early-warning network (TS-EWNet), which directly maps historical multivariate measurements to fault-related probabilities without intermediate signal forecasting. A coarse-to-fine architecture first captures the global process context and then enhances weak fault-related variations by integrating temporal responses with low-frequency spectral evidence. TS-EWNet is evaluated on the Tennessee Eastman Process (TEP) benchmark, a first-principles continuous stirred-tank reactor (CSTR) simulation, and a laboratory-scale thermo-hydraulic platform. On the TEP dataset, TS-EWNet achieves an accuracy of 93.67 ± 0.15 % and a Macro-F1 of 93.73 ± 0.19 % at H = 10 , while retaining an accuracy of 89.93 ± 0.22 % at H = 20 . At H = 10 , its Early-F1, stable correct warning rate, and penalized normalized stable detection delay are 68.77%, 69.62%, and 0.3286, respectively. After Holm correction applied separately to each metric, 13 of 14 Macro-F1 comparisons and all 14 Early-F1 comparisons remain statistically significant. On the CSTR dataset, the model achieves 96.62% accuracy and 97.89% Macro-F1 at H = 10 . Under continuous streaming operation on the laboratory platform, it obtains a macro-average accuracy of 77.71% and a Macro-F1 of 70.21%. For a representative F5 trajectory, a stable warning is confirmed 45 s before the reference fault manifestation, while the inference time remains below the 1 s sampling interval. These results demonstrate the effectiveness of TS-EWNet for multi-horizon fault prediction, initial-stage warning, and real-time process monitoring.