Name
Abstract | ||
|---|---|---|
Most query searches on road networks are either to find objects within a certain range (range search) or to find k nearest neighbors (kNN) on the actual road network map. In this paper, we propose a novel query, that is, path branch point (PBP). PBP can be defined as given a set of candidate interest objects and a pre-defined path starts from S and end at E, find a path which starts from S, via an interest point P and ends at E. This path should overlap with the user's ad hoc (pre-defined) path as much as possible with an acceptable distance increment. This is a novel query which is motivated by users' common requirements because most users have an ad hoc path in their daily travel and can tolerate a longer driving distance to some extent if they can drive on a familiar path. In this proposed approach, an Adjust Score is calculated for each path which is determined by overlapping distance and increased distance cost. Our experiment verifies the applicability of the proposed approach to solve the queries, which involves finding the optimal path branch points. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1145/1971519.1971574 | MoMM |
Keywords | Field | DocType |
mobile navigation,overlapping distance,novel query,increased distance cost,driving distance,acceptable distance increment,optimal path branch point,pre-defined path,path branch point,familiar path,nearest neighbor,path,branch point,k nearest neighbor | k-nearest neighbors algorithm,Network mapping,Any-angle path planning,Shortest path problem,Computer science,Theoretical computer science,Basis path testing,Longest path problem,Fast path,Branch point,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.35 | 18 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Geng Zhao | 1 | 191 | 8.10 |
| David Taniar | 2 | 1702 | 162.18 |
| J. Wenny Rahayu | 3 | 1275 | 106.72 |
| Maytham Safar | 4 | 518 | 44.15 |
| Bala Srinivasan | 5 | 1076 | 191.20 |