ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
Publications Copernicus
Articles | Volume II-4
ISPRS Ann. Photogramm. Remote Sens. Spatial Inf. Sci., II-4, 65–70, 2014
ISPRS Ann. Photogramm. Remote Sens. Spatial Inf. Sci., II-4, 65–70, 2014

  23 Apr 2014

23 Apr 2014

Study of Double-Weighted Graph Model and Optimal Path Planning for Tourist Scenic Area Oriented Intelligent Tour Guide

Y. Shi1,2,3, Y. Long1,2, and X. L. Wi1,2 Y. Shi et al.
  • 1School of Geographic Science, Nanjing Normal University, Nanjing 210023, China
  • 2MOE Key Laboratory of Virtual Geographical Environment, Nanjing 210023, China
  • 3School of Information Engineering, Nanjing Normal University Taizhou College, Taizhou 225300, China

Keywords: Path Planning, Double-Weighted Graph Model, Multi-Entrances or Exits, Travel line, Tourist Routes

Abstract. When tourists visiting multiple tourist scenic spots, the travel line is usually the most effective road network according to the actual tour process, and maybe the travel line is different from planned travel line. For in the field of navigation, a proposed travel line is normally generated automatically by path planning algorithm, considering the scenic spots' positions and road networks. But when a scenic spot have a certain area and have multiple entrances or exits, the traditional described mechanism of single point coordinates is difficult to reflect these own structural features. In order to solve this problem, this paper focuses on the influence on the process of path planning caused by scenic spots' own structural features such as multiple entrances or exits, and then proposes a doubleweighted Graph Model, for the weight of both vertexes and edges of proposed Model can be selected dynamically. And then discusses the model building method, and the optimal path planning algorithm based on Dijkstra algorithm and Prim algorithm. Experimental results show that the optimal planned travel line derived from the proposed model and algorithm is more reasonable, and the travelling order and distance would be further optimized.