Cited by 168Metaheuristic Optimization Algorithms ResearchRobotic Path Planning AlgorithmsModular Robots and Swarm Intelligence

Multi-robot path planning using improved particle swarm optimization algorithm through novel evolutionary operators

Das, P.K., Jena, P.K.·2020·Applied Soft Computing

Integrity signals

Registry

Crossref · 10.1016/j.asoc.2020.106312

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The path trajectory formation process consists of four separate modules: perception, localisation, path planning, and motion control.

    “The path trajectory formation process consists of these four separate modules: perception, when the robot receives the necessary information from the sensors; localisation, when the robot aims to control its position in the environment; path planning; and motion control [79].”

Cited by

Sorted by citations

Authors
Das, P. K., & Jena, P. K.
Affiliations
Veer Surendra Sai University of Technology (IN)
Corresponding author
Das, P.K.
Venue
Applied Soft Computing
Publisher
Elsevier BV
Published
2020-07
Volume
92
Pages
106312
ISSN
1568-4946 (ISSN-L)
OpenAlex
W3018311626
Cited by
168
References
0
Citations by year
2026: 15 · 2025: 24 · 2024: 36 · 2023: 34 · 2022: 30 · 2021: 23 · 2020: 6
FWCI
8.99
Type
journal article
Language
en
Open access
closed
Locations
Applied Soft Computing (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotic Path Planning Algorithms
  • Physical Sciences › Engineering › Mechanical Engineering › Modular Robots and Swarm Intelligence
Keywords
multi-robot path planning, particle swarm optimization, evolutionary operators, collision-free paths, path length minimization, intensification and diversification, swarm intelligence, differential evolution comparison

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