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

A Path Planning Method Based on Nondisplay Topological Vector Map

A technology of vector map and path planning, which is applied in the direction of measuring devices, road network navigators, navigation, etc., and can solve problems such as application difficulties

Active Publication Date: 2021-04-27
THE 28TH RES INST OF CHINA ELECTRONICS TECH GROUP CORP
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, due to the huge differences in data sources, information level protection, and charging standards, only vector map data information that does not display topological relationship types can be obtained, which brings difficulties to some applications

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 Path Planning Method Based on Nondisplay Topological Vector Map
  • A Path Planning Method Based on Nondisplay Topological Vector Map
  • A Path Planning Method Based on Nondisplay Topological Vector Map

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0044] The technical solutions of the present invention will be further described below in conjunction with the accompanying drawings and embodiments.

[0045] See figure 1 , which shows a flow chart of a method for path planning based on a non-display topology vector map according to the present invention, the method includes the following steps:

[0046] Step 1: Build the base hex grid:

[0047] Define a hexagonal grid numbering scheme, such as figure 2 As shown, the abscissa M and the ordinate N represent the column index and row index in the hexagonal grid, respectively;

[0048] According to actual data, such as: path planning range, original vector road layer data (such as Image 6 shown), the speed of the vehicle on different terrains and roads of different grades, set the size of the hexagonal grid, and establish the hexagonal grid model (such as Figure 7 shown), and build a data structure, wherein the unit of the hexagonal grid is an adjacent spliced ​​hexagonal...

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 path planning method based on a non-display topological vector map, comprising the steps of: (1) constructing a basic hexagonal grid; (2) performing terrain quantification by using DEM data and a vector map, and abstracting the original road layer is the road attribute on the hexagonal grid, and forms the topological relationship required for the calculation of the A* algorithm; (3) records the original road information associated with the edge; (4) selects the starting point and the end point of the path, and uses the A* algorithm to calculate the starting point to the The shortest path with the end point on the hexagonal grid; (5) Combining the recorded original road information and the calculated shortest path results, reversely analyze the shortest path planning results of the vector map; (6) Judge whether the shortest path needs to be adjusted, if When the shortest path is unreasonable due to reasons such as terrain quantification and irregular data, you can manually adjust the relevant data and recalculate to obtain the shortest path. The invention solves the shortest path planning problem when the user only has the non-display topological vector map.

Description

technical field [0001] The invention relates to a method for planning a route based on map data; in particular, it relates to a method for planning a route based on a non-display topology vector map. Background technique [0002] The ISO GDF4.0 model defines three topological relationships for road connectivity topology, namely Full Topology, Connectivity Topology and Non-explicit Topology. Both complete topology and connected topology establish the topological relationship between elements in the spatial data structure, and the corresponding elements are called topological elements. Topological elements are composed of basic geometric primitives such as nodes, arcs, and surfaces, which not only represent the geometric shape and position of related elements, but also express the topological information between elements. In the non-display topological relationship, the topological relationship between elements needs to be calculated or inferred by the coordinate values ​​of ...

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 THE 28TH RES INST OF CHINA ELECTRONICS TECH GROUP CORP
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