Liangkun Xu

Dr. Liangkun Xu

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
Verified
Journal Article
Open access
PDF file
RZRong Zhen
Rong Zhen
YYYingdong Ye
Yingdong Ye
Xinqiang ChenXinqiang Chen
Xinqiang Chen
LXLiangkun Xu
Liangkun Xu
Aiming at the problem of high-precision detection of AtoN (Aids to Navigation, AtoN) in the complex inland river environment, in the absence of sufficient AtoN image types to train classifiers, this paper proposes an automatic AtoN detection algorithm Aids-to-Navigation-YOLOv4 (AN-YOLOv4) based on improved YOLOv4 (You Only Look Once, Yolo). Firstly, aiming at the problem of an insufficient number of existing AtoN datasets, the Deep Convolutional Generative Adversarial Networks (DCGAN) is used to expand and enhance the AtoN image dataset. Then, aiming at the problem of small target recognition accuracy, the image pyramid is used to multi-scale zoom the dataset. Finally, the K-means clustering algorithm is used to correct the candidate box of AN-YOLOv4. The test on the test dataset shows that the improvement effect of AN-YOLOv4 is obvious. The accuracy rate of small targets is 92%, and the average accuracy (mAP) of eight different types of AtoN is 92%, which is 14% and 13% higher than the original YOLOv4, respectively. This research has important theoretical significance and reference value for the intelligent perception of the navigation environment under the intelligent shipping system.

8 December 2022 in Journal of Marine Science and Technology
Verified
Journal Article
Open access
PDF file
LXLiangkun Xu
Liangkun Xu
QYQing Yu
Qing Yu
The grounding accident of M/V EVER GIVEN in the Suez Canal causes a catastrophic loss on shipping companies. Alternatively, previous studies have presented encouraging findings of the remarkable benefits of time and cost saving in the Northern sea route (NSR) due to extend the ice-free time and shorten the distance. Ships using the NSR could shorten as much as 40% of the sailing distance from China (Shanghai) to Europe (Rotterdam) compared with the traditional route via the Suez Canal. This paper investigates the economic potential of using the NSR as a cost-effective route in comparison with Suez Canal Route (SCR) between China and Europe. To achieve this target, the study evaluates the net profit for the SCR fleet and NSR fleet by involving the factors, e.g., bunker price, ice condition and ship loading rate, etc. The case-study results show that the NSR fleet is not profitable compared to the SCR, due to the limited cargo transport capability and ice restriction. Only if the loading rate for SCR fleet is lower than some threshold value or the bunker price is high enough, the NSR turns to be profitable.

Verified
Journal Article
Open access
PDF file
LXLiangkun Xu
Liangkun Xu
在朱在伟 朱
在伟 朱
ZHZhihui Hu
Zhihui Hu
LCLiyan Cai
Liyan Cai
Xinqiang ChenXinqiang Chen
Xinqiang Chen
XWXiaomeng Wang
Xiaomeng Wang
With the widespread application of unmanned aerial vehicle technology in navigation mark inspection, path planning algorithm efficiency has become crucial to improve inspection effectiveness. The traditional self-organizing mapping (SOM) algorithm suffers from dual limitations in UAV inspection path optimization, including insufficient global exploration during early training stages and susceptibility to local optima entrapment in later stages, resulting in limited inspection efficiency and increased operational costs. For this reason, this study proposes two improved self-organizing mapping algorithms. First, the ORC_SOM algorithm incorporating a generalized competition mechanism and local infiltration strategy is developed. Second, the ORCTS_SOM hybrid optimization model is constructed by integrating the Tabu Search algorithm. Validation using two different scale navigation mark datasets shows that compared with traditional methods, the proposed improved methods achieve significantly enhanced path planning optimization. This study provides effective path planning methods for unmanned aerial vehicle navigation mark inspection, offering algorithmic support for intelligent maritime supervision system construction.

1 August 2026 in Algorithms
Verified
Journal Article
Open access
PDF file
LXLiangkun Xu
Liangkun Xu
WYWei Yu
Wei Yu
ZHZhihui Hu
Zhihui Hu
在朱在伟 朱
在伟 朱
LCLiyan Cai
Liyan Cai
ZLZhiheng Lin
Zhiheng Lin
Navigation mark inspections are critical to ensuring maritime navigation safety, and the efficiency of unmanned aerial vehicle (UAV) inspection path planning directly affects inspection costs and operations. This problem is formulated as a Traveling Salesman Problem (TSP), and the traditional Grey Wolf Optimizer (GWO) has limitations in discrete optimization, including weak search capabilities, simple neighborhood structures, and poor local optimization. To address these issues, this paper proposes an improved Grey Wolf Optimizer (IGWO). First, this paper introduces three neighborhood search operators: reverse, insertion, and swap. Second, an adaptive step size mechanism based on Euclidean distance is designed. Third, the 3-opt local optimization algorithm is integrated. Finally, experiments are conducted using real navigation mark data from Pingtan and Tianjin, and IGWO is compared with traditional algorithms. Results show that IGWO effectively adapts GWO to discrete spaces and achieves optimal paths across datasets of varying scales. Its path length reduction rates improve by 0.51% to 58.01% over the other seven algorithms. These findings provide efficient UAV path planning solutions for navigation mark inspection and offer technical support for smart maritime supervision systems.

1 August 2019
Verified
Conference Paper
Closed access
LXLiangkun Xu
Liangkun Xu
WXWenbo Xu
Wenbo Xu
YDYifei Dang
Yifei Dang
Xiaolin WangXiaolin Wang
Xiaolin Wang
Sparse Representation Classification (SRC) has attracted much attention due to its robustness in the fields of biometrics, such as face recognition, handwriting recognition. However, traditional SRC methods have to deal with a large amount of training samples, and the performance may also affected by the high correlation among training samples. In order to solve these problems, this paper proposes clustering-aided SRC methods. The first method performs feature selection and clustering to the original training samples before SRC operation, where the preprocessing reduces the correlation among samples. To further improve the classification performance, the second method divides the training samples into several groups, where the classes with samples sharing many similarities are assigned to different groups. Then, we perform SRC separately for each group, and fuse the results together to determine the final class label. Experiments show that when compared with the conventional SRC, the first proposed method significantly reduces the computation complexity without comprising the classification accuracy, and the second proposed method outperforms the first one.