Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 255

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

A review of motion planning algorithms for intelligent robots

Open access
Zhou, Chengmin, Huang, Bingding, Fränti, Pasi·2022·Journal of Intelligent Manufacturing

Abstract

Principles of typical motion planning algorithms are investigated and analyzed in this paper. These algorithms include traditional planning algorithms, classical machine learning algorithms, optimal value reinforcement learning, and policy gradient reinforcement learning. Traditional planning algorithms investigated include graph search algorithms,sampling-based algorithms,interpolating curve algorithms, and reaction-based algorithms. Classical machine learning algorithms include multiclass support vector machine,long short-term memory,Monte-Carlo tree search and convolutional neural network. Optimal value reinforcement learning algorithms include Q learning,deep Q-learning network,double deep Q-learning network,dueling deep Q-learning network. Policy gradient algorithms include policy gradient method,actor-critic algorithm,asynchronous advantage actor-critic,advantage actor-critic,deterministic policy gradient,deep deterministic policy gradient,trust region policy optimization and proximal policy optimization. New general criteria are also introduced to evaluate the performance and application of motion planning algorithms by analytical comparisons. The convergence speed and stability of optimal value and policy gradient algorithms are specially analyzed. Future directions are presented analytically according to principles and analytical comparisons of motion planning algorithms. This paper provides researchers with a clear and comprehensive understanding about advantages, disadvantages, relationships, and future of motion planning algorithms in robots, and paves ways for better motion planning algorithms in academia, engineering, and manufacturing.

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.

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

Integrity signals

Registry

Crossref · 10.1007/s10845-021-01867-z

Cites

96 of 96 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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 96 references

Cited by

See all 255

Metadata

Authors
Zhou, C., Huang, B., & Fränti, P.
Venue
Journal of Intelligent Manufacturing
Published
2021-11-25
Volume
33
Issue
2
Pages
387-424
ISSN
  • 0956-5515 (ISSN-L)
  • 1572-8145
OpenAlex
W3214738088
Cited by
255
References
96
FWCI
11.91
Type
journal article
Language
en
Open access
hybrid

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 review of motion planning algorithms for intelligent robots. https://app.cochat.ai/papers/10.1007/s10845-021-01867-z
The paper
Zhou, C., Huang, B., & Fränti, P. (2022). A review of motion planning algorithms for intelligent robots. Journal of Intelligent Manufacturing. https://doi.org/10.1007/s10845-021-01867-z

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.