Path planning of mobile robots based on improved A* algorithm

摘要

Mobile robots are an important branch of service robots, and path planning is an important research part of mobile robots. For complex environments, traditional A* algorithms tend to be more restrictive in their path planning, resulting in less search efficiency. In this regard, this paper proposes to improve the A* algorithm to improve the search efficiency and path security, and realize the optimal path planning of mobile robots. Through simulation experiments, the average planning time is 0. 05s, which is more time-sensitive and efficient than other algorithms, which promotes the development process of “smart city” and promotes the innovative development of mobile robots.