@inproceedings{f6b168e7034546c1ac7c806d131c04e5,
title = "Research and realization of kth path planning algorithm under large-scale data which meets the requirement for repeatability",
abstract = "Path planning problem is one of the key contents in the research field of Geographic Information System (GIS), among which the finding of the shortest path is always a hot topic. When there is large quantity of data, the efficiency of traditional algorithms of Kth shortest paths is relatively low, and some path problems concerning big difference between the planned Kth paths under actual requirements cannot be solved. On the basis of Dijkstra algorithm, the concepts of favorability and repeatability are introduced to find Kth paths including the shortest in the current graph cyclically by determination of repeatability of path results and the change of graph caused by the change of favorability, thereby realizing the planning of multiple different paths. Compared with similar algorithms, this algorithm is faster, and the multiple path results obtained meet the requirement for certain repeatability while the lengths of paths are also quite reasonable.",
keywords = "Kth paths, algorithm, large-scale data, path, repeatability",
author = "Lei Zhu and Qiongxin Liu and Chunxiao Gao and Jing Wang",
note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 7th International Symposium on Computational Intelligence and Design, ISCID 2014 ; Conference date: 13-12-2014 Through 14-12-2014",
year = "2015",
month = mar,
day = "19",
doi = "10.1109/ISCID.2014.148",
language = "English",
series = "Proceedings - 2014 7th International Symposium on Computational Intelligence and Design, ISCID 2014",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "138--143",
booktitle = "Proceedings - 2014 7th International Symposium on Computational Intelligence and Design, ISCID 2014",
address = "United States",
}