Bin Wei Liang

Mr. Bin Wei Liang

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
24 June 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
ZLZian Lin
Zian Lin
Yuanfa JiYuanfa Ji
Yuanfa Ji
BLBin Wei Liang
Bin Wei Liang
XSXiyan Sun
Xiyan Sun
In landslide displacement prediction, random factors that would affect the performance of prediction are usually ignored by using a time series analysis method. In order to solve this problem, in this paper, a landslide displacement prediction model, the local mean decomposition-bidirectional long short-term memory (LMD-BiLSTM), is proposed based on the time-frequency analysis method. The model uses the local mean decomposition (LMD) algorithm to decompose landslide displacement and obtains several subsequences of landslide displacement with different frequencies. This paper analyzes the internal relationship between the landslide displacement and rainfall, reservoir water level, and landslide state. The maximum information coefficient (MIC) algorithm is used to calculate the intrinsic correlation between each subsequence of landslide displacement and rainfall, reservoir water level, and landslide state. Subsequences of influential factors with high correlation are selected as input variables of the bidirectional long short-term memory (BiLSTM) model to predict each subsequence. Finally, the predicted results of each of the subsequences are added to obtain the final predicted displacement. The proposed LMD-BiLSTM model effectiveness is verified based on the Baishuihe landslide. The prediction results and evaluation indexes show that the model can accurately predict landslide displacement.

2 March 2023 in Forests
Verified
Journal Article
Open access
PDF file
ZLZian Lin
Zian Lin
QCQiuguang Chen
Qiuguang Chen
WLWeiping Lu
Weiping Lu
Yuanfa JiYuanfa Ji
Yuanfa Ji
BLBin Wei Liang
Bin Wei Liang
XSXiyan Sun
Xiyan Sun
Landslide susceptibility mapping is the basis of regional landslide risk assessment and prevention. In recent years, deep learning models have been applied in landslide susceptibility mapping, but some problems remain, such as gradient disappearance, explosion, and degradation. Additionally, the potential nonlinear temporal and spatial characteristics between landslides and environmental factors may not be captured, and nonlandslide points may be randomly selected in the susceptibility mapping process. To overcome these shortcomings, in this paper, an information-gate recurrent unit residual network (Information-GRUResNet) model is proposed to produce a landslide susceptibility map by combining existing landslide records and environmental factor data. The model uses the information theory method to produce the initial landslide susceptibility map. Then, representative grid units and landslide points are selected as input variables of the GRUResNet model, from which nonlinear temporal and spatial characteristics are extracted to produce a landslide susceptibility map. Changzhou town in Wuzhou, China, is selected as a case study, and it is verified that the Information-GRUResNet model can accurately produce a landslide susceptibility map for the selected area. Finally, the Information-GRUResNet model is compared with GRU, RF, and LR models. The experimental results show that the Information-GRUResNet model is more accurate than the other three models.

10 October 2025 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
BLBin Wei Liang
Bin Wei Liang
Yuanfa JiYuanfa Ji
Yuanfa Ji
XSXiyan Sun
Xiyan Sun
XLXinyi Liu
Xinyi Liu
JWJianhui Wu
Jianhui Wu
Flocking control is essential for studying the collective behavior of agents in multi-agent systems (MASs). Most existing flocking control algorithms assumed that the motion of the agent was influenced by consensus, gradient-based, and navigation feedback terms. However, the interaction of these terms might trap the agent in dynamic equilibrium state with near-zero acceleration and velocity under complex obstacles. This prevented the agent from bypassing the obstacles and tracking the group target. In this paper, we propose a vector field histogram plus (VFH+) flocking control algorithm. The algorithm maps the obstacle information into a simple binary polar histogram. Using this histogram, the expected velocity is calculated to construct the consensus term, which can guide the agent in escaping from the dynamic equilibrium state and bypassing obstacles. Then, a non-increasing piecewise function is formulated to dynamically alter the magnitude of the gradient-based term, thereby reducing the possibility of collisions. Additionally, the navigation feedback term is developed to track the group target. Stability analysis provides sufficient conditions that there are no collisions between agents or with obstacles. Subsequently, simulations conducted on combination, U-shaped and multiple obstacles demonstrate the effectiveness and environmental adaptability of the VFH+ flocking control algorithm.

8 April 2024 in International Journal of Control, Automation, and Systems
Verified
Journal Article
Closed access
PDF file
JWJianhui Wu
Jianhui Wu
Yuanfa JiYuanfa Ji
Yuanfa Ji
XSXiyan Sun
Xiyan Sun
BLBin Wei Liang
Bin Wei Liang

4 February 2025 in Machines
Verified
Journal Article
Open access
PDF file
BLBin Wei Liang
Bin Wei Liang
XSXiyan Sun
Xiyan Sun
Yuanfa JiYuanfa Ji
Yuanfa Ji
XLXinyi Liu
Xinyi Liu
JWJianhui Wu
Jianhui Wu
ZHZhongxi He
Zhongxi He
The Olfati-Saber flocking (OSF) algorithm is widely used in multi-agent flocking control due to its simplicity and effectiveness. However, this algorithm is prone to trapping multi-agents in dynamic equilibrium under multiple obstacles, and dynamic equilibrium is a key technical issue that needs to be addressed in multi-agent flocking control. To overcome this problem, we propose a dynamic equilibrium judgment rule and design a fuzzy flocking control (FFC) algorithm. In this algorithm, the expected velocity is divided into fuzzy expected velocity and projected expected velocity. The fuzzy expected velocity is designed to make the agent escape from the dynamic equilibrium, and the projected expected velocity is designed to tow the agent, bypassing the obstacles. Meanwhile, the sensing radius of the agent is divided into four subregions, and a nonnegative subsection function is designed to adjust the attractive/repulsive potentials in these subregions. In addition, the virtual leader is designed to guide the agent in achieving group goal following. Finally, the experimental results show that multi-agents can escape from dynamic equilibrium and bypass obstacles at a faster velocity, and the minimum distance between them is consistently greater than the minimum safe distance under complex environments in the proposed algorithm.