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

Vector map preprocessing method for hop point search shortest path algorithm

A shortest path algorithm, vector map technology, applied in the field of map search

Active Publication Date: 2020-04-07
ANHUI YUNSEN INTERNET OF THINGS TECH
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Open map areas are usually vector maps to ensure accuracy and map data size, and the above algorithm can only search for the shortest path for grid maps

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
  • Vector map preprocessing method for hop point search shortest path algorithm
  • Vector map preprocessing method for hop point search shortest path algorithm
  • Vector map preprocessing method for hop point search shortest path algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0026] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.

[0027] Such as figure 1 As shown, a vector map preprocessing method for jump point search shortest path algorithm, including the following steps:

[0028] S1: Select the accuracy required by the application, convert the vector map within a certain range into an M*N grid map, define each grid as a basic unit e0, and the basic unit e0 stores the grid with or without obstacles information;

[0029] S2: Traverse the grid map of M*N, synthesize every k*k basic unit e...

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 vector map preprocessing method for a op point search shortest path algorithm, which belongs to the technical field of map search, and comprises the following steps of: S1, selecting precision required by an application, converting a vector map in a certain range into an M * N grid map, and defining each grid as a basic unit e0; s2, traversing the M * N grid map, synthesizing each k * k basic units e0 into a unit e1, obtaining a first layer of compressed map, and processing the basic units e1 of the first layer of compressed map according to a rule; s3, traversing thefirst layer of compressed map, synthesizing each k * k basic units e1 into a unit e2, obtaining a second layer of compressed map, and processing the basic units e2 of the second layer of compressed map according to a rule; and S4, repeating the step S3 until the basic units of the compressed map of the upper layer are synthesized into a new unit until the maximum number of layers meeting the requirements is reached. According to the scheme, grids needing to be traversed by the algorithm for searching the shortest path by the jump point are reduced, and the algorithm execution efficiency is high.

Description

technical field [0001] The invention relates to the technical field of map search, and more specifically, to a vector map preprocessing method used for a jump-point search shortest path algorithm. Background technique [0002] The shortest path problem is a classical algorithm problem, which aims to find the shortest path between two nodes based on a grid map (each grid stores information about whether there are obstacles or not). For example, classic algorithms such as Dijkstra, A*, and jump point search algorithms are used to solve such problems. Among them, JPS has been proven to be the fastest pathfinding algorithm based on unweighted grids and without preprocessing. At present, this method has been widely used in many path-finding fields such as game development and road network shortest path planning. [0003] According to the paper discussion (Harabor, D., and Grastien, Al. 2011. Online graph pruning for pathfinding on grid maps. In AAAI.) in jump_point_search (refe...

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): G06F16/29G06F16/56
CPCG06F16/29G06F16/56
Inventor 程腾万森陈小奇
Owner ANHUI YUNSEN INTERNET OF THINGS TECH