Xiaoyu Yuan

Mr. Xiaoyu Yuan

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
5 January 2023 in IEEE Access
Verified
Journal Article
Open access
ZZZheng Zhou
Zheng Zhou
YZYingjian Zhang
Yingjian Zhang
XYXiaoyu Yuan
Xiaoyu Yuan
Hongbo WangHongbo Wang
Hongbo Wang
The automatic identification system (AIS) provides a massive database for ocean artificial intelligence. The original AIS data are redundant. Direct use will cause a waste of data storage space and computation costs; hence, data compression must be performed. The Douglas–Peucker algorithm (DP) is an effective trajectory compression algorithm that can well preserve the spatial characteristics of a trajectory but has the following shortcomings: first, it has poor track recovery when compressing multi-turn routes; second, it does not consider the ship speed and heading; and third, it may have the wrong result of the compressed trajectory crossing the obstacle. To address these situations, this study proposes a multi-objective peak DP algorithm (MPDP) that adopts a peak sampling strategy, considers three optimization objectives (spatial characteristics, heading and speed) of trajectory and adds an obstacle detection mechanism to realize a compression algorithm more suitable for curved trajectories. The classical DP algorithm is compared with the MPDP algorithm by simulating trajectory and real trajectory experiments. The results show that the MPDP algorithm optimizes the length loss rate, simultaneous Euclidean distance, and average deviations of the speed and the heading while maintaining a high compression rate similar to that of the DP algorithm. Moreover, it can also successfully avoid obstacles. The optimization effect is most obvious for the multi-turn or hovering trajectory. The optimization rate of length loss, synchronous Euclidean distance, and average deviation of the heading can reach 40%.

Verified
Journal Article
Open access
PDF file
XYXiaoyu Yuan
Xiaoyu Yuan
CTChengchang Tong
Chengchang Tong
GHGuoxiang He
Guoxiang He
Hongbo WangHongbo Wang
Hongbo Wang
In recent years, the rapid development of artificial intelligence algorithms has promoted the intelligent transformation of the ship industry; unmanned surface vessels (USVs) have become a widely used representative product. The dynamic window approach (DWA) is an effective robotic collision avoidance algorithm; however, there are deficiencies in its application to the ship field. First, the DWA algorithm does not consider International Regulations for Preventing Collisions at Sea (COLREGs), which must be met for ship collision avoidance to ensure the navigational safety of the USV and other ships. Second, the DWA algorithm does not consider the influence of wind and waves on the collision avoidance of USVs in actual navigational environments. Reasonable use of windy and wavy environments not only improves navigational safety but also saves navigational time and fuel consumption, thereby improving the economy. Therefore, this paper proposes an improvement algorithm by DWA referred to as utility DWA (UDWA) based on COLREGs considering the sailing environment. The velocity sampling area was improved by dividing the priority, and the velocity function in the objective function was enhanced to convert the effect of wind and waves on the USVs into a change in velocity. The simulation results showed that the UDWA algorithm optimized the distance to the obstacle ship by 43.25%, 31.36%, and 67.81% in a head-on situation, crossing situation, and overtaking situation, respectively, compared to the COLREGs-compliant DWA algorithm, which considers the COLREGs. The improved algorithm not only follows the COLREGs but also has better flexibility in emergency collision avoidance and can safely and economically navigate and complete collision avoidance in windy and wavy environments.


2 October 2023 in IEEE Access
Verified
Journal Article
Open access
YZYingjian Zhang
Yingjian Zhang
XYXiaoyu Yuan
Xiaoyu Yuan
MLMeng Li
Meng Li
GZGuang Zhao
Guang Zhao
Hongbo WangHongbo Wang
Hongbo Wang
Automatic Identification System (AIS) can obtain a large amount of data on ship trajectories and movement characteristics, which provides data support for ship route planning, navigation safety, and maritime traffic control. Therefore, it is of great importance to analyze and cluster the AIS data to obtain an understanding of the movement behavior of ships. The Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm is capable of discovering arbitrarily shaped clusters and is suitable for clustering ship trajectories. However, the traditional DBSCAN algorithm suffers from the following shortcomings. First, the DBSCAN algorithm requires the input of a similarity matrix between the trajectories, and the similarity matrix obtained from the traditional Hausdorff distances does not identify the trajectory directions. Second, the DBSCAN algorithm is sensitive to the input parameters, and the clustering results obtained from different datasets with the same parameters vary widely. Finally, the DBSCAN algorithm is poor at clustering multi-density distribution datasets. To address these shortcomings, this study proposes a multi-density adaptive trajectory clustering (MDA-Traclus) algorithm, which considers the multi-density distribution trajectory dataset, adaptively determines the input parameters, and adds a trajectory direction identification mechanism to realize the clustering of trajectory clusters with different directions and different densities. Here, the classical DBSCAN algorithm, KANN-DBSCAN algorithm, and MDA-Traclus algorithm are compared and analyzed using four manually labeled trajectory datasets and a real trajectory dataset. The results show that the MDA-Traclus algorithm and KANN-DBSCAN algorithm are able to automatically determine the input parameters when clustering trajectory datasets with uniformly distributed densities and achieve the same clustering effect as the DBSCAN algorithm. When the trajectory density distribution is not uniform and the directions of the trajectory clusters are not consistent, the MDA-Traclus algorithm can effectively identify the low-density regions, differentiate the different directions of trajectories, and improve the clustering of the trajectories.

Verified
Journal Article
Open access
PDF file
XYXiaoyu Yuan
Xiaoyu Yuan
JWJiawei Wang
Jiawei Wang
GZGuang Zhao
Guang Zhao
Hongbo WangHongbo Wang
Hongbo Wang
Inland waterway transport is an important mode of transportation for many countries and regions. Route planning optimization can reduce navigation time, avoid traffic congestion, and improve transportation efficiency. In actual operations, many vessels determine their navigation routes based on the experience of their shipowners. When the captain fails to obtain accurate information, experience-based routes may pose significant navigation risks and may not consider the overall economic efficiency. This study proposes a comprehensive method for optimizing inland waterway vessel routes using automatic identification system (AIS) data, considering the geographical characteristics of inland waterways and navigation constraints. First, AIS data from vessels in inland waters are collected, and the multi-objective Peak Douglas–Peucker (MPDP) algorithm is applied to compress the trajectory data. Compared to the traditional DP algorithm, the MPDP algorithm reduces the average compression rate by 5.27%, decreases length loss by 0.04%, optimizes Euclidean distance by 50.16%, and improves the mean deviations in heading and speed by 23.53% and 10.86%, respectively. Next, the Ordering Points to Identify the Clustering Structure (OPTICS) algorithm is used to perform cluster analysis on the compressed route points. Compared to the traditional DBSCAN algorithm, the OPTICS algorithm identifies more clusters that are both detailed and hierarchically structured, including some critical waypoints that DBSCAN may overlook. Based on the clustering results, the A* algorithm is used to determine the connectivity between clusters. Finally, the nondominated sorting genetic algorithm II is used to select suitable route points within the connected clusters, optimizing objectives, including path length and route congestion, to form an optimized complete route. Experiments using vessel data from the waters near Shuangshan Island indicate that, when compared to three classic original routes, the proposed method achieves path length optimizations of 4.28%, 1.67%, and 0.24%, respectively, and reduces congestion by 24.15%. These improvements significantly enhance the planning efficiency of inland waterway vessel routes. These findings provide a scientific basis and technical support for inland waterway transport.