Evidence map›Paper›PMID 40221514›Full record

ArticleScientific reports2025

Simulation-based review of classical, heuristic, and metaheuristic path planning algorithms.

Kenneth Christopher Ugwoke, Nwojo Agwu Nnanna, Saleh El-Yakub Abdullahi

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 8 papers.

0numbers the graph read from it
0cells of the map it votes in
8citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

8 citing papers in PubMed.

  1. Review
  2. Article
  3. Article
  4. Review
  5. Review
  6. Article
  7. Article
  8. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Kenneth Christopher UgwokeDepartment of Computer Science, Nile University of Nigeria, Plot 681, Cadastral Zone C, Airport Road, Jabi, Abuja Federal Capital Territory, Nigeria. kenchijoke@yahoo.com.
Nwojo Agwu NnannaDepartment of Computer Science, Nile University of Nigeria, Plot 681, Cadastral Zone C, Airport Road, Jabi, Abuja Federal Capital Territory, Nigeria.
Saleh El-Yakub AbdullahiDepartment of Computer Science, Nile University of Nigeria, Plot 681, Cadastral Zone C, Airport Road, Jabi, Abuja Federal Capital Territory, Nigeria.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Path planning is the process by which an autonomous robot obtains information about its environment and chooses the best route from the start point to the target destination while avoiding obstacles. It is vital to the success of robot operation as it provides autonomous maneuverability within the environment, ensuring a collision-free and optimum path that guarantees efficient movement. This paper introduces and categorizes several notable path-planning algorithms used in robotics operations. We delve into their basic principles, key features, challenges, and real-world applications. Additionally, we provided a simulated comparison result of the notable path-planning algorithms. Finally, we analyze the outcomes, give a concise conclusion, and forecast the future trends in path planning techniques.

Indexed as

AlgorithmCollision-free pathMetaheuristicMobile robotPath planning

Identifiers

PMID40221514
PMCPMC11993688

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.