Finding the shortest path under polygonal obstacle constraints

DOI

10.2991/icmmita-16.2016.204How to use a DOI?

Keywords

Location-based Services; Shortest Path; Polygonal Constraints.

Abstract

This paper discusses the problem of road network navigation under polygonal obstacle constraints from an implementation perspective. It implements the problem provided by the 4th ACM SIGSPATIAL GIS Cup 2015 challenge. In the context, it briefly examines some fundamental graph search algorithms and then primarily demonstrates the notes on the implementation of A* algorithm on the dataset of San Francisco from OpenStreetMap.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xu Yan
AU  - Dawei Liu
PY  - 2017/01
DA  - 2017/01
TI  - Finding the shortest path under polygonal obstacle constraints
BT  - Proceedings of the 2016 4th International Conference on Machinery, Materials and Information Technology Applications
PB  - Atlantis Press
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmmita-16.2016.204
DO  - 10.2991/icmmita-16.2016.204
ID  - Yan2017/01
ER  -