Research on optimization A* algorithm based on energy consumption of mobile navigation robot
A novel energy-efficient optimization A* algorithm is proposed to address the performance requirements of energy consumption reduction and global optimality in the context of mobile navigation robots for the visually impaired. The energy cost function of mobile navigation robots is incorporated into a heuristic algorithm based on the A* algorithm to plan energy-optimal paths quickly. The optimized A* algorithm was compared with the original A* algorithm and the Q-learning algorithm through simulation experiments on a grid map using the MATLAB platform. The experimental results show that compared with the standard A* algorithm, the optimized A* algorithm reduces the path-planning time by 37.2% and the energy consumption by 29.5%. In addition, compared with the Q-learning algorithm, this algorithm’s overall search efficiency is improved by 76.8%. Simulation results show that the optimized A* algorithm is more efficient in searching and has a shorter seek time, fully saving energy.
Authors
- Fugeng Li
- Changyuan Feng (ORCID: https://orcid.org/0000-0002-2688-1390)
- Yahui Nie (ORCID: https://orcid.org/0000-0002-1799-0640)
- Zhihao Ma (ORCID: https://orcid.org/0000-0001-6651-423X)
- Bin Hong (ORCID: https://orcid.org/0000-0002-1860-6401)
- Jing Hou (ORCID: https://orcid.org/0000-0003-0792-8971)
- Zhan Yi Cao (ORCID: https://orcid.org/0000-0002-2148-5006)
Institutions
- Tianjin University (CN)
- Tianjin Tianhe Hospital (CN)
- Tianjin Internal Combustion Engine Research Institute (CN)
- Tiandi Science & Technology (China) (CN)
- Tianjin Medical University (CN)
Publication Details
- Journal
- Advances in Complex Systems
- Published
- 2025-03-22
- DOI
- https://doi.org/10.1142/s1793962325500370
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00