The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The hybrid path planning algorithm based on improved A* and artificial potential field for unmanned surface vehicle formations
Abstract
Abstract To effectively improve system autonomy, increase fault-tolerant resilience, solve low payload capacity and short endurance time of unmanned surface vehicles (USVs), there's a trend to deploy multiple USVs as a formation fleet. The formation path planning algorithms are essential to generate optimal trajectories and provide practical collision avoidance maneuvers to efficiently navigate the USV fleet. To ensure the optimality, rationality and path continuity of the formation trajectories, this paper presents a novel deterministic algorithm named multiple sub-target artificial potential field (MTAPF) based on an improved APF. The MTAPF belongs to the local path planning algorithm, which refers to the global optimal path generated by an improved heuristic A* algorithm. and the optimal path is divided by this algorithm into multiple sub-target points to form sub-target point sequence. The MTAPF can greatly reduce the probability that USVs will fall into the local minimum and help USVs to get out of the local minimum by switching target points. As an underactuated system, the USV is restricted by various motion constraints, and the MTAPF is presented to make the generated path compliant with USV's dynamics and orientation restrictions. The proposed algorithm is validated on simulations and proven to work effectively in different environments.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Cited by
Path planning techniques for mobile robots: Review and prospect
Liu, L., Wang, X., Yang, X., Liu, H., Li, J., & Wang, P. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.120254 · Cited by 707
Review of Autonomous Path Planning Algorithms for Mobile Robots
Qin, H., Shao, S., Wang, T., Yu, X., Jiang, Y., & Cao, Z. (2023) · Drones · doi:10.3390/drones7030211 · Cited by 322
Metadata
- Authors
- Sang, H., You, Y., Sun, X., Zhou, Y., & Liu, F.
- Venue
- Ocean Engineering
- Publisher
- Elsevier BV
- Published
- 2021-03
- Volume
- 223
- Pages
- 108709
- ISSN
- 0029-8018 (ISSN-L)
- OpenAlex
- W3132663004
- Cited by
- 407
- References
- 1
- FWCI
- 23.37
- Type
- journal article
- Language
- en
- Open access
- closed
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: The hybrid path planning algorithm based on improved A* and artificial potential field for unmanned surface vehicle formations. https://app.cochat.ai/papers/10.1016/j.oceaneng.2021.108709
- The paper
- Sang, H., You, Y., Sun, X., Zhou, Y., & Liu, F. (2021). The hybrid path planning algorithm based on improved A* and artificial potential field for unmanned surface vehicle formations. Ocean Engineering. https://doi.org/10.1016/j.oceaneng.2021.108709
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.