Journal article
Assessing Raster GIS Approximation for Euclidean Shortest Path Routing
Transactions in GIS, v 20(4), pp 570-584
01 Aug 2016
Abstract
Identifying a route that avoids obstacles in continuous space is important for infrastructure alignment, robotic travel, and virtual object path planning, among others, because movement through space is not restricted to a predefined road or other network. Vector and raster GIS (geographic information system) solution approaches have been developed to find good/efficient routes. On the vector side, recent solution approaches exploit spatial knowledge and utilize GIS functionality, offering significant computational advantages in finding an optimal solution to this path routing problem. Raster-based shortest path techniques are widely applied in route planning for wayfinding, corridor alignment, robotics and video gaming to derive an obstacle avoiding path, but represent an approximation approach for solving this problem. This research compares vector and raster approaches for identifying obstacle-avoiding shortest paths/routes. Empirical assessment is carried out for a number of planning applications, highlighting representational issues, computational requirements and resulting path efficiency.
Metrics
Details
- Title
- Assessing Raster GIS Approximation for Euclidean Shortest Path Routing
- Creators
- Insu Hong - West Virginia UniversityAlan T. Murray - Drexel University
- Publication Details
- Transactions in GIS, v 20(4), pp 570-584
- Publisher
- Wiley
- Number of pages
- 15
- Resource Type
- Journal article
- Language
- English
- Web of Science ID
- WOS:000385267500005
- Scopus ID
- 2-s2.0-84945406862
- Other Identifier
- 991019357764304721
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Collaboration types
- Domestic collaboration
- Web of Science research areas
- Geography