ArticleSensors (Basel, Switzerland)2025
Improved Exponential and Cost-Weighted Hybrid Algorithm for Mobile Robot Path Planning.
Article in Sensors (Basel, Switzerland), 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 is widely used in mobile robot path planning; however, it faces challenges such as unsmooth planned paths, redundant nodes, and extensive search areas. This paper proposes a hybrid algorithm combining an improved A* algorithm with the Dynamic Window Approach. By quantifying grid obstacle data to extract environmental information and employing a grid-based environmental modeling method, the proposed approach enhances path smoothness at turns using second-order Bezier curve smoothing. It improves the heuristic function and child node selection process, applying these advancements in experimental path planning scenarios. A simulated 2D map was constructed using point cloud scanning in RViz to validate the hybrid algorithm through simulations and real-world outdoor tests. Experimental results demonstrate that, compared to the A* and DWA algorithms, the improved hybrid algorithm enhances search efficiency by 10.93%, reduces search node count by 32.26%, decreases the number of turning points by 36.36% and the value of turning angle by 34.83%, shortens the total path length by 22.05%, and improves overall path smoothness. Simulations and field tests confirm that the proposed hybrid algorithm is more stable, significantly reduces collision probability, and demonstrates its applicability for mobile robot localization and navigation in real-world environments.
Indexed as
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.