Efficient wayfinding in complex environments: derivation of a continuous space shortest path

Authors:
Insu Hong;Alan T. Murray
Affiliations:
GeoDa Center for Geospatial Analysis and Computation, School of Geographical Science and Urban Planning, Arizona State University P.O. Box 875302, Tempe AZ 85287-5302 +1-480-965-7533;GeoDa Center for Geospatial Analysis and Computation, School of Geographical Science and Urban Planning, Arizona State University P.O. Box 875302, Tempe AZ 85287-5302 +1-480-965-7533
Venue:
Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
Year:
2013

Citing 10
Cited 0

Visibility of disjoint polygons

Algorithmica
Shortest paths in the plane with convex polygonal obstacles

Information Processing Letters
Optimal shortest path queries in a simple polygon

Journal of Computer and System Sciences
An output-sensitive algorithm for computing visibility

SIAM Journal on Computing
Minimal tangent visibility graphs

Computational Geometry: Theory and Applications
An algorithm for planning collision-free paths among polyhedral obstacles

Communications of the ACM
Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract)

ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Robot-assisted wayfinding for the visually impaired in structured indoor environments

Autonomous Robots
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications
Efficient measurement of continuous space shortest distance around barriers

International Journal of Geographical Information Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses the problem of wayfinding in complex environments. Movement is complicated in many ways, including the existence of obstacles that impede travel across continuous space. To support route planning and navigation for the blind, shipping, robotics, etc., methods have been developed to identify the shortest or most efficient path. This paper details a GIS based method for finding an optimal path for this problem. The developed approach offers substantial computational advances over existing approaches, making it appealing for real time travel support. Application results are presented to demonstrate the effectiveness of the approach.