Zhiyu Wang

Dr. Zhiyu Wang

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
30 September 2023 in IET Intelligent Transport Systems
Verified
Journal Article
Open access
ZWZhiyu Wang
Zhiyu Wang
LLLinheng Li
Linheng Li
XQXu Qu
Xu Qu
PMPeipei Mao
Peipei Mao
BRBin Ran
Bin Ran
Real‐time and accurate short‐term traffic flow prediction can provide a scientific basis for decision making by travellers and traffic management, and alleviate traffic congestion to a certain extent. The existing traffic flow prediction methods often encounter limitations in real‐time performance and accuracy due to the post‐processing required to rectify anomaly detection results during data pre‐processing. This paper presents a novel traffic flow prediction model, termed the With‐Anomaly Detection Probability (ADP) Attention‐Bidirectional Long‐Short Term Memory (BiLSTM) model. This model takes the probability of anomaly detection into consideration, integrating the anomaly detection outcomes as an inherent parameter into the traffic flow prediction framework. Additionally, the model incorporates an attention mechanism within the long‐short term memory network. Through a comprehensive simulation study utilizing actual measured traffic flow data from the Shanghai‐Chongqing Expressway, the effectiveness of the proposed model is rigorously evaluated. The prediction results show that the model proposed in this paper is a real‐time and accurate short‐time traffic flow prediction model compared with the basic models.

1 July 2026 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ZWZhiyu Wang
Zhiyu Wang
Linheng LiLinheng Li
Linheng Li
XQXu Qu
Xu Qu
BRBin Ran
Bin Ran

6 August 2026 in Sensors
Verified
Journal Article
Open access
PDF file
CWCan Wang
Can Wang
ZWZhiyu Wang
Zhiyu Wang
WWWeijie Wang
Weijie Wang
JGJing Gan
Jing Gan
YJYanni Ju
Yanni Ju
Traffic sensors provide real-time measurements of current traffic conditions, whereas traffic management applications require forecasts of future traffic speed or flow. This study considers the incremental expansion of an operating sensor network, in which a pre-trained network-level forecasting model must predict traffic states at sensor locations that were absent during training. Many spatio-temporal graph neural networks rely on sensor-specific embeddings and graph connections learned from data-rich training networks. These representations are undefined for previously unseen locations, limiting the direct application of pre-trained adaptive-graph forecasters during sensor-network expansion. To address this cold-start problem, we propose support-conditioned sensor-adaptive meta-graph learning (SC-SAMG), which derives target-node representations and spatial dependencies from a short support period. The framework combines a support-set encoder, a task-specific graph learner, and first-order meta-learning to adapt the network-level forecaster using one to seven days of target observations. Experiments on four traffic benchmarks evaluate forecasts of speed or flow over the next 15–60 min under a leakage-controlled held-out-node protocol. SC-SAMG consistently outperforms fine-tuned gated recurrent unit (GRU), adaptive graph convolutional recurrent network (AGCRN), and diffusion convolutional recurrent neural network (DCRNN) baselines. It reduces mean absolute error (MAE) by up to 11% relative to the adaptive-graph baseline and by up to 7% relative to the diffusion convolutional baseline. These results demonstrate the potential of support-conditioned graph adaptation for incorporating previously unseen sensor locations into existing network-level traffic forecasting systems.

14 August 2026 in Accident Analysis & Prevention
Verified
Journal Article
Closed access
ZWZhiyu Wang
Zhiyu Wang
CWCan Wang
Can Wang
LLLinheng Li
Linheng Li
XQXu Qu
Xu Qu
JGJing Gan
Jing Gan
BRBin Ran
Bin Ran

2 October 2026 in Systems
Verified
Journal Article
Open access
PDF file
CWCan Wang
Can Wang
ZWZhiyu Wang
Zhiyu Wang
WWWeijie Wang
Weijie Wang
JGJing Gan
Jing Gan
YJYanni Ju
Yanni Ju
This paper proposes event-triggered pinning graph reinforcement learning (EPGRL) for cooperative ramp merging in mixed traffic with connected and automated vehicles (CAVs) and human-driven vehicles. EPGRL represents vehicle interactions as a time-varying directed graph and uses a dual-stream graph encoder with temporal updating to capture evolving traffic couplings. A Lyapunov-based trigger activates cooperation when a stability-oriented surrogate index indicates loss of contractivity, while topology-aware pinning allocates control to influential CAVs. A PPO policy generates longitudinal and lateral actions, which are filtered by a safety shield. SUMO experiments across traffic demands and CAV penetration rates show that EPGRL improves travel time, fuel use, CO2 emissions, and system-level time-to-collision relative to uncontrolled, infrastructure-based, and learning-based baselines. Event-timing and spatial analyses characterize the distribution of cooperative updates, while the control-update reduction rate ranges from 73.1% to 79.8% across representative settings. Ablation experiments further show that graph modeling, instability-aware triggering, and pinning selection make complementary contributions. These results indicate that selective, state-dependent cooperation can balance mobility, safety, energy use, and communication cost in simulated mixed-traffic merging.