• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.3
• /
• pp.663-668
• /
• 2010

In driving a car, turns such as left turns, right turns, or u-turns, make the speed of the car decrease considerably. A more straight path, therefore, is probably faster to arrive at the destination than zig-zag path with same distance. In this paper, we have newly proposed the turn heuristic to make more straight path. The path navigation algorithm with turn heuristic(called as TA* algorithm) could enhance the straightness of a path by putting the turned-edges to the turn cost. It requires higher cost to use TA* algorithm than traditional A* algorithm because the straight-edge first searching have increased the search space. We have improved the TA* algorithm into the variable TA* algorithm(called as VTA* algorithm) which adopt the turn-heuristic during the a portion of the whole path.

• 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.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2008.10a
• /
• pp.182-187
• /
• 2008

It needs to consider of turns during a path-finding on real road network. traveling on real road network, it generally takes less travel time in a more straight path than a zig-zaged path with same source and destination. In this paper, we propose $VTA^*$ algorithm that can reduce the cost of exploring despite increasing the number of turn in comparing with $TA^*$ algorithm. We have implement the proposed $VTA^*$, $TA^*$ which consider the number of turn and a traditional $A^*$ algorithm which dosen't consider the number of turn. The experimental result shows that the cost of exploring is reduced by 7.31 % comparing with $TA^*$ and the number of turn is reduced by 27.95% comparing with $A^*$ approximately.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.561-564
• /
• 2007

In driving a car, u-turn or left turn makes the speed of car decrease considerably or require more waiting time at the cross for the traffic signal to turn green. A more straight path, therefore, is probably faster to arrive at the destination than zig-zaged path with same distance. Previous works related to the path navigation do not consider the straightness of the path. In this paper, we have proposed the path navigation algorithm with turn heuristic for enhancing the straightness of a path. We have implement the proposed algorithm and compared it with a traditional $A^*$ algorithm. The experimental result shows that the degree of the straightness of a path is enhanced by 30% and the navigation distance of a path is deceased by 3.3%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2072-2077
• /
• 2007

In driving a car, u-turn or left turn makes the speed of car decrease considerably or require more waiting time at the cross for the traffic signal to turn green. A more straight path, therefore, is probably fester to arrive at the destination than zig-zaged path with same distance. Previous works related to the path navigation do not consider the straightness of the path. In this paper, we have proposed the path navigation algorithm with turn heuristic for enhancing the straightness of a path. We have implement the proposed algorithm and compared it with a traditional $A^*$ algorithm. The experimental result shows that the degree of the straightness of a path is enhanced by 30% and the navigation distance of a path is deceased by 3.3%.