Unlock instant, AI-driven research and patent intelligence for your innovation.

Path planning method, device, electronic device and storage medium

A path planning and path technology, which is applied in the computer field and can solve problems such as inability to perform path planning.

Active Publication Date: 2020-07-17
BEIJING SANKUAI ONLINE TECH CO LTD
View PDF7 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] This application provides a path planning method, which helps to solve the problem that path planning cannot be performed when real-time traffic data cannot be obtained in complex application scenarios with multiple destinations or multiple passing points

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Path planning method, device, electronic device and storage medium
  • Path planning method, device, electronic device and storage medium
  • Path planning method, device, electronic device and storage medium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0027] A path planning method disclosed in this embodiment, such as figure 1 As shown, the method includes: step 110 to step 140.

[0028] Step 110: Map the designated departure point, destination point, and transit point into network nodes, and construct a global path network by connecting paths formed by connecting each of the network nodes in pairs.

[0029] Wherein, the departure point and the destination point are not directly connected.

[0030] During specific implementation, the specified starting point, destination point, and passing point, as well as other points on the electronic map, are mapped to network nodes, and then a global path network is constructed by connecting each of the network nodes in pairs. For example, firstly, map the specified starting point, destination point, passing point, and other points on the electronic map as network nodes; then, determine several routes according to the historical traffic data, and determine the edges connecting each no...

Embodiment 2

[0041] A path planning method disclosed in this embodiment, such as Figure 4 As shown, the method includes: Step 410 to Step 460.

[0042] Step 410, determine the information of several routes according to the historical traffic data as training samples.

[0043] Step 420, train a machine learning model for predicting time-consuming paths based on a regression algorithm.

[0044] In some embodiments of the present application, before predicting the time-consuming corresponding to the K paths with the shortest distance according to the path planning scene characteristics and the network characteristics, it also includes: determining the time-consuming of several paths according to the historical traffic data Information, as a training sample; wherein, the features of each of the training samples include at least one of the following: the network features of the corresponding path and the path planning scene features, and the label of the training sample is the shortest time-c...

Embodiment 3

[0070] A path planning device disclosed in this embodiment, such as Figure 5 As shown, the device includes:

[0071] The global path network construction module 510 is used to map the designated departure point, destination point and passing point into network nodes, so as to construct a global path network by connecting the paths formed by connecting each of the network nodes in pairs, wherein the departure point is not directly connected to said destination point;

[0072] The node-to-path and time-consuming determination module 520 is configured to determine the time-consuming corresponding to the path between any two network nodes according to the characteristics of the path planning scene and the network characteristics of the global path network;

[0073] A network weighting module 530, configured to select the path corresponding to the shortest time-consuming in the global path network as an edge between the corresponding two network nodes, and use the shortest time-c...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a path planning method, belongs to the technical field of computers, and solves the problem in the prior art that path planning depends on traffic data. The path planning method disclosed by the invention comprises the following steps that: mapping an appointed place of departure, a place of destination and passing places as network nodes, and constructing a global path network by paths formed by the pairwise connecting of network nodes; according to path planning scene characteristics and the network characteristics of the global path network, determining time consumption corresponding to a path between any two network nodes; selecting the path corresponding to the smallest time consumption in the global path network as an edge between two corresponding network nodes, and taking the smallest time consumption as the weight of the edge; and according to the global path network provided with the weight of the edge, carrying out shortest time consumption path planning. By use of the method disclosed by the invention, the global path network and the path planning scene characteristics are combined to carry out path planning without depending one real-time traffic data.

Description

technical field [0001] The present application relates to the field of computer technology, in particular to a path planning method, device, electronic equipment and storage medium. Background technique [0002] The real-time response performance requirements for path planning in Internet maps are getting higher and higher. The path planning in the prior art is usually the shortest time or shortest distance path planning for a single destination. There is little research on path planning with multiple destinations or limited waypoints. With the rapid development of carpooling or outsourcing business, there are more and more demands for multi-destination route planning, and the existing route planning methods for different destinations cannot meet the multi-destination route planning needs. Someone proposed a solution to multi-destination route planning, using the multi-source real-time traffic data of the traffic network as the basis for route planning data to predict the ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G01C21/34
Inventor 宋耀波王博朱丽颖闫亚军闫文静张蜀男刘欢李乙娜李妍王园鹏
Owner BEIJING SANKUAI ONLINE TECH CO LTD