ArticleScientific reports2025
Self-adaptive search algorithm for path planning based on the A* algorithm.
Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
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.
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.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
Abstract
The A* algorithm plays an important role in global path planning for robots, but it faces challenges such as redundant nodes and large search spaces. This paper proposes the Obstacle Density-based Dynamic Exponential A* (ODDEA*) algorithm. The ODDEA* algorithm adjusts the weights of the heuristic function based on the density of the surrounding obstacles. It uses the improved heuristic function to guide the robot toward areas with low obstacle density, employing a local dynamic penalty. The computational experiments compare the proposed ODDEA* algorithm with the Theta*, A*, and BA* algorithms, involving small-size (20×20), medium-size (40×40), and large-size (60×60) grid maps, as well as 50 random medium-size maps. The proposed ODDEA* algorithm uses fewer expanded nodes and less planning time than the other algorithms. Compared with the A* algorithm, it achieves 46.96% of the planning time and 20.33% of the search space on the three fixed grid maps.
Identifiers
What OpenQuestion holds
Registered trials
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.