Bao-Lin Ye

Dr. Bao-Lin Ye

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
18 June 2024 in IEEE Intelligent Transportation Systems Magazine
Verified
Journal Article
Closed access
BYBao-Lin Ye
Bao-Lin Ye
MZMingjian Zhang
Mingjian Zhang
LLLingxi Li
Lingxi Li
CLChunyuan Liu
Chunyuan Liu
WWWeimin Wu
Weimin Wu
It is generally recognized that accurate and timely prediction of future traffic flow information is one of the important conditions for improving the utilization rate of road networks and relieving traffic congestion. Since long short-term memory (LSTM) networks have obvious advantages in dealing with time series data, LSTM-based prediction models, as well as the improved and hybrid models based on LSTM, have been widely used in the field of traffic flow prediction and have achieved a series of important results. However, although some existing reviews have provided a comprehensive summary of and prospects for traffic flow prediction methods, there is no recent review specifically summarizing the traffic flow prediction methods based on LSTM. Therefore, this article presents a comprehensive review of LSTM-based methods for traffic flow prediction. First, we briefly introduce the development history of traffic flow prediction, the advantages of using LSTM for traffic flow prediction, and the basic principles of LSTM. Then, the representative model structures, training methods, public datasets, attractive results, the advantages and disadvantages of different LSTM-based methods are presented and analyzed in detail. Furthermore, to illustrate the performance of various refinements and hybrid models based on LSTM for traffic flow prediction, we meticulously select several representative approaches to conduct comparative experiments and quantitative analysis. Finally, we discuss the current limitations and challenges of LSTM and traffic flow prediction and present potential areas of future research interest to the readers.

28 July 2023 in International Journal of Control, Automation, and Systems
Verified
Journal Article
Closed access
PDF file
BYBao-Lin Ye
Bao-Lin Ye
SNShaofeng Niu
Shaofeng Niu
LLLingxi Li
Lingxi Li
WWWeimin Wu
Weimin Wu

31 January 2020 in Polymers
Verified
Journal Article
Open access
PDF file
SXSheng Xie
Sheng Xie
GJGuojun Jiang
Guojun Jiang
BYBao-Lin Ye
Bao-Lin Ye
BSBaoqing Shentu
Baoqing Shentu
In order to explore the forming mechanism of the fiber whipping motion in slot-die melt blowing, the turbulent airflow in slot-die melt blowing was measured online with the approach of the Particle Image Velocimetry (PIV) technique. The PIV results visualized the structure of the turbulent airflow and provided the distributions of air velocity components (vx, vy, and vz). Moreover, the PIV results also demonstrated the evolutive process of turbulent airflow at successive time instants. By comparing the characteristics of the turbulent airflow with the fiber whipping path, the PIV results provide a preliminary explanation for the specific fiber whipping motion in slot-die melt blowing.

1 January 2024 in Electronic Research Archive
Verified
Journal Article
Open access
PDF file
BYBao-Lin Ye
Bao-Lin Ye
PWPeng Wu
Peng Wu
LLLingxi Li
Lingxi Li
WWWeimin Wu
Weimin Wu
Traffic signal control (TSC) plays a crucial role in enhancing traffic capacity. In recent years, researchers have demonstrated improved performance by utilizing deep reinforcement learning (DRL) for optimizing TSC. However, existing DRL frameworks predominantly rely on manually crafted states, actions, and reward designs, which limit direct information exchange between the DRL agent and the environment. To overcome this challenge, we propose a novel design method that maintains consistency among states, actions, and rewards, named uniformity state-action-reward (USAR) method for TSC. The USAR method relies on: 1) Updating the action selection for the next time step using a formula based on the state perceived by the agent at the current time step, thereby encouraging rapid convergence to the optimal strategy from state perception to action; and 2) integrating the state representation with the reward function design, allowing for precise assessment of the efficacy of past action strategies based on the received feedback rewards. The consistency-preserving design method jointly optimizes the TSC strategy through the updates and feedback among the Markov elements. Furthermore, the method proposed in this paper employs a residual block into the DRL model. It introduces an additional pathway between the input and output layers to transfer feature information, thus promoting the flow of information across different network layers. To assess the effectiveness of our approach, we conducted a series of simulation experiments using the simulation of urban mobility. The USAR method, incorporating a residual block, outperformed other methods and exhibited the best performance in several evaluation metrics.

30 October 2025 in IEEE Open Journal of Intelligent Transportation Systems
Verified
Journal Article
Open access
BYBao-Lin Ye
Bao-Lin Ye
PWPeng Wu
Peng Wu
LLLingxi Li
Lingxi Li
WWWeimin Wu
Weimin Wu
BSBo Song
Bo Song
XZXianchao Zhang
Xianchao Zhang
Graph neural network-based deep reinforcement learning (GNN-DRL) algorithms have been widely applied in traffic signal coordination control of urban road networks. However, current traffic signal control methods based on GNN-DRL focus on integrating historical and current spatiotemporal data to represent features of traffic networks, without utilizing predicted future information to enhance traffic efficiency. This work proposes a novel spatiotemporal information-based deep reinforcement learning method for traffic signal coordination control of urban road networks. It implements a heterogeneous subgraph representation method to model spatial structures among closely related intersections, strengthening subgraph feature representations while reducing computational complexity. Additionally, a multi-scale spatiotemporal heterogeneous graph feature aggregation technique is designed. The proposed method incorporates traffic signal timing scheme, vehicle states and road network topology as graph node features. By applying a graph neural network, it captures multistep spatiotemporal information from historical, current, and predicted data, thereby enhancing network feature representation and foresight. Furthermore, a novel reward function is designed to perceive the spatiotemporal information of a road network. The function uses the betweenness centrality to evaluate the spatial importance of intersections. It introduces total number of vehicles and predicted traffic flow to dynamically assess the current traffic state and future traffic demand in the lanes. It improves the agent’s ability to perceive and use spatiotemporal information to make decisions. We evaluated our proposed method through experiments under three different traffic scenarios: low, medium, and high flows. The results clearly demonstrate that the proposed method outperforms existing state-of-the-art methods, by reducing average queue length by 34.12%-59.45%, maximum queue length by 25.31%-47.83%, lane occupancy rates by 27.22%-51.56%, and vehicle count by 27.29%-51.92%. Meanwhile, experiments on computational overhead and real-road networks further confirm that SIDRL offers advantages in terms of low cost and high performance. This presents new technical insights for the real-time deployment and resource optimization of urban traffic signal control.

21 November 2024 in Biomimetics
Verified
Journal Article
Open access
PDF file
KZKaiyuan Zhang
Kaiyuan Zhang
BYBao-Lin Ye
Bao-Lin Ye
XXXiaoyun Xia
Xiaoyun Xia
ZWZijia Wang
Zijia Wang
XZXianchao Zhang
Xianchao Zhang
HJHai Jiang
Hai Jiang
With the increasing number of space debris, the demand for telescopes to observe space debris is also constantly increasing. The telescope observation scheduling problem requires algorithms to schedule telescopes to maximize observation value within the visible time constraints of space debris, especially when dealing with large-scale problems. This paper proposes a practical heuristic algorithm to solve the telescope observation of space debris scheduling problem. In order to accelerate the solving speed of algorithms on large-scale problems, this paper combines the characteristics of the problem and partitions the large-scale problem into multiple sub-problems according to the observation time. In each sub-problem, a coding method based on the priority of the target going into the queue is proposed in combination with the actual observation data, and a decoding method matching the coding method is designed. In the solution process for each sub-problem, an adaptive variable neighborhood search is used to solve the space debris observation plan. When solving all sub-problems is completed, the observation plans obtained on all sub-problems are combined to obtain the observation plan of the original problem.