A Path Planning Method for Ramp Merging via Potential Field-augmented A^* with Line-of-sight Checking

Ramp merging areas, as critical nodes for intelligent vehicle traffic, are characterized by high dynamic interaction and strong uncertainty, making it difficult for traditional path planning algorithms to balance safety, real-time performance, and smoothness in such complex scenarios. To address these challenges, a path planning algorithm is proposed integrating an improved artificial potential field and line-of-sight A^*. Firstly, a piecewise potential field model comprising guidance, obstacle avoidance, and boundary constraints is constructed. A dynamic weight adjustment mechanism is also introduced to adapt to the kinematic requirements of vehicles at different merging stages, efficiently resolving the unreachable target problem of traditional potential field methods.Secondly, a physical line-of-sight check mechanism incorporating safety thresholds is embedded into the A^* algorithm. By utilizing a non-axial connection strategy to prune redundant nodes, the node expansion direction is optimized to enhance search efficiency. Finally, the improved potential field is mapped as the heuristic cost function of the A^* algorithm, achieving a deep coupling of global path planning and local risk perception. Simulation results demonstrate that, compared with traditional A^*, the Rapidly-exploring Random Tree Star (RRT^*) algorithm, and existing analogous fusion schemes, the runtime of the proposed algorithm is reduced by 70.8%, the minimum obstacle avoidance distance is increased by 106.6%, and lateral jerk is decreased to 0.62 m/s³. The proposed algorithm effectively enhances the safety and stability of trajectory planning, demonstrating its efficiency and robustness in complex merging scenarios.