Indoor Mobile Robot Path Planning Based on Improved A* Algorithm

To address issues such as data redundancy, low execution efficiency, and the difficulty for mobile robots to adjust their posture at turning points encountered by the traditional <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$A^{*}$</tex> algorithm in path planning, this paper proposes an improved <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$A^{*}$</tex> path planning algorithm. It can effectively calculate turning points, rotation directions, and minimum rotation angles, and smooth the path by optimizing the selection of key points. The algorithmic refinement phase initially optimizes computational throughput through enhanced jump point prioritization, strategically pruning redundant node expansions in <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$A^{*}$</tex> path exploration. Complementing this structural optimization, a dynamic heuristic weighting mechanism was implemented to refine search directionality. Finally, parametric Bézier interpolation was applied to ensure geometric continuity in derived trajectories, achieving second-order continuity essential for kinematically feasible robotic navigation. To verify the feasibility and effectiveness of the improved algorithm, comparative simulation experiments were conducted on grid maps of different sizes and mobile robot platforms. Comparative simulations across varied grid maps and mobile robots demonstrate about 36.25 % fewer expanded nodes, 31.25 % faster computation, and 21.03 % improved path smoothness versus conventional <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$A^{*}$</tex>. The optimization framework significantly enhances angular adaptation at inflection points and navigation efficiency, validating its effectiveness in autonomous systems. The integrated approach balances computational economy with trajectory quality, establishing a practical advancement in robotic path planning paradigms.

Authors

Institutions

Publication Details

Published
2025-04-11
DOI
https://doi.org/10.1109/ainit65432.2025.11035014
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

Indoor Mobile Robot Path Planning Based on Improved A* Algorithm

Dongcheng Wei, Liu Yang, Q. W. Lu
Robotic Path Planning Algorithms
article

Indoor Mobile Robot Path Planning Based on Improved A* Algorithm

Dongcheng Wei, Liu Yang, Q. W. Lu
article en

Abstract

To address issues such as data redundancy, low execution efficiency, and the difficulty for mobile robots to adjust their posture at turning points encountered by the traditional <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$A^{*}$</tex> algorithm in path planning, this paper proposes an improved <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$A^{*}$</tex> path planning algorithm. It can effectively calculate turning points, rotation directions, and minimum rotation angles, and smooth the path by optimizing the selection of key points. The algorithmic refinement phase initially optimizes computational throughput through enhanced jump point prioritization, strategically pruning redundant node expansions in <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$A^{*}$</tex> path exploration. Complementing this structural optimization, a dynamic heuristic weighting mechanism was implemented to refine search directionality. Finally, parametric Bézier interpolation was applied to ensure geometric continuity in derived trajectories, achieving second-order continuity essential for kinematically feasible robotic navigation. To verify the feasibility and effectiveness of the improved algorithm, comparative simulation experiments were conducted on grid maps of different sizes and mobile robot platforms. Comparative simulations across varied grid maps and mobile robots demonstrate about 36.25 % fewer expanded nodes, 31.25 % faster computation, and 21.03 % improved path smoothness versus conventional <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$A^{*}$</tex>. The optimization framework significantly enhances angular adaptation at inflection points and navigation efficiency, validating its effectiveness in autonomous systems. The integrated approach balances computational economy with trajectory quality, establishing a practical advancement in robotic path planning paradigms.

Hohai University (CN)
Sustainable cities and communities
Openalex Percentile: Top 87%
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.

Indoor Mobile Robot Path Planning Based on Improved A* Algorithm — Dongcheng Wei, Liu Yang, et al. · (2025) | TGRS Research Map | TGRS