Research on Path Planning for Intelligent Mobile Robots Based on Improved A* Algorithm

Intelligent mobile robots have been gradually used in various fields, including logistics, healthcare, service, and maintenance. Path planning is a crucial aspect of intelligent mobile robot research, which aims to empower robots to create optimal trajectories within complex and dynamic environments autonomously. This study introduces an improved A* algorithm to address the challenges faced by the preliminary A* pathfinding algorithm, which include limited efficiency, inadequate robustness, and excessive node traversal. Firstly, the node storage structure is optimized using a minimum heap to decrease node traversal time. In addition, the heuristic function is improved by adding an adaptive weight function and a turn penalty function. The original 8-neighbor is expanded to a 16-neighbor within the search strategy, followed by the elimination of invalid search neighbor to refine it into a new 8-neighbor according to the principle of symmetry, thereby enhancing the directionality of the A* algorithm and improving search efficiency. Furthermore, a bidirectional search mechanism is implemented to further reduce search time. Finally, trajectory optimization is performed on the planned paths using path node elimination and cubic Bezier curves, which aligns the optimized paths more closely with the kinematic constraints of the robot derivable trajectories. In simulation experiments on grid maps of different sizes, it was demonstrated that the proposed improved A* algorithm outperforms the preliminary A* Algorithm in various metrics, such as search efficiency, node traversal count, path length, and inflection points. The improved algorithm provides substantial value for practical applications by efficiently planning optimal paths in complex environments and ensuring robot drivability.