A method and system for internal road path planning

A path planning and road technology, applied to road network navigators, instruments, navigation, etc., to achieve a reasonable effect of path planning

Active Publication Date: 2022-02-08
HUAQING KESHENG BEIJING INFORMATION TECH CO LTD
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This calculation method cannot be adapted to problems with traffic rule constraints

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 method and system for internal road path planning
  • A method and system for internal road path planning
  • A method and system for internal road path planning

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0060] After discovering the above problems, the inventors of the present application conducted careful research on the existing route planning based on the Dijkstra algorithm and internal road characteristics. The study found that internal roads have different characteristics than public roads. At the same time, the Dijkstra algorithm adopts a greedy strategy, declaring an array dis to save the shortest distance from the source point to each vertex and a collection of vertices that have found the shortest path: T. Initially, the path weight of the origin s is assigned 0 (dis[s]=0); if there is a directly reachable edge (s, m) for the vertex s, then set dis[m] to w (s, m ), while setting the path lengths of all other vertices (not directly reachable by s) to infinity. Initially, the set T only has vertex s; then, select the minimum value from the dis array, then this value is the shortest path from the source point s to the vertex corresponding to this value, and add this poi...

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 provides a method and system for planning an internal road path, belonging to the field of traffic planning. The path planning method first constructs a road network according to internal road conditions, and adds the starting point and ending point of the current vehicle to the road network, constructs a path information set S, and adds the starting point of the vehicle to S; then takes all relevant road sections between the starting point and the ending point of the current vehicle , construct U and add all the edges corresponding to the relevant road sections and all nodes associated with the relevant road sections to U; take the newly added point in S as the key point, and mark all the candidate edges that can reach any point in U from the key point, And obtain the road condition information and road attribute information corresponding to the candidate edge; calculate the weight of the road section according to the road condition information and road attribute information, select the edge corresponding to the minimum weight value and the corresponding node to add to S; when S contains both the starting point and the ending point of the vehicle, output the plan path. The present invention simultaneously considers real-time traffic conditions and traffic rule constraints, avoids traffic jams as much as possible, and improves traffic transportation efficiency.

Description

technical field [0001] The invention belongs to the field of internal traffic in a region, and in particular relates to a method and system for planning an internal road path. Background technique [0002] Traffic is an important link that affects people's travel. Through the analysis of road conditions, better route planning can be carried out to achieve the maximum efficiency of road traffic. For a single area, such as a trade area, a factory, etc., its internal road conditions have different characteristics compared with public transportation, and the path planning method based on public roads cannot be applied to internal roads. [0003] In the prior art, the shortest path algorithm is usually used for path planning, which is suitable for static networks. It is often used to calculate the shortest path from one node to all other nodes. The specific algorithm is: take the starting point as the center and expand to the outer layer until it reaches till the end. This calc...

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/20G01C21/34
CPCG01C21/20G01C21/3407
Inventor 李磊王培重
Owner HUAQING KESHENG BEIJING INFORMATION TECH CO LTD
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