کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4465125 | 1621852 | 2011 | 10 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Path-finding through flexible hierarchical road networks: An experiential approach using taxi trajectory data Path-finding through flexible hierarchical road networks: An experiential approach using taxi trajectory data](/preview/png/4465125.png)
Optimal paths computed by conventional path-planning algorithms are usually not “optimal” since realistic traffic information and local road network characteristics are not considered. We present a new experiential approach that computes optimal paths based on the experience of taxi drivers by mining a huge number of floating car trajectories. The approach consists of three steps. First, routes are recovered from original taxi trajectories. Second, an experiential road hierarchy is constructed using travel frequency and speed information for road segments. Third, experiential optimal paths are planned based on the experiential road hierarchy. Compared with conventional path-planning methods, the proposed method provides better experiential optimal path identification. Experiments demonstrate that the travel time is less for these experiential paths than for paths planned by conventional methods. Results obtained for a case study in the city of Wuhan, China, demonstrate that experiential optimal paths can be flexibly obtained in different time intervals, particularly during peak hours.
Journal: International Journal of Applied Earth Observation and Geoinformation - Volume 13, Issue 1, February 2011, Pages 110–119