CoChat

A New Robot Navigation Algorithm Based on a Double-Layer Ant Algorithm and Trajectory Optimization

Yang, Hui, Qi, Jie, Miao, Yongchun, Sun, Haixin, Li, Jianghui · 2019 · IEEE Transactions on Industrial Electronics
Cited by 181

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

Abstract

This paper presents an efficient double-layer ant colony optimization algorithm, called DL-ACO, for autonomous robot navigation. This DL-ACO consists of two ant colony algorithms that run independently and successively. First, a parallel elite ant colony optimization method is proposed to generate an initial collision-free path in a complex map, and then, we apply a path improvement algorithm called turning point optimization algorithm, in which the initial path is optimized in terms of length, smoothness, and safety. Besides, a piecewise B-spline path smoother is presented for easier tracking control of the mobile robot. Our method is tested by simulations and compared with other path planning algorithms. The results show that our method can generate better collision-free path efficiently and consistently, which demonstrates the effectiveness of the proposed algorithm. Furthermore, its performance is validated by experiments in indoor and outdoor environments.

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/tie.2018.2886798

Cites

26 of 26 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 26 references

Metadata

Authors
Yang, H., Qi, J., Miao, Y., Sun, H., & Li, J.
Venue
IEEE Transactions on Industrial Electronics
Published
2019-11
Volume
66
Issue
11
Pages
8557-8566
ISSN
  • 0278-0046 (ISSN-L)
  • 1557-9948
OpenAlex
W2906415336
Cited by
181
References
26
FWCI
5.86
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: A New Robot Navigation Algorithm Based on a Double-Layer Ant Algorithm and Trajectory Optimization. https://app.cochat.ai/papers/10.1109/tie.2018.2886798
The paper
Yang, H., Qi, J., Miao, Y., Sun, H., & Li, J. (2019). A New Robot Navigation Algorithm Based on a Double-Layer Ant Algorithm and Trajectory Optimization. IEEE Transactions on Industrial Electronics. https://doi.org/10.1109/tie.2018.2886798

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.