CoChat

Path Planning and Obstacle Avoiding of the USV Based on Improved ACO-APF Hybrid Algorithm With Adaptive Early-Warning

Open access
Chen, Yanli, Bai, Guiqiang, Zhan, Yin, Hu, Xinyu, Liu, Jun · 2021 · IEEE Access
Cited by 163

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

Path planning is important to the efficiency and navigation safety of USV autonomous operation offshore. To improve path planning, this study proposes the improved ant colony optimization-artificial potential field (ACO-APF) algorithm, which is based on a grid map for both local and global path planning of USVs in dynamic environments. The improved ant colony optimization (ACO) mechanism is utilized to search for a globally optimal path from the starting point to the endpoint for a USV in a grid environment, and the improved artificial potential field (APF) algorithm is subsequently employed to avoid unknown obstacles during USV navigation. The primary contributions of this article are as follows: (1) this article proposes a new heuristic function, pheromone update rule, and dynamic pheromone volatilization factor to improve convergence and mitigate finding local optima with the traditional ant colony algorithm; (2) we propose an equipotential line outer tangent circle and redefine potential functions to eliminate goals unreachable by nearby obstacles (GNRONs) and local minimum problems, respectively; (3) to adapt the USV to a complex environment, this article proposes a dynamic early-warning step-size adjustment strategy in which the moving distance and safe obstacle avoidance range in each step are adjusted based on the complexity of the surrounding environment; (4) the improved ant colony optimization algorithm and artificial potential field algorithm are effectively combined to form the algorithm proposed in this article, which is verified as an effective solution for USV local and global path planning using a series of simulations. Finally, in contrast to most papers, we successfully perform field experiments to verify the feasibility and effectiveness of the proposed algorithm.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/access.2021.3062375

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 163

Metadata

Authors
Chen, Y., Bai, G., Zhan, Y., Hu, X., & Liu, J.
Venue
IEEE Access
Published
2021
Volume
9
Pages
40728-40742
ISSN
2169-3536 (ISSN-L)
OpenAlex
W3134645133
Cited by
163
References
1
FWCI
9.26
Type
journal article
Language
en
Open access
gold

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Path Planning and Obstacle Avoiding of the USV Based on Improved ACO-APF Hybrid Algorithm With Adaptive Early-Warning. https://app.cochat.ai/papers/10.1109/access.2021.3062375
The paper
Chen, Y., Bai, G., Zhan, Y., Hu, X., & Liu, J. (2021). Path Planning and Obstacle Avoiding of the USV Based on Improved ACO-APF Hybrid Algorithm With Adaptive Early-Warning. IEEE Access. https://doi.org/10.1109/access.2021.3062375

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.