Spatial convex polyhedron outer surface polishing path planning method and storage medium

According to the spatial convex polyhedron outer surface polishing path planning method and the storage medium, based on an obtained working plane set, and for each working plane, a to-be-polished surface set on the working plane can be directly obtained, and the method comprises the steps that S1, to-be-polished working planes are determined and sorted; s2, sorting a plurality of to-be-polished surfaces in a single working plane; s3, establishing a waypoint queue; and S4, calculating consumed time to obtain a local optimal solution. According to the spatial convex polyhedron outer surface polishing path planning method, spatial three-dimensional outer surface path planning is carried out based on a spatial coordinate set of three types of obtained and classified polishing elements and known affiliation relations of topological nodes. According to the method, automatic path planning can be achieved, automation is guaranteed, meanwhile, influences of the working stroke and the idle stroke are considered, a rel