Research on Mobile Device Path Planning Based on Improved A* Algorithm
Path planning for mobile devices is currently a hot research topic. To address the issue of excessive path turning points in the A* algorithm, we expand the search neighborhood. To improve the low search efficiency of the traditional A* algorithm, we enhance the cost function. Through experimental simulations and data comparisons, it is concluded that compared to the traditional A* algorithm, the optimized and improved A* algorithm results in fewer path turning points, shorter path lengths, and higher planning efficiency. The optimized and improved A* algorithm outperforms the traditional A* algorithm in terms of path planning time, path nodes, and turning points.
Authors
- Bo Yu (ORCID: https://orcid.org/0000-0003-1197-2764)
- Xianxin Wei
- Fangshi Wu
Institutions
- Shenyang Ligong University (CN)
- Chinese Academy of Sciences (CN)
- Shenyang Institute of Computing Technology (China) (CN)
Publication Details
- Published
- 2024-09-20
- DOI
- https://doi.org/10.1109/spic62469.2024.10691611
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00