Obstacle-avoiding shortest path derivation in a multicore computing environment

Insu Hong, Alan T. Murray, Sergio Rey

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The best obstacle avoiding path in continuous space, referred to as the Euclidean shortest path, is important for spatial analysis, location modeling and wayfinding tasks. This problem has received much attention in the literature given its practical application, and several solution techniques have been proposed. However, existing approaches are limited in their ability to support real time analysis in big data environments. In this research a multicore computing approach is developed that exploits spatial knowledge through the use of geographic information system functionality to efficiently construct an optimal shortest path. The approach utilizes the notion of a convex hull for iteratively evaluating obstacles and constructing pathways. Further, the approach is capable of incrementally improving bounds, made possible through parallel processing. Wayfinding routes that avoid buildings and other obstacles to travel are derived and discussed.

Original languageEnglish (US)
Pages (from-to)1-10
Number of pages10
JournalComputers, Environment and Urban Systems
Volume55
DOIs
StatePublished - Jan 1 2016

Fingerprint

functionality
building
information system
travel
ability
hull
spatial analysis
modeling
literature
time
geographic information system
analysis

Keywords

  • Convex hull
  • Euclidean shortest path
  • GIS
  • High performance computing
  • Parallelization
  • Vector overlay

ASJC Scopus subject areas

  • Ecological Modeling
  • Environmental Science(all)
  • Geography, Planning and Development
  • Urban Studies

Cite this

Obstacle-avoiding shortest path derivation in a multicore computing environment. / Hong, Insu; Murray, Alan T.; Rey, Sergio.

In: Computers, Environment and Urban Systems, Vol. 55, 01.01.2016, p. 1-10.

Research output: Contribution to journalArticle

@article{fa468e67e6994be482d6de964e924140,
title = "Obstacle-avoiding shortest path derivation in a multicore computing environment",
abstract = "The best obstacle avoiding path in continuous space, referred to as the Euclidean shortest path, is important for spatial analysis, location modeling and wayfinding tasks. This problem has received much attention in the literature given its practical application, and several solution techniques have been proposed. However, existing approaches are limited in their ability to support real time analysis in big data environments. In this research a multicore computing approach is developed that exploits spatial knowledge through the use of geographic information system functionality to efficiently construct an optimal shortest path. The approach utilizes the notion of a convex hull for iteratively evaluating obstacles and constructing pathways. Further, the approach is capable of incrementally improving bounds, made possible through parallel processing. Wayfinding routes that avoid buildings and other obstacles to travel are derived and discussed.",
keywords = "Convex hull, Euclidean shortest path, GIS, High performance computing, Parallelization, Vector overlay",
author = "Insu Hong and Murray, {Alan T.} and Sergio Rey",
year = "2016",
month = "1",
day = "1",
doi = "10.1016/j.compenvurbsys.2015.10.001",
language = "English (US)",
volume = "55",
pages = "1--10",
journal = "Computers, Environment and Urban Systems",
issn = "0198-9715",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Obstacle-avoiding shortest path derivation in a multicore computing environment

AU - Hong, Insu

AU - Murray, Alan T.

AU - Rey, Sergio

PY - 2016/1/1

Y1 - 2016/1/1

N2 - The best obstacle avoiding path in continuous space, referred to as the Euclidean shortest path, is important for spatial analysis, location modeling and wayfinding tasks. This problem has received much attention in the literature given its practical application, and several solution techniques have been proposed. However, existing approaches are limited in their ability to support real time analysis in big data environments. In this research a multicore computing approach is developed that exploits spatial knowledge through the use of geographic information system functionality to efficiently construct an optimal shortest path. The approach utilizes the notion of a convex hull for iteratively evaluating obstacles and constructing pathways. Further, the approach is capable of incrementally improving bounds, made possible through parallel processing. Wayfinding routes that avoid buildings and other obstacles to travel are derived and discussed.

AB - The best obstacle avoiding path in continuous space, referred to as the Euclidean shortest path, is important for spatial analysis, location modeling and wayfinding tasks. This problem has received much attention in the literature given its practical application, and several solution techniques have been proposed. However, existing approaches are limited in their ability to support real time analysis in big data environments. In this research a multicore computing approach is developed that exploits spatial knowledge through the use of geographic information system functionality to efficiently construct an optimal shortest path. The approach utilizes the notion of a convex hull for iteratively evaluating obstacles and constructing pathways. Further, the approach is capable of incrementally improving bounds, made possible through parallel processing. Wayfinding routes that avoid buildings and other obstacles to travel are derived and discussed.

KW - Convex hull

KW - Euclidean shortest path

KW - GIS

KW - High performance computing

KW - Parallelization

KW - Vector overlay

UR - http://www.scopus.com/inward/record.url?scp=84944447198&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84944447198&partnerID=8YFLogxK

U2 - 10.1016/j.compenvurbsys.2015.10.001

DO - 10.1016/j.compenvurbsys.2015.10.001

M3 - Article

VL - 55

SP - 1

EP - 10

JO - Computers, Environment and Urban Systems

JF - Computers, Environment and Urban Systems

SN - 0198-9715

ER -