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

A Shortest Path Planning Method under Gaussian Process Road Network

A technology of the shortest path and Gaussian process, which is applied to road network navigators, navigation, instruments, etc., can solve problems such as changes in driving time without consideration, and achieve high-precision results

Active Publication Date: 2021-02-26
UNIV OF ELECTRONICS SCI & TECH OF CHINA
View PDF9 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] Aiming at the above-mentioned deficiencies in the prior art, the invention provides a shortest path planning method under the Gaussian process road network to solve the problem that the travel time change is not considered in the shortest path planning

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
  • A Shortest Path Planning Method under Gaussian Process Road Network
  • A Shortest Path Planning Method under Gaussian Process Road Network
  • A Shortest Path Planning Method under Gaussian Process Road Network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0058] The specific embodiments of the present invention are described below so that those skilled in the art can understand the present invention, but it should be clear that the present invention is not limited to the scope of the specific embodiments. For those of ordinary skill in the art, as long as various changes Within the spirit and scope of the present invention defined and determined by the appended claims, these changes are obvious, and all inventions and creations using the concept of the present invention are included in the protection list.

[0059]Embodiments of the present invention will be described in detail below in conjunction with the accompanying drawings.

[0060] Such as figure 1 As shown, a Gaussian process road network shortest path planning method, including the following steps:

[0061] S1. Collect map A, set starting point r, end point s, and calculation coefficient respectively Sum counter k=0, travel from the starting point r to the ending po...

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 shortest path planning method under a Gaussian process road network. By obtaining the expected-variance or expected-standard deviation of the shortest path of each path connected to the current point, the shortest path between the current point and the end point is obtained. path, and then proceed to the next point, take the next point as the current point, and repeat the above steps several times until the current point is the end point. The present invention can quickly select the shortest path in both simple and complex traffic network environments, and simultaneously updates the shortest path in real time by continuously updating the current point and repeatedly judging the shortest path between the current point and the destination.

Description

technical field [0001] The invention belongs to the field of shortest path planning in maps, and in particular relates to a shortest path planning method under a Gaussian process road network. Background technique [0002] The shortest path algorithm refers to finding a path connecting the starting point and the ending point with the shortest travel time, distance or cost. In the field of transportation, the shortest path algorithm has a wide range of applications in problems such as vehicle travel, traffic allocation and network design. To a certain extent, the shortest path problem is the most basic component, laying the foundation for many complex and advanced traffic research. The shortest path planning problem is divided into standard shortest path problem, random shortest path problem and stable shortest path problem. The former two are widely used, but they do not take into account the variability and risk of travel time. Contents of the invention [0003] In view...

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
CPCG01C21/3446
Inventor 郭宏亮侯雪洁
Owner UNIV OF ELECTRONICS SCI & TECH OF CHINA