Path planning method for multi-type service requirements in urban environment
A technology for urban environment and route planning, applied in data processing applications, forecasting, instruments, etc., can solve the problems of single function of route planning and inability to select way points by category
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0035] The present invention will be further explained below in conjunction with the accompanying drawings and specific embodiments.
[0036] The object of the present invention is to solve the problem of route planning for multi-type service demands in an urban environment. This method divides the urban area according to the grid in advance, connects each area according to the relationship of the path, and models it into a graph. In this way, the path planning problem can be regarded as: given the starting point, the end point, and the path finding problem on the graph that must pass through certain types of points. The path planning solution is divided into two stages: one is the reverse marking of POI demand priority, and the other is the forward search based on the dynamic boundary. Through two positive and negative searches, quickly find a path that can meet the user's needs. The specific execution steps are as follows:
[0037] Step 1. Model the city as a grid graph G...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


