TIIS (한국인터넷정보학회)
Current Result Document : 1 / 2
| 한글제목(Korean Title) |
A Border Line-Based Pruning Scheme for Shortest Path Computations |
| 영문제목(English Title) |
A Border Line-Based Pruning Scheme for Shortest Path Computations |
| 저자(Author) |
JinKyu Park
Daejin Moon and Eenjun Hwang
|
| 원문수록처(Citation) |
VOL 04 NO. 05 PP. 0939 ~ 0955 (2010. 10) |
한글내용
(Korean Abstract) |
|
영문내용
(English Abstract) |
With the progress of IT and mobile positioning technologies, various types of location-based services (LBS) have been proposed and implemented. Finding a shortest path between two nodes is one of the most fundamental tasks in many LBS related applications. So far, there have been many research efforts on the shortest path finding problem. For instance, A* algorithm estimates neighboring nodes using a heuristic function and selects minimum cost node as the closest one to the destination. Pruning method, which is known to outperform the A* algorithm, improves its routing performance by avoiding unnecessary exploration in the search space. For pruning, shortest paths for all node pairs in a map need to be pre-computed, from which a shortest path container is generated for each edge. The container for an edge consists of all the destination nodes whose shortest path passes through the edge and possibly some unnecessary nodes. These containers are used during routing to prune unnecessary node visits. However, this method shows poor performance as the number of unnecessary nodes included in the container increases. In this paper, we focus on this problem and propose a new border line-based pruning scheme for path routing which can reduce the number of unnecessary node visits significantly. Through extensive experiments on randomly-generated, various complexity of maps, we empirically find out optimal number of border lines for clipping containers and compare its performance with other methods. |
| 키워드(Keyword) |
Dijkstra’s algorithm
path-finding
shortest path container
pruning method
minimum bounding rectangle
convex hull
border-line
|
| 파일첨부 |
PDF 다운로드
|
