トップページ |
ログイン
公表論文>
論文>
Path Planning for Tottori City Bus Network using Two-stage Shortest Path Algorithm
|
英語タイトル
|
Path Planning for Tottori City Bus Network using Two-stage Shortest Path Algorithm
|
|
著者
|
- Soonchun Park
- Ryosuke Kawasima
- Takao Kawamura（川村 尚生）
- Kazunori Sugahara（菅原 一孔）
|
|
論文誌
|
鳥取大学工学部研究報告
|
|
巻
|
36
|
|
号
|
|
|
ページ
|
pp. 1-7
|
|
出版年
|
2005年12月
|
|
概要
|
We have developed a path planning system for the bus network in Tottori as Web service. This system finds appropriate paths using the location information of the starting point and the destination obtained through GPS or landmark databases and the current time. Our path planning method can find paths including not only bus transfer but walking transfers. But it is not perfect to search the path by only Dijkstra's Shortest Path Algorithm. So, Two-stage search method is introduced to search for all the bus routes. The system searches the path by using the shortest path estimation gotten from Dijkstra's Algorithm in the 1st stage and selects the most suitable path by using several condition of lopping off branch in the 2nd stage. Experiments are examined to validate the system.
|
|
ファイル
|
BibTeX
PDF
|