A fast shortest path method based on multi-resolution raster model

The shortest path problem based on spatial geography is a research hotspot in the intersection of GIS and path planning. In order to improve the efficiency of solving the shortest path based on high-precision terrain data, this paper proposes a fast spatial terrain shortest path based on multi-resol...

Full description

Saved in:
Bibliographic Details
Main Authors: Tang, Qiuling, Dou, Wanfeng
Format: Conference Proceeding
Language:English
Subjects:
A Algorithm
Computational modeling
Data models
Fitting
multi-resolution DEM
Parallel processing
Path planning
Road transportation
shortest path
Shortest path problem
spatial geography
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The shortest path problem based on spatial geography is a research hotspot in the intersection of GIS and path planning. In order to improve the efficiency of solving the shortest path based on high-precision terrain data, this paper proposes a fast spatial terrain shortest path based on multi-resolution DEM data. This method uses different multi-resolution DEM raster data models to represent the same terrain. First, the coarse-grained shortest path is solved on the low-resolution terrain, then the shortest path between adjacent grids is solved in parallel on the high-resolution terrain data according to the corresponding mapping mode. This method reduces the search range between grids and greatly improves the efficiency of solving the shortest path. Experimental results show that the method proposed in this paper can not only solve the optimal path on the DEM raster data structure, but also improve the efficiency of directly solving the shortest path on a large-scale high-resolution terrain.
ISSN:2473-3636
DOI:10.1109/DCABES50732.2020.00074