Path planning method and device, electronic equipment and storage medium

Abstract

The invention relates to the technical field of computers, in particular to the field of maps and traffic, and provides a path planning method and device, electronic equipment and a storage medium, which are used for improving the path planning efficiency. The method comprises the following steps: acquiring target node information corresponding to a target travel of a to-be-planned object and candidate node information corresponding to at least one candidate travel; obtaining a main three-dimensional path corresponding to the target travel according to the target node information; according to the candidate node information, obtaining a sub-three-dimensional path corresponding to each candidate travel; each three-dimensional path represents a driving path of the object after the road network and the time axis are combined; and generating a corresponding path three-dimensional space according to the main three-dimensional path and the stroke constraint range, and taking a candidate stroke corresponding to the sub-three-dimensional path in the path three-dimensional space as a related stroke of the target stroke. According to the method, the vehicle path problem is converted into the space geometry problem, the sub-three-dimensional paths meeting the conditions can be rapidly determined, and the path planning efficiency is improved.

Description

technical field [0001] The present application relates to the field of computer technology, in particular to the fields of maps and traffic, and provides a route planning method, device, electronic equipment and storage medium. Background technique [0002] For a path with a defined start point and end point, there will be multiple alternative sub-route problems in the passing area, so reasonable path planning is required. This type of problem can be summarized as Vehicle Routing Problem (VRP). [0003] Vehicle Routing Problem with Time Windows (VRPTW) refers to: several vehicles used for service start from the station, for all objects in different geographical locations, with different cargo requirements and different service time window requirements Served, then returned to the site, where each object was served only once. Its goal is to minimize the sum of the vehicle's travel time and waiting time when providing services to objects within the time window. [0004] In t...

AI Technical Summary

Problems solved by technology

Among them, the optimization method takes a long time to solve, the method is inefficient and not suitable for solving large-scale problems, so it is limited in practical application; and the heuristic method also has uncertainty and low efficiency in the optimization process.

Images