Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Fast shortest-path planning method based on road chains

A shortest path and path planning technology, applied in the shortest path planning, walking navigation, and vehicle fields, can solve the problems of multiple turns in the travel path, many data units processed by the algorithm, and no consideration, so as to reduce the number of turns and data unit, the effect of maintaining the whole

Active Publication Date: 2017-01-11
西安电子科技大学工程技术研究院有限公司
View PDF5 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The disadvantage of this is that, firstly, the path planning algorithm needs to process more data units, and secondly, the planned travel path is composed of road sections, resulting in many turns in the travel path, which does not conform to people's travel planning experience
The disadvantages of this method are: firstly, this scheme is only an index for converting road links into road sections, which is used to reflect the importance of road sections. The topological network relationship based on "node-road section" will artificially divide each natural road into several road sections, which will lead to more data units processed by the algorithm. Secondly, this method uses Dijkstra algorithm for path planning, and does not use time complexity. Lower A* Algorithm
However, there are too many elements in the open table, and it takes a long time to maintain the open table at a time, which makes the overall path planning take a long time

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
  • Fast shortest-path planning method based on road chains
  • Fast shortest-path planning method based on road chains

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0032] The present invention will be further described below in conjunction with the accompanying drawings.

[0033] refer to figure 1 , in the scene schematic diagram of the specific embodiment of the present invention, its road network is composed of 18 nodes, that is, nodes n1 to n18, wherein the distance between any pair of adjacent nodes is 1, the initial node of path planning is node n1, and the path The planned target node is node n18.

[0034] refer to figure 2 , the implementation process of the present invention is as follows:

[0035] Step 1, generate a node topology table.

[0036] A node topology table K is generated according to the road network, and the node topology table K includes the adjacent nodes of the node and the length of the arc between the node and the adjacent nodes.

[0037] Step 2, create a link topology table.

[0038] Create a link topology table U to save the topological relationship of the link. The link topology table U includes the adj...

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 fast shortest-path planning method based on road chains and aims to improve problems that the list open in an existing A* algorithm contains many nodes, the A* algorithm is time-consuming and a planned path has many turns. The fast shortest-path planning method includes the steps of firstly, generating a node topology table K according to a city road network; secondly, generating a road chain topology table U according to the node topology table K; thirdly, creating a list open and a list closed; initiating the list open, maintaining the list open and the list closed according to the road chain topology table U, and marking out the shortest traveling path. The fast shortest-path planning method has the advantages that data units which need to be processed in path planning are reduced, path planning time is reduced, road integrity and visual consistency are kept, turns in the output path are reduced, and the method is applicable to vehicle or walking navigation.

Description

technical field [0001] The invention belongs to the technical field of road networks, and in particular relates to a shortest path planning method, which can be used for vehicle and pedestrian navigation. Background technique [0002] To analyze the shortest path of an urban road network, it is first necessary to abstract the actual urban road network entity into a network in network graph theory. The existing technology is usually based on the "node-segment" topological data model to realize the interaction between the two. Mapping, each natural road is artificially divided into several road sections. The disadvantage of this is that, firstly, the path planning algorithm needs to process more data units, and secondly, the planned travel path is composed of road sections, resulting in many turns in the travel path, which does not conform to people's travel planning experience. [0003] Liu Kang and others proposed a method of applying road links to route planning in their ...

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 Applications(China)
IPC IPC(8): G01C21/34
CPCG01C21/3446
Inventor 付少忠宋一博李晓炎孙彦梅高明葛建华漆维正刘肖莹
Owner 西安电子科技大学工程技术研究院有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

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