The present application relates to the technical field of three-dimensional
mobile robot path automatic planning, and particularly relates to a
robot three-dimensional global path
planning method based on
sunlight irradiation principle, comprising the following steps: dividing a search space into an obstacle region and a free region, determining a
directed graph set and a dynamic update dataset of
robot path nodes; setting a
heuristic function to select a
sunlight point from the dataset; using a circular conical tangent point
search function to determine an obstacle edge path tangent point; using a grid restriction sampling mechanism to screen the path tangent point; repeating the above steps until a preset maximum number of sampling nodes is reached, generating several feasible paths; selecting the feasible path with the minimum
path length for backend optimization
processing, and outputting an optimal feasible path. The present application quickly searches for an obstacle edge tangent point to construct a feasible path by simulating the
sunlight irradiation principle, screens nodes in combination with a grid restriction sampling mechanism, improves the
algorithm convergence speed, and realizes rapid and smooth planning of the shortest path in a three-dimensional space.