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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on optimization A* algorithm based on energy consumption of mobile navigation robot

Fugeng Li, Changyuan Feng, Yahui Nie, Zhihao Ma et al.
Advances in Complex Systems
Robotic Path Planning Algorithms
article

Research on optimization A* algorithm based on energy consumption of mobile navigation robot

Fugeng Li, Changyuan Feng, Yahui Nie, Zhihao Ma, Bin Hong, Jing Hou, Zhan Yi Cao
article en

Abstract

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.

Advances in Complex SystemsVol. 16(02)
Tianjin University (CN), Tianjin Tianhe Hospital (CN), Tianjin Internal Combustion Engine Research Institute (CN), Tiandi Science & Technology (China) (CN), Tianjin Medical University (CN)
Affordable and clean energy
Openalex Percentile: Top 96%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.