An Improved A-Star Path Planning Algorithm Based on Mobile Robots in Medical Testing Laboratories

Abstract

In the blood sample management pipeline environment, we have innovatively improved the traditional A-star algorithm to enhance the efficiency of mobile robots. This study employs a grid environmental modeling approach to accurately simulate medical testing laboratories. On the grid map, we utilize an 8-neighbor search method for path planning to accommodate the complex structure within the laboratory. By introducing an improved evaluation function and a bidirectional search strategy, we have successfully reduced the number of search nodes and significantly improved path search efficiency. Additionally, we eliminate redundant nodes in the path, smooth the path using cubic uniform B-spline curves, remove unnecessary inflection points, and further optimize the motion trajectory of the robot. The experimental results of the path planning simulation under different scenarios and specifications show that the improved A-star algorithm has higher search efficiency and traverses fewer nodes compared to the traditional A-star algorithm and the bidirectional A-star algorithm. Overall, the simulation experiments verify the feasibility of the improved A-star algorithm, which can better meet the needs of actual mobile robots in real medical testing laboratories.

Keywords

• A-star algorithm
• path planning
• bi-directional search
• path smoothing