JiChao Wang

Dr. JiChao Wang

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
21 February 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
JWJiChao Wang
JiChao Wang
WZWenxiang Zuo
Wenxiang Zuo
The RIME (Rime-ice) optimization algorithm is a physics-based metaheuristic inspired by the crystallization dynamics of rime ice. Since its introduction in 2023, nearly 170 variants and applications have appeared across more than 40 journals, yet no dedicated survey exists to organize this rapidly expanding literature. This paper fills that gap by presenting the first comprehensive survey of the RIME algorithm family, covering 169 studies published between January 2023 and December 2025. We (1) formalize the theoretical foundations of RIME, establishing a clear mapping from soft-rime branching to global exploration and from hard-rime densification to local exploitation; (2) construct a six-dimensional taxonomy of enhancement strategies encompassing population initialization, exploration enhancement, exploitation refinement, exploration–exploitation balancing, constraint handling, and multi-objective/distributed extensions; (3) systematically review engineering applications across seven domains including robot path planning, unmanned systems, engineering optimization, feature selection, image processing, wireless networks, and emerging applications; (4) synthesize benchmark results on CEC test suites through cross-study performance aggregation with statistical significance analysis; (5) position RIME within the broader metaheuristic landscape through comparative analysis with 19 peer algorithms; and (6) identify open challenges and future research directions spanning convergence theory, high-dimensional scaling, distributed optimization, and integration with deep reinforcement learning and large language models. A structured research roadmap is provided to guide both algorithm designers and practitioners. No prior dedicated survey of the RIME algorithm family exists in the literature; we hope this work serves as a useful reference for researchers and engineers entering this rapidly evolving field.

1 January 2026 in IEEE Access
Verified
Journal Article
Open access
CLChangjiao Li
Changjiao Li
HZHanyu Zhang
Hanyu Zhang
BGBiao Guo
Biao Guo
DSDonglai Sun
Donglai Sun
JWJiChao Wang
JiChao Wang

11 November 2025 in Research Square
Verified
Preprint
Open access
PDF file
JWJiChao Wang
JiChao Wang
ZHZhenqiao Hui
Zhenqiao Hui
MLMengyuan Li
Mengyuan Li
DSDonglai Sun
Donglai Sun
SPSicong Pang
Sicong Pang
To address the challenges of detecting winter jujubes in orchard environments—including dense small targets, variable illumination, complex backgrounds, and limited edge deployment capabilities—this paper proposes SF-YOLO11, a lightweight real-time detection model. First, a ternary channel importance metric is proposed that integrates gradient, variance, and task relevance to construct an adaptive pruning strategy. This strategy optimizes C3K2 into PrunedC3K2, achieving 31% model compression. Second, the LightSPPF module is designed through computational graph reconstruction. This module employs a three-stage architecture comprising depthwise separable convolution, adaptive pooling, and dynamic fusion, reducing computational cost by 40%. Finally, we transform multi-scale feature processing into sequence modeling and design the ISSFF module to capture scale dependencies through bidirectional LSTM and multi-head attention mechanisms, thereby improving small target detection accuracy. Experimental results demonstrate that SF-YOLO11 achieves an mAP@0.5 of 92.89%, representing a 3.68% improvement over the baseline. The model contains 1.6M parameters, requires 4.3 GFLOPs of computation, and operates at 128 FPS, achieving optimizations of 38.5%, 33.8%, and 14%, respectively. After INT8 quantization, the model size is reduced to only 1.7 MB, and the FPS increases to 215. In cross-fruit transfer experiments, the model achieves zero-shot mAP@0.5 values of 68.34% and 71.52% on grape and cherry tomato datasets, respectively. After fine-tuning, these values improve to 85.23% and 87.12%, respectively. Robustness tests validate the model's performance under extreme conditions, including strong illumination, low illumination, and occlusion.

8 December 2025 in Preprints.org
Verified
Preprint
Open access
PDF file
JWJiChao Wang
JiChao Wang
SPSicong Pang
Sicong Pang
ZHZhenqiao Hui
Zhenqiao Hui
SZShuai Zhang
Shuai Zhang
HZHanyu Zhang
Hanyu Zhang
Post-disaster rescue operations require rapid and efficient coordination of heterogeneous 2 unmanned systems to locate survivors and deliver supplies in dynamic, uncertain environ- 3 ments. Existing approaches predominantly adopt a static task allocation paradigm, which 4 fails to adapt to scenarios where new survivors are continually discovered and obstacles 5 appear unexpectedly. This paper proposes ED-MOEA (Event-Driven Multi-Objective Evolu- 6 tionary Algorithm), establishing a closed-loop cooperative sensing-planning mechanism for 7 heterogeneous UAV-UGV systems. The core innovation lies in an event-triggered dynamic 8 replanning strategy: when UAVs detect new task points or obstacles during flight, the 9 system immediately broadcasts information to UGVs and triggers a warm-start replanning 10 process. The problem is formulated as a three-objective optimization considering makespan 11 minimization, energy consumption minimization, and task coverage maximization, while 12 accounting for heterogeneous mobility constraints—UAVs can fly directly over obstacles 13 while UGVs must navigate around them. Experiments on five benchmark scenarios and 14 a real case based on the 2024 Hualien earthquake demonstrate that ED-MOEA achieves 15 the highest hypervolume (HV) across all scenarios, outperforming existing multi-objective 16 algorithms including NSGA-III, MOEA/D-DE, RVEA, and LMEA. The heterogeneous 17 coordination achieves 16.7% higher task coverage compared to UAV-only systems (0.910 18 vs. 0.780), while the warm-start strategy significantly accelerates replanning convergence 19 (over 35% reduction in generations required), ensuring real-time response capability under 20 6 seconds for scenarios with up to 70 tasks.

6 July 2026 in Measurement and Control
Verified
Journal Article
Open access
JWJiChao Wang
JiChao Wang
HZHanyu Zhang
Hanyu Zhang
ZHZhenqiao Hui
Zhenqiao Hui
SZShuai Zhang
Shuai Zhang
SPSicong Pang
Sicong Pang
Cooperative mission planning for heterogeneous unmanned aerial vehicle (UAV) fleets operating in contested or post-disaster environments remains a significant challenge due to the diversity of UAV capabilities and the unpredictability of operational conditions. This paper proposes HeteroDRIME-Lite, a dynamic cooperative planning framework for heterogeneous multi-UAV systems comprising three specialized types: Scout (reconnaissance), Relay (communication), and Carrier (delivery). The framework couples strict type–task matching, an event-triggered replanning mechanism, and a warm-start population initialization for the RIME optimizer. We evaluate the framework over five benchmark scenarios with 30 independent runs each and compare it against eleven baselines, including the published methods NSGA-II, MOEA/D, PSO, GA, DE, ACO, and consensus-based bundle auction (CBBA). Event-triggered replanning sustains 100% task coverage in every scenario, whereas a single-allocation static variant covers only 64–71%. HeteroDRIME-Lite attains significantly lower makespan and energy than all population-based metaheuristics (Wilcoxon signed-rank test, p < 0.001 , with large Cohen's d effect sizes), while keeping the average per-event replanning time near 40 ms, one to two orders of magnitude faster than those baselines. Warm-start initialization reduces the number of convergence iterations by about 40% (median 2.7 × speedup) and lowers replanning energy by up to 60% relative to cold start; a sensitivity sweep confirms that the 30/30/40 inheritance–mutation–random ratio is near-optimal. We further clarify, through ablation, that heterogeneity in this framework is a mission-feasibility requirement rather than an efficiency gain, and we analyze the resulting makespan trade-off.