A Study on Dijkstra Algorithm in Crossroad Including Left-turn Restriction, U-turn, and P-turn

교차로에서의 좌회전 금지, U-turn, P-turn을 고려한 개선된 Dijkstra Algorithm에 관한 연구

U-turn and P-turn as well as left-turn restriction exist in real traffic network. the optimal route should be selected for considering these using shortest path algorithms. But, the traditional algorithms have some limitations to use for considering there. The objective of this paper is to modify Dijkstra algorithm in order to find the optimal path in real traffic network. The continuous three nodes are used to check turn-restrictions and exclude these from and optimal path. A virtual connection is used to consider U-turn and P-turn.