Smooth Path Planning for Unmanned Surface Vehicle in Environments with Unknown Polygonal Obstacles

Path optimization is a critical issue in unmanned surface vehicle (USV) path planning. The smoothness of the generated path and the number of turning points directly affect the ability of the USV to navigate safely. To address the global path planning problem in unknown polygonal obstacle environments, a novel path planning method with obstacle avoidance based on visibility graph is presented in this paper. The polygonal obstacles with different shape are modeled to get a smooth, feasible and collision-free path. The USV only needs to consider the closest obstacle in view and choose the shortest path to the target from the visibility tangent graph formed by the three nodes (its current position, the nearest obstacle, and the target). Upon encountering an obstacle, the USV navigates along the obstacle boundary and transitions to the next tangent path toward the target. The method can effectively reduce the computational complexity and generate a smooth path. The simulation results are consistent with the theoretical values, which verifies the feasibility of the proposed method.

Authors

Institutions

Publication Details

Published
2025-02-28
DOI
https://doi.org/10.1109/icsgge64667.2025.10984917
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Smooth Path Planning for Unmanned Surface Vehicle in Environments with Unknown Polygonal Obstacles

Yongding Zhang, Chongjie Wang, Guangshun Yao, Huibin Wang
Robotic Path Planning Algorithms
article

Smooth Path Planning for Unmanned Surface Vehicle in Environments with Unknown Polygonal Obstacles

Yongding Zhang, Chongjie Wang, Guangshun Yao, Huibin Wang
article en

Abstract

Path optimization is a critical issue in unmanned surface vehicle (USV) path planning. The smoothness of the generated path and the number of turning points directly affect the ability of the USV to navigate safely. To address the global path planning problem in unknown polygonal obstacle environments, a novel path planning method with obstacle avoidance based on visibility graph is presented in this paper. The polygonal obstacles with different shape are modeled to get a smooth, feasible and collision-free path. The USV only needs to consider the closest obstacle in view and choose the shortest path to the target from the visibility tangent graph formed by the three nodes (its current position, the nearest obstacle, and the target). Upon encountering an obstacle, the USV navigates along the obstacle boundary and transitions to the next tangent path toward the target. The method can effectively reduce the computational complexity and generate a smooth path. The simulation results are consistent with the theoretical values, which verifies the feasibility of the proposed method.

Chuzhou University (CN)
Anhui Provincial Department of Education
Sustainable cities and communities
Openalex Percentile: Top 92%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.