• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.179-182
• /
• 2008

It needs to consider of turns during a path-finding on real road network. Because a car is delayed by waiting a traffic signal and decreasing speed when drived in a turn road such as cross road and slip road. If a straightness of a path is increased, a real cost of traveling should be able to decrease. An older method, the algorithm with Turn Heuristic, considered of this case. The algorithm, that differently gave weights to left, right and U-turns, improved a straightness of a path, but increased a cost of exploring. In this paper, we propose a improved Turn Heuristic Algorithm. Proposed algorithm uses Dynamic Turn Heuristic. It is able to more decrease a cost of exploring than older method by using the Turn Heuristic in a part of path-finding.