Path Planning for Mobile Robots Based on Improved A-star Algorithm
In this paper, an improved A-star (A*) algorithm is presented, which decreases the search time and path cost by introducing a bidirectional search strategy, enhancing the evaluation function.Through the addition of inflection points deletion method, the path smoothness is augmented, and the running speed and reliability of A* are enhanced.Eventually, the superiority of the improved A* algorithm is verified through comparative experiments.
Authors
- Yuanyuan Zhang (ORCID: https://orcid.org/0000-0002-4542-2173)
- Miao Zhang (ORCID: https://orcid.org/0000-0002-7907-2255)
Institutions
- Tianjin University of Science and Technology (CN)
Publication Details
- Journal
- Proceedings of International Conference on Artificial Life and Robotics
- Published
- 2025-02-13
- DOI
- https://doi.org/10.5954/icarob.2025.os3-3
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00