Dynamic path planning method based on traffic prediction

A dynamic routing and planning technology, applied in traffic flow detection, forecasting, traffic control systems, etc., can solve the problem that the algorithm time is difficult to meet the actual operation, and achieve the effect of the shortest travel time

Active Publication Date: 2019-07-12
SHANGHAI JIAO TONG UNIV
View PDF6 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

When the graph representation method is used, whether it is an adjacency matrix or an adjacency list, a large amount of memory must be allocated for storage. In addition, this method is prepare

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
  • Dynamic path planning method based on traffic prediction
  • Dynamic path planning method based on traffic prediction
  • Dynamic path planning method based on traffic prediction

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0046] Embodiments of the present invention will be described in detail below in conjunction with the accompanying drawings, and the scope of protection of the present invention is not limited to the following embodiments.

[0047] The road network in this embodiment is the ground road network in Shanghai, which includes 1546 intersections and 30357 road sections. Divide the road network into 60*60 grids of equal size, numbered 1, 2, ..., 3600 from left to right and from top to bottom. The known information includes:

[0048] 1) Vehicle departure grid s, destination grid d, departure time T, s, d are grid numbers;

[0049] 2) The length of the longest road section in the grid l i ,i=1,...,3600, i represents the grid number;

[0050] 3) grid velocity {v it},t=1,2,...,144, where t represents the time of day, every 10 minutes from 00:00, that is, the time represented by t=1 is 00:00, and the time represented by t=2 The time is 00:10, and so on, the time represented by t=144 i...

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 dynamic path planning method based on traffic prediction, whichcomprises the steps ofnetwork model abstraction, network stacking, and spatiotemporal rolling algorithm;the network model abstraction is conducted, specifically, a real road is transformed into a network diagram structure of nodes and weights, and the network model abstractionis divided into an upper layer network model abstraction and a lower layer network model abstraction, and the weight setting comprehensively considers the traffic flow density and the path length; the network stacking is conducted, specifically, real-time traffic information is integrated with predicted traffic information of multiple step lengths to obtain a final network model;and the spatiotemporal rolling algorithm comprises atime rolling process and a space rolling process, the traffic state is refreshed according to a certain time interval, and dynamic planning is realized. According to the dynamic path planning methodbased on traffic prediction,it can be ensured thatthe increase of the travel path is within a certain range in the case of relatively congested traffic, and the travel time is greatly shortened.

Description

technical field [0001] The invention belongs to the field of optimal path problems, specifically a dynamic path planning algorithm that comprehensively considers real-time traffic information, forecast traffic information and road length. Background technique [0002] The shortest path problem is a classic problem in graph theory, and it is also a research hotspot in the fields of geographic information science. It has a wide range of applications in the fields of transportation planning, transportation and logistics management. The actual network entity (mainly referring to the actual road network in this invention) needs to be abstracted into a network graph concept in graph theory according to its characteristics, that is, to establish a network model. After the network model is established, various network analysis methods in graph theory can be used to discuss and study it. [0003] The following introduces the relevant background technology of the optimal path problem...

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
IPC IPC(8): G08G1/01G06Q10/04H04L12/24
CPCG06Q10/047G08G1/0104G08G1/0133H04L41/145
Inventor 李德伟喻想想席裕庚
Owner SHANGHAI JIAO TONG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap