Indoor optimal path planning based on Dijkstra Algorithm
- DOI
- 10.2991/meita-15.2015.57How to use a DOI?
- Keywords
- pedestrian guidance, Dijkstra algorithm, path smoothing, user preferences
- Abstract
Providing optimal path information and the personal navigation path is the open issue for the pedestrian guided system. In order to solve the problems existing in the pedestrian guided system nowadays, such as the jagged paths which probable exist in the shortest path, and the lack of the considerations of different users' preferences, this paper firstly proposed a shortest path planning scheme for pedestrian, which is based on Dijkstra algorithm. Then some measures have been done which can be used to smooth the jagged paths on the basis of shortest path. At last, considering the users' preferences generated by collecting and analyzing users' behavioral information, we optimize the paths in advance. Above all, this paper mainly comes up with an indoor personalized pedestrian guidance method with path smoothing function.
- Copyright
- © 2015, 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/).
Cite this article
TY - CONF AU - Yicheng Xu AU - Zhigang Wen AU - Xiaoying Zhang PY - 2015/08 DA - 2015/08 TI - Indoor optimal path planning based on Dijkstra Algorithm BT - Proceedings of the 2015 International Conference on Materials Engineering and Information Technology Applications PB - Atlantis Press SP - 309 EP - 313 SN - 2352-5401 UR - https://doi.org/10.2991/meita-15.2015.57 DO - 10.2991/meita-15.2015.57 ID - Xu2015/08 ER -