This invention provides a path
planning method belonging to the field of
robot path planning, comprising: constructing a non-uniform dynamic partitioning strategy based on the obstacle distribution density within the
workspace, prioritizing the selection of key areas that the path may
traverse, and reducing the generation of redundant nodes and edges; constructing a weighted sampling strategy based on the comprehensive distance between sampling points and obstacles, increasing the sampling density of obstacle boundaries and narrow passage areas, and reducing invalid sampling in
free space; constructing an adaptive variable step-size connection strategy based on the regional obstacle distribution characteristics, dynamically adjusting the node connection step size to enhance the
connectivity of the
route graph and reduce redundant edges; and performing path querying using a graph
search algorithm based on the constructed probabilistic
route graph, and performing cubic spline interpolation
smoothing on the generated original path to obtain a smooth final path. This method is applicable to path planning in two-dimensional and three-dimensional spaces and for multi-degree-of-freedom robotic arms, and can effectively shorten
path length and reduce planning time.