Finding the shortest path under polygonal obstacle constraints

被引：0

作者：

Yan, Xu ^{[1
]}

Liu, Dawei ^{[1
]}

机构：

[1] Xian Jiaotong Liverpool Univ, Suzhou, Peoples R China

来源：

Proceedings of the 2016 4th International Conference on Machinery, Materials and Information Technology Applications | 2016年 / 71卷

关键词：

Location-based Services; Shortest Path; Polygonal Constraints;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：1112 / 1115

页数：4