A Two-Stage Coverage Path Planning Compliant with the Kinematic Constraints of USVs

The existence of omitted areas is unacceptable in coverage missions such as maritime search and military reconnaissance. Therefore, it is crucial to plan a path that can guarantee the full coverage of the mission area and conform to the kinematic characteristics of Unmanned Surface Vehicles (USVs). To achieve this objective, this paper proposes a two-stage coverage path planning algorithm aimed at optimizing coverage paths of underactuated USVs. In the first stage, the USV is modeled as a particle to facilitate path planning, and an improved Direction Highest Priority First (DHPF) coverage path planning algorithm is proposed to minimize collision risks for USVs during turns near obstacles. In the second stage, two kinematic constraints, turning radius, and safety distance, are incorporated into the USV model, and a multi-strategy switching framework is devised to tackle planning challenges associated with different types of paths. Specifically, an improved Hybrid A-star path planning algorithm with a variable step size is proposed to minimize both the path length and search time, and a backward mechanism is introduced to ensure full coverage of the area when forward turning conditions of the USV cannot be satisfied. The simulation results demonstrate the effectiveness of the proposed coverage path planning algorithm.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1109/cac63892.2024.10865709
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Two-Stage Coverage Path Planning Compliant with the Kinematic Constraints of USVs

Peizhang Li, Baokui Li, Jiachen Zheng, Qing Fei
1 citations
Robotic Path Planning Algorithms
0.25
article

A Two-Stage Coverage Path Planning Compliant with the Kinematic Constraints of USVs

Peizhang Li, Baokui Li, Jiachen Zheng, Qing Fei
article en
1 citations

Abstract

The existence of omitted areas is unacceptable in coverage missions such as maritime search and military reconnaissance. Therefore, it is crucial to plan a path that can guarantee the full coverage of the mission area and conform to the kinematic characteristics of Unmanned Surface Vehicles (USVs). To achieve this objective, this paper proposes a two-stage coverage path planning algorithm aimed at optimizing coverage paths of underactuated USVs. In the first stage, the USV is modeled as a particle to facilitate path planning, and an improved Direction Highest Priority First (DHPF) coverage path planning algorithm is proposed to minimize collision risks for USVs during turns near obstacles. In the second stage, two kinematic constraints, turning radius, and safety distance, are incorporated into the USV model, and a multi-strategy switching framework is devised to tackle planning challenges associated with different types of paths. Specifically, an improved Hybrid A-star path planning algorithm with a variable step size is proposed to minimize both the path length and search time, and a backward mechanism is introduced to ensure full coverage of the area when forward turning conditions of the USV cannot be satisfied. The simulation results demonstrate the effectiveness of the proposed coverage path planning algorithm.

Beijing Institute of Technology (CN)
Sustainable cities and communities
Openalex Percentile: Top 42%
Robotic Path Planning Algorithms
0.25
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.