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

Dijkstra optimal traffic path planning method and system based on impedance matching

An optimal path and impedance matching technology, applied to road network navigators, measuring devices, instruments, etc., can solve the problem of the shortest path lacking practical value and meaning, so as to reduce travel energy consumption and time consumption, and reduce traffic travel costs Effect

Inactive Publication Date: 2017-02-15
哈尔滨航天恒星数据系统科技有限公司
View PDF0 Cites 20 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] In view of this, the embodiment of the present invention provides a Dijkstra optimal traffic route planning method and system based on impedance matching, which is used to solve the technical problem that the shortest path obtained by the traditional Dijkstra algorithm lacks practical value and meaning

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
  • Dijkstra optimal traffic path planning method and system based on impedance matching
  • Dijkstra optimal traffic path planning method and system based on impedance matching
  • Dijkstra optimal traffic path planning method and system based on impedance matching

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0057] figure 1 It is a flow chart of the Dijkstra optimal traffic route planning method based on impedance matching in the present invention, refer to figure 1 , the invention discloses a Dijkstra optimal traffic route planning method based on impedance matching, including:

[0058] S1: obtain the set of all directed arc segments in the preset range;

[0059] S2: Obtain the time spent on all directed arcs by integrating the Dijkstra optimal path algorithm of traffic impedance;

[0060] S3: Take the directed arc set that takes the shortest time from the source point to the destination as the final result output, that is, the optimal path set.

[0061] By adopting the above-mentioned technical scheme, the present invention can at least obtain the following technical effects: in the present invention, since the factor of traffic impedance is considered in the process of seeking the optimal path, it is avoided that the optimal path obtained by the traditional Dijkstra algorithm...

Embodiment 2

[0105] figure 2 It is a schematic diagram of a Dijkstra optimal traffic route planning system based on impedance matching in the present invention. The system of the present invention is applicable to the optimal traffic route planning method disclosed in the present invention. Refer to figure 2 It can be seen that the system includes:

[0106] Directed arc obtaining module 10, used to obtain the collection of all directed arcs within the preset range;

[0107] The time cost calculation module 20 is coupled to the directed arc segment obtaining module 10, and is used to calculate the time spent on obtaining all directed arc segments through the Dijkstra optimal path algorithm of fusion traffic impedance;

[0108] The final result output module 30, coupled to the time cost calculation module 30, is used to output the optimal path set, which is selected from the directed arc segment set with the shortest time cost from the source point to the destination point.

[0109] By a...

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 Dijkstra optimal traffic path planning method and system based on impedance matching. The method comprises the following steps: obtaining sets of all directed segmental arcs within a preset scope; acquiring a time cost of all directed segmental arcs by a Dijkstra optimal path algorithm blended with traffic impedance; and taking a set of directed segmental arcs which has a shortest time cost from an original point to a terminal point as a final result, namely an optimal path set, to output. The invention can solve the technical problem that the shortest path obtained through a conventional Dijkstra algorithm lacks practical values and meanings.

Description

technical field [0001] The invention belongs to the technical field of Dijkstra optimization algorithms, in particular to a Dijkstra optimal traffic path planning method and system based on impedance matching. Background technique [0002] When the traditional Dijkstra algorithm is used in a huge traffic network, the amount of calculation is huge, the time complexity is huge, and the search efficiency is very low. For the intricate traffic network, the shortest path calculated by Dijkstra algorithm may not be the optimal path. Due to road quality, congestion, etc., there is a certain traffic resistance on the traffic road, which leads to the shortest path obtained by the algorithm lacks practical value and Significance; How to develop a method and system that can solve the above problems has become an urgent problem for those skilled in the art. Contents of the invention [0003] In view of this, the embodiment of the present invention provides a Dijkstra optimal traffic ...

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): G01C21/34
CPCG01C21/3492
Inventor 于雷葛宝玉褚鹏飞王彦贺王兆祥赵希奇丛恩泽
Owner 哈尔滨航天恒星数据系统科技有限公司
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com