.png){kind=icon}
.png){kind=icon}
Return
Exact cell decomposition on base map features for optimal path finding
.png){kind=icon}
PRE
AI
DOI：10.1080/13658810600852206.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Path-finding problems have attracted widespread research interest in GIS-T. Previous research has largely been conducted on developing shortest path algorithms in GIS. The conventional approach is to adopt the arc-node network model, which allows Only users with expert knowledge to generate measurements such as optimal paths from a map. However, the generation and maintenance of a centreline network are difficult Mid tedious because these are not natural on-ground features but imaginary lines on a map. To remedy the Situation, a revolutionary approach has been suggested that path-finding method is independent of extra arc-node data creations by end-users. By using the cell-decomposition method borrowed from motion planning of a robot, general map users may obtain an optimal path by just identifying familiarized symbols/outlines from a digital topographic map without resorting to generating all extra set of centrelines.
Keywords:
optimal path
cell decomposition
digital map
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.1
Papers:
2.7K
Citations:
9.3K
Organization
No organization information available