Method for route optimization based on dynamic window and redundant node filtering

The present disclosure discloses a method for route optimization based on dynamic window and redundant node filtering, comprising using an existing raster map data set to determine the coordinate information of a starting position and a destination position of movement, and to mark a destination node and an obstacle node in the raster map; using A* algorithm to plan a global route; globally optimizing the global route planned by A* algorithm, and filtering redundant nodes out; combining a dynamic window algorithm to perform the local optimization section by section on the optimized global route so as to obtain a final global route. According to the present disclosure, the combination of algorithms reduces a single movement duration of a mobile robot and improves the smoothness of the movement route curve. At the same time, the problems of the robot occurring on the route during the static driving are alleviated.