Towards adaptable and tunable cloud-based map-matching strategy for GPS trajectories
Citations
13 citations
Cites background or methods from "Towards adaptable and tunable cloud..."
...The second popular model is the STM model, which includes two modules, namely, the spatial analysis and the temporal analysis, as discussed in the literature [13]....
[...]
...[15,16] improved the STM model based on the locality of a road network to obtain the locality-based matching (LBM) model....
[...]
...The running time of the former was found to be shorter than that of the latter [15,16]....
[...]
...The matching results indicate that the LBM model can reduce the total number of shortest path queries against the STM [15,16]....
[...]
...However, the improvement in the matching accuracy of the LBM model relative to STM is insignificant....
[...]
8 citations
Cites background from "Towards adaptable and tunable cloud..."
...A GPS point after map matched [10], [11] is denoted as φm = (xm, ym, sm, cm, τm), where m is taxi ID, an object identifier to uniquely identify the taxis, twotuple (x, y) represents the taxi’s current location, c indicates the current passenger carried state (1 means the taxi is occupied by passenger and 0 means the taxi is vacant), s is the current speed, τ represents the reporting time....
[...]
3 citations
2 citations
Cites background or methods from "Towards adaptable and tunable cloud..."
...1 shows an SSSP example for a six-node network graph connected with seven edges [15]....
[...]
...In this paper, we used our modified SSSP function approaching BSP parallel computing model proposed in our previous work [15]....
[...]
...The complete pseudo-code of the modified SSSP function approaching BSP parallel model is clearly explained in our previous work [15]....
[...]
1 citations
References
22,704 citations
"Towards adaptable and tunable cloud..." refers methods in this paper
...Basically, SSSP is a classical function which has been well solved based on the Dijkstra algorithm (Dijkstra, 1959)....
[...]
...5b. Basically, SSSP is a classical function which has been well solved based on the Dijkstra algorithm (Dijkstra, 1959)....
[...]
20,309 citations
17,663 citations
3,840 citations
"Towards adaptable and tunable cloud..." refers background or methods in this paper
...Regarding the offline efforts, the shortest path distance and temporal/speed constraints are computed by following the parallel computing paradigm, i.e., BSP (Malewicz et al., 2010), in a cloud environment to reduce the pre-processing time....
[...]
...To compute the shortest path distances and temporal/speed constraint, we propose an extension of the single source shortest path (SSSP) function (Seo et al., 2010) following the bulk synchronous parallel (BSP) paradigm (Malewicz et al., 2010) in the cloud environment....
[...]
...Malewicz et al. (2010) in Google Inc. introduced an alternative model, called Pregel, which is based on the BSP parallel paradigm....
[...]
..., BSP (Malewicz et al., 2010), in a cloud environment to reduce the pre-processing time....
[...]
1,290 citations