Research on the A* Algorithm Based on Adaptive Weights and Heuristic Reward Values
Aiming at the problems of the A* algorithm’s long running time, large number of search nodes, tortuous paths, and the planned paths being prone to colliding with the corner points of obstacles, adaptive weighting and reward value theory are proposed to improve it. Firstly, the diagonal-free five-way...
Saved in:
| Main Authors: | Xizheng Wang, Gang Li, Zijian Bian |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-03-01
|
| Series: | World Electric Vehicle Journal |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2032-6653/16/3/144 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Multi-Indicator Heuristic Evaluation-Based Rapidly Exploring Random Tree Algorithm for Robot Path Planning in Complex Environments
by: Wenqiang Wu, et al.
Published: (2025-03-01) -
Path Planning of Intelligent Mobile Robots with an Improved RRT Algorithm
by: Wenliang Zhu, et al.
Published: (2025-03-01) -
A Vehicle Path Planning Algorithm: QDDG-RRT
by: Ruixin Zhang, et al.
Published: (2025-01-01) -
Mobile Robot Path Planning Based on Fused Multi-Strategy White Shark Optimisation Algorithm
by: Dazhang You, et al.
Published: (2025-07-01) -
Research on APF-Dijkstra Path Planning Fusion Algorithm Based on Steering Model and Volume Constraints
by: Xizheng Wang, et al.
Published: (2025-07-01)