Research on Path Planning Method of Indoor Mobile Robot based on Improved A-Star Algorithm

Aiming at the problems of high complexity, large positioning error and difficulty in adapting to dynamic environment of indoor mobile robot path planning algorithm, in this paper, we propose an improved indoor mobile path planning scheme based on A-Star algorithm. By setting the heuristic function,...

Full description

Saved in:
Bibliographic Details
Published in2022 10th International Conference on Information Systems and Computing Technology (ISCTech) pp. 786 - 791
Main Authors Fu, Yaoyao, Guan, Ziyu, Yuan, Wenlong
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2022
Subjects
A-Star algorithm
Complexity theory
Computational modeling
Computers
Dynamic programming
Heuristic algorithms
indoor mobile robots
Path planning
Planning
Programming
RTT algorithm
Online AccessGet full text
DOI10.1109/ISCTech58360.2022.00129

Cover

More Information
Summary:Aiming at the problems of high complexity, large positioning error and difficulty in adapting to dynamic environment of indoor mobile robot path planning algorithm, in this paper, we propose an improved indoor mobile path planning scheme based on A-Star algorithm. By setting the heuristic function, the target tendency of the algorithm iteration is enhanced, and the RTT algorithm feature is introduced to quickly generate path nodes, to optimize the rapid planning ability of the overall device for the dynamic environment and reduce the local optimization of the planning results and wasted hash power. After Xpresso's simulation test, the improved A-S tar algorithm has stronger path solving ability and higher positioning accuracy, and the robot path is smoother.
DOI:10.1109/ISCTech58360.2022.00129