The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A comparative review on mobile robot path planning: Classical or meta-heuristic methods?
Open accessAbstract
Abstract The involvement of Meta-heuristic algorithms in robot motion planning has attracted the attention of researchers in the robotics community due to the simplicity of the approaches and their effectiveness in the coordination of the agents. This study explores the implementation of many meta-heuristic algorithms, e.g. Genetic Algorithm (GA), Differential Evolution (DE), Particle Swarm Optimization (PSO) and Cuckoo Search Algorithm (CSA) in multiple motion planning scenarios. The study provides comparison between multiple meta-heuristic approaches against a set of well-known conventional motion planning and navigation techniques such as Dijkstra’s Algorithm (DA), Probabilistic Road Map (PRM), Rapidly Random Tree (RRT) and Potential Field (PF). Two experimental environments with difficult to manipulate layouts are used to examine the feasibility of the methods listed. several performance measures such as total travel time, number of collisions, travel distances, energy consumption and displacement errors are considered for assessing feasibility of the motion planning algorithms considered in the study. The results show the competitiveness of meta-heuristic approaches against conventional methods. Dijkstra ’s Algorithm (DA) is considered a benchmark solution and Constricted Particle Swarm Optimization (CPSO) is found performing better than other meta-heuristic approaches in unknown 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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500106 · Cited by 7,894
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343
Cited by
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
A Fast Large-Scale Path Planning Method on Lunar DEM Using Distributed Tile Pyramid Strategy
Hong, Z., Tu, B., Tong, X., Pan, H., Zhou, R., Zhang, Y., Han, Y., Wang, J., Yang, S., & Ma, Z. (2023) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2022.3226527 · Cited by 12
Metadata
- Authors
- Wahab, M. N. A., Nefti-Meziani, S., & Atyabi, A.
- Venue
- Annual Reviews in Control
- Publisher
- Elsevier BV
- Published
- 2020
- Volume
- 50
- Pages
- 233-252
- ISSN
- 1367-5788 (ISSN-L)
- OpenAlex
- W3093374227
- Cited by
- 241
- References
- 3
- FWCI
- 10.71
- Type
- journal article
- Language
- en
- Open access
- green
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 comparative review on mobile robot path planning: Classical or meta-heuristic methods? https://app.cochat.ai/papers/10.1016/j.arcontrol.2020.10.001
- The paper
- Wahab, M. N. A., Nefti-Meziani, S., & Atyabi, A. (2020). A comparative review on mobile robot path planning: Classical or meta-heuristic methods? Annual Reviews in Control. https://doi.org/10.1016/j.arcontrol.2020.10.001
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.