Liang Zhao

Dr. Liang Zhao


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
22 July 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
JWJingwen Wu
Jingwen Wu
LZLiang Zhao
Liang Zhao
RLRuixue Liu
Ruixue Liu
To ensure the safe production of mines, the intelligent trend of underground mining operations is gradually advancing. However, the operational environment of subterranean mining is intricate, making the conventional path-planning algorithm used by mining inspection robots frequently inadequate for real requirements. To safeguard the mining inspection robot, targeting the problem of low search efficiency and path redundancy in the path planning of the existing rapidly exploring random tree (RRT) algorithm in the narrow and complex unstructured environment, a path-planning algorithm combining improved RRT and a probabilistic road map (PRM) is proposed. Initially, the target area is efficiently searched according to the fan-shaped goal orientation strategy and the adaptive step size expansion strategy. Subsequently, the PRM algorithm and the improved RRT algorithm are combined to reduce the redundant points of the planning path. Ultimately, considering the kinematics of the vehicle, the path is optimized by the third-order Bessel curve. The experimental simulation results show that the proposed path-planning algorithm has a higher success rate, smoother path, and shorter path length than other algorithms in complex underground mining environments, which proves the effectiveness of the proposed algorithm.

4 March 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
TZTian Zeqin
Tian Zeqin
DCDengfeng Chen
Dengfeng Chen
LZLiang Zhao
Liang Zhao
Accurate building energy consumption prediction is a crucial condition for the sustainable development of building energy management systems. However, the highly nonlinear nature of data and complex influencing factors in the energy consumption of large public buildings often pose challenges in improving prediction accuracy. In this study, we propose a combined prediction model that combines signal decomposition, feature screening, and deep learning. First, we employ the Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (CEEMDAN) to decompose energy consumption data. Next, we propose the Maximum Mutual Information Coefficient (MIC)-Fast Correlation Based Filter (FCBF) combined feature screening method for feature selection on the decomposed components. Finally, the selected input features and corresponding components are fed into the Bi-directional Long Short-Term Memory Attention Mechanism (BiLSTMAM) model for prediction, and the aggregated results yield the energy consumption forecast. The proposed approach is validated using energy consumption data from a large public building in Shaanxi Province, China. Compared with the other five comparison methods, the RMSE reduction of the CEEMDAN-MIC-FCBF-BiLSTMAM model proposed in this study ranged from 57.23% to 82.49%. Experimental results demonstrate that the combination of CEEMDAN, MIC-FCBF, and BiLSTMAM modeling markedly improves the accuracy of energy consumption predictions in buildings, offering a potent method for optimizing energy management and promoting sustainability in large-scale facilities.

15 May 2023 in Sensors
Verified
Journal Article
Open access
PDF file
NWNingke Wei
Ningke Wei
LZLiang Zhao
Liang Zhao
DCDengfeng Chen
Dengfeng Chen
An enhanced self-assembling network routing algorithm is proposed for the problem of weak connectivity of communication networks caused by factors such as movement or environmental interference in the construction and operation, and the maintenance of construction robot clusters. Firstly, the dynamic forwarding probability is calculated based on the contribution of nodes joining routing paths to network connectivity, and the robust connectivity of the network is achieved by introducing the connectivity feedback mechanism; secondly, the influence of link quality evaluation index Q balanced hop count, residual energy, and load on link stability is used to select appropriate neighbors for nodes as the subsequent hop nodes; finally, the dynamic characteristics of nodes are combined with the topology control technology to eliminate low-quality links and optimize the topology by link maintenance time prediction and to set robot node priority. The simulation results show that the proposed algorithm can guarantee a network connectivity rate above 97% under heavy load, reduce the end-to-end delay, and improve the network survival time, providing a theoretical basis for achieving stable and reliable interconnection between building robot nodes.

6 August 2024 in arXiv
Verified
Preprint
Open access
PDF file
SLShipeng Liu
Shipeng Liu
LZLiang Zhao
Liang Zhao
DCDengfeng Chen
Dengfeng Chen
SZSong Zhanping
Song Zhanping
Quantifying and evaluating image complexity can be instrumental in enhancing the performance of various computer vision tasks. Supervised learning can effectively learn image complexity features from well-annotated datasets. However, creating such datasets requires expensive manual annotation costs. The models may learn human subjective biases from it. In this work, we introduce the MoCo v2 framework. We utilize contrastive learning to represent image complexity, named CLIC (Contrastive Learning for Image Complexity). We find that there are complexity differences between different local regions of an image, and propose Random Crop and Mix (RCM), which can produce positive samples consisting of multi-scale local crops. RCM can also expand the train set and increase data diversity without introducing additional data. We conduct extensive experiments with CLIC, comparing it with both unsupervised and supervised methods. The results demonstrate that the performance of CLIC is comparable to that of state-of-the-art supervised methods. In addition, we establish the pipelines that can apply CLIC to computer vision tasks to effectively improve their performance.

29 March 2024 in Sensors
Verified
Journal Article
Open access
PDF file
FLFeng Dong Lei
Feng Dong Lei
LZLiang Zhao
Liang Zhao
DCDengfeng Chen
Dengfeng Chen
Classifying the flow subsequences of sensor networks is an effective way for fault detection in the Industrial Internet of Things (IIoT). Traditional fault detection algorithms identify exceptions by a single abnormal dataset and do not pay attention to the factors such as electromagnetic interference, network delay, sensor sample delay, and so on. This paper focuses on fault detection by continuous abnormal points. We proposed a fault detection algorithm within the module of sequence state generated by unsupervised learning (SSGBUL) and the module of integrated encoding sequence classification (IESC). Firstly, we built a network module based on unsupervised learning to encode the flow sequence of the different network cards in the IIoT gateway, and then combined the multiple code sequences into one integrated sequence. Next, we classified the integrated sequence by comparing the integrated sequence with the encoding fault type. The results obtained from the three IIoT datasets of a sewage treatment plant show that the accuracy of the SSGBUL–IESC algorithm exceeds 90% with subsequence length 10, which is significantly higher than the accuracies of the dynamic time warping (DTW) algorithm and the time series forest (TSF) algorithm. The proposed algorithm reaches the classification requirements for fault detection for the IIoT.

12 May 2026 in Engineering Research Express
Verified
Journal Article
Closed access
LZLiang Zhao
Liang Zhao
HLHui Jing Li
Hui Jing Li
ZSZhan Ping Song
Zhan Ping Song
KUKhasan Umarov
Khasan Umarov
Accurate segmentation and quantitative analysis of tunnel face joints are crucial for optimizing blasting parameters and ensuring construction safety. However, in complex tunnel environments, existing segmentation algorithms suffer from insufficient accuracy in segmenting small, elongated joint targets, leading to significant errors in subsequent length quantification. To address this issue, this paper proposes a segmentation algorithm U2Y11FL for the joint target of the tunnel face. The U2Y11FL algorithm utilizes UNetV2's encoder to extract basic features of the fractures, subsequently introduces the FDPN module to integrate feature information from different levels, and finally employs the LAWDS module for down-sampling. On a self-constructed joint dataset, the mask segmentation accuracy rate and Dice coefficient of U2Y11FL reach 85.4% and 72.9% respectively. On three open-source crack datasets, it demonstrated strong generalization capabilities with Dice coefficients as high as 85.6%, 79.4% and 76.5%. Based on this, a fractal approximation algorithm using chain codes was adopted to quantify the length characteristics of joints. By compensating for joint fractures occurring during the skeleton extraction stage in the original algorithm, the relative error between the quantified results and measured values was reduced to 2.2%~9.7%, providing an effective method for quantitative analysis of tunnel face joints.