The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
ACO-A*: Ant Colony Optimization Plus A* for 3-D Traveling in Environments With Dense Obstacles
Open accessAbstract
Path planning is one of the most important problems in the development of autonomous underwater vehicles (AUVs). In some common AUV missions, e.g., wreckage search for rescue, an AUV is often required to traverse multiple targets in a complex environment with dense obstacles. In such case, the AUV path planning problem becomes even more challenging. In order to address the problem, this paper develops a two-layer algorithm, namely ACO-A*, by combining the ant colony optimization (ACO) with the A* search. Once a mission with a set of arbitrary targets is assigned, ACO is responsible to determine the traveling order of targets. But, prior to ACO, a cost graph indicating the necessary traveling costs among targets must be quickly established to facilitate traveling order evaluation. For this purpose, a coarse-grained modeling with a representative-based estimation (RBE) strategy is proposed. Following the order obtained by ACO, targets will be traversed one by one and the pairwise path planning to reach each target can be performed during vehicle driving. To deal with the dense obstacles, A* is adopted to plan paths based on a fine-grained modeling and an admissible heuristic function is designed for A* to guarantee its optimality. Experiments on both synthetic and realistic scenarios have been designed to validate the efficiency of the proposed ACO-A*, as well as the effectiveness of RBE and the necessity of A*.
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
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Cited by
Safety-enhanced UAV path planning with spherical vector-based particle swarm optimization
Phung, M. D., & Ha, Q. P. (2021) · Applied Soft Computing · doi:10.1016/j.asoc.2021.107376 · Cited by 565
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
Self-citation
Metadata
- Authors
- Yu, X., Chen, W.-N., Gu, T., Yuan, H., Zhang, H., & Zhang, J.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2019-08
- Volume
- 23
- Issue
- 4
- Pages
- 617-631
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2898165977
- Cited by
- 173
- References
- 2
- FWCI
- 4.98
- Type
- journal article
- Language
- en
- Open access
- bronze
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: ACO-A*: Ant Colony Optimization Plus A* for 3-D Traveling in Environments With Dense Obstacles. https://app.cochat.ai/papers/10.1109/tevc.2018.2878221
- The paper
- Yu, X., Chen, W.-N., Gu, T., Yuan, H., Zhang, H., & Zhang, J. (2019). ACO-A*: Ant Colony Optimization Plus A* for 3-D Traveling in Environments With Dense Obstacles. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2018.2878221
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.