# Patent

## Title
Route computation based on route-oriented vehicle trajectories

## Abstract

Techniques for providing a route based on route-oriented vehicle trajectories are described. This disclosure describes receiving GPS logs and extracting route-oriented vehicle trajectory content from the GPS log data to pertain to a single trip. Next, the process maps each route-oriented vehicle trajectory to a corresponding road segment to construct a landmark graph. A landmark is a road segment frequently visited by route-oriented vehicles. The process includes receiving a user query with a starting point and a destination point; searching the landmark graph for a sequence of landmarks with corresponding transition times and a least amount of travel time. Then the process identifies and connects sets of road segments between each pair of consecutive landmarks, and displays a route to a user with a nearest landmark to the starting point, other landmarks along the route, and another nearest landmark to the destination point.

## Background
BACKGROUND
A wide range of map-based services are being offered to users through web browsers, search engines, and as applications. Users may access the map-based services for street maps, a route planner, and a planner for traveling by foot, vehicle, or public transport. Furthermore, the users now have access to an urban business locator for countries around the world.
The request for map-based services has become a common activity in people's daily lives. Many users request the map-based services through a search engine on a computing device or downloaded on a personal navigation device. The requests for map-based services by the users are made prior to driving to an appointment or an event at an unfamiliar location. However, a problem with the conventional map-based services is that the planned routes given are based on finding routes with a shortest geographical-distance, without evaluating other factors that may affect driving conditions.
Other approaches attempt to find routes with a shortest travel time based on speed estimation models. The models estimate the speed of a road according to a road type, such as identifying whether the road is an interstate, a four-lane road, or a two-lane road. The problem is that the models do not take account of other factors that affect speed, such as traffic flows.
As the requests for map-based services continue, there is an increasing opportunity to provide the user with more efficient routes.
SUMMARY
This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
This disclosure describes providing a route with landmarks to help the user with driving directions. The route is computed based on information collected from route-oriented vehicle logs. In one aspect, the route processes global positioning system (GPS) points from route-oriented vehicles by extracting trajectories from the route-oriented vehicle logs. The trajectories represent individual trips for the route-oriented vehicles. Relying on the trajectories, a landmark graph is constructed with landmarks. A landmark is defined as a road segment that is frequently visited by the route-oriented vehicles.
In another aspect, a route plan receives user input for a starting location and a destination location for driving directions. The route plan accesses the landmark graph based on a sequence of landmarks to compute an initial route. In response to the initial route, the process calculates a path between each pair of consecutive landmarks and refines the initial route by sequentially connecting the landmarks. The route plan presents a route with a nearest landmark to the starting location, landmarks along the route, and another nearest landmark to the destination location.



BRIEF DESCRIPTION OF THE DRAWINGS
The Detailed Description is set forth with reference to the accompanying figures. In the figures, the left-most digit(s) of a reference number identifies the figure in which the reference number first appears. The use of the same reference numbers in different figures indicates similar or identical items.
FIG. 1 illustrates an architecture to support an exemplary environment for providing a route plan to a user.
FIG. 2 is a flowchart showing exemplary phases for providing a route plan: preprocessing data, constructing a landmark graph, and computing a route to be used in the architecture of FIG. 1.
FIG. 3 is a flowchart showing an exemplary process for preprocessing the data.
FIG. 4 is a flowchart showing an exemplary process for constructing the landmark graph.
FIG. 5a illustrates an exemplary process of selecting candidate road segments.
FIG. 5b illustrates an exemplary process of generating a candidate graph.
FIG. 6 is a flowchart showing an exemplary process of computing a path.
FIG. 7 illustrates an exemplary process of a road network, a corresponding landmark graph, and an initial route.
FIG. 8 illustrates an exemplary process of refining the initial route to generate a route in response to user input.
FIG. 9 illustrates an exemplary route plan with landmarks.
FIG. 10 is a block diagram showing an exemplary server usable with the environment of FIG. 1.



DETAILED DESCRIPTION
Overview
This disclosure describes recommending a route plan with landmarks based on information collected from route-oriented vehicle logs. In an aspect, the route plan processes global positioning system (GPS) logs from route-oriented vehicles. The route plan extracts trajectories from the route-oriented vehicle logs. The trajectories represent individual trips for the route-oriented vehicles and imply human knowledge from drivers of the route-oriented vehicles. For example, human knowledge may include driving conditions during rush hour, road constructions, direction turns, and the like. The route plan constructs a landmark graph with landmarks, defining a landmark as a road segment frequently visited by the route-oriented vehicles. The landmarks help provide users with a more clear, understandable, and memorable presentation of driving directions. Furthermore, the landmarks provide a way to summarize historical trajectories by using locations frequently visited by the route-oriented vehicles, and reduce searching space to speed up the routing process.
In another aspect, the route plan with landmarks receives user input for a starting location and a destination location for a route. The route plan accesses the landmark graph to compute an initial route by using a sequence of landmarks based on the starting location and the destination location. The route plan calculates an initial path based on a sequence of landmarks with transition times. The process refines the initial route by sequentially connecting the landmarks. The user interface may present the route plan with a nearest landmark to the starting location, various landmarks along the route, and another nearest landmark to the destination location.
While aspects of described techniques can be implemented in any number of different computing systems, environments, and/or configurations, implementations are described in the context of the following exemplary computing environment.
Illustrative Environment
FIG. 1 illustrates an exemplary architectural environment 100, in which a route plan may be recommended on a computing device. The environment 100 includes an exemplary computing device 102, which is illustrated as a personal digital assistant (PDA). The computing device 102 is configured to connect via one or more network(s) 104 to access a route computation service 106 for a user 108. It is noted that the computing device 102 may take a variety of forms, including, but not limited to, a portable handheld computing device (e.g., a personal digital assistant, a smart phone, a cellular phone), a personal navigation device, a laptop computer, a desktop computer, a portable media player, or any other device capable of connecting to one or more network(s) 104 to access the route computation service 106 for the user 108.
The network(s) 104 represents any type of communications network(s), including wire-based networks (e.g., cable), wireless networks (e.g., cellular, satellite), cellular telecommunications network(s), WiFi networks, and IP-based telecommunications network(s). The route computation service 106 represents a map-based application service that may be operated as part of any number of online service providers, such as a search engine. In another implementation, the route computation service 106 may be a map-based application stored in memory of the computing device 102. Updates with GPS logs and trajectories may be sent for a route computation application that is stored on a personal navigation device.
In the illustrated example, the computing device 102 may include a route computation user interface (UI) 110 that is presented on a display of the computing device 102. The user interface 110 facilitates access to the route computation service 106 that provides map-based services. In one implementation, the UI 110 is a browser-based UI that presents a page received from the route computation service 106. The user 108 employs the route computation UI 110 to submit a request for a route from the route computation service 106. The UI 110 may allow for input of several different types of requests. For example, the UI 110 may request and receive input for a start location and a destination location. In another implementation, the request and input may also include a time travel, such as a time of day and a category of day. For example, the user 108 may indicate a travel time at approximately 8 am, which is during rush hour.
In the illustrated example, the route computation service 106 is hosted on one or more route computation servers, such as server 112(1), 112(2), . . . , 112(S), accessible via the network(s) 104. The route computation servers 112(1)-(S) may be configured as plural independent servers, or as a collection of servers that are configured to perform larger scale functions accessible by the network(s) 104. The route computation servers 112 may be administered or hosted by a network service provider that provides the route computation service 106 to and from the computing device 102.
The route computation service 106 further includes a route computation application 114 that executes on one or more of the route computation servers 112(1)-(S). The route computation application 114 may recommend a route plan with landmarks to the user 108, which first includes preprocessing route-oriented vehicle data for a map generation. Data from drivers of route-oriented vehicles are used as they are very familiar with urban road networks and time-variant traffic flows on roads. The drivers know the fastest routes, which are short and quick, but not necessarily the shortest in distance. Thus, the driving data of the route-oriented vehicles enhances the route computation service 106 by mining human knowledge, such as learning smart driving directions. The route computation application 114 may preprocess the route-oriented vehicle data by collecting global positioning system (GPS) logs from various types of route-oriented vehicles. Based on the logs collected, the route computation application 114 identifies geographical locations where the route-oriented vehicles have travelled to generate a map. To better identify effective driving directions in the geographical locations, the route computation application 114 parses trajectories from the logs. The trajectories may be further partitioned, which is described in more detail below. The trajectory data may be stored in a route and landmark database 116 to be used at a later stage to construct a landmark graph.
The trajectory data from the route and landmark database 116 is then used to construct the landmark graph based at least in part on map matching and landmark graph building. The map matching involves associating each route-oriented vehicle trajectory to a corresponding road segment. The landmark graph building also involves specifying a road segment frequently visited by the route-oriented vehicles as a landmark, a frequency being based on a number of route-oriented vehicle logs for the landmark. The landmark graph building specifies landmarks as vertices, generates edges that connect two landmarks, and estimates time cost of the edges. Advantages of using landmarks in the route are to highlight key directions to the destination and making it easier for users to follow routes when given landmarks along the route. In this implementation, the landmark graph is stored in the landmark and route database 116 and is updated on a predetermined time interval. The implementation of constructing the landmark graph is described in more detail below.
After the landmark graph has been constructed, the route computation service 106 is ready to accept user queries. For example, the user 108 accesses the route computation service 106 via the network 104 using their computing device 102. The route computation service 106 in operation with the route computation application 114 presents the user interface 110 to receive a user query, for a starting point and a destination point for driving directions. In the example illustrated in FIG. 1, the user may input a starting point of “401 4th Street” and a destination of “9 Main Street”. Once entered, the user submits the query by actuating the button “Get Directions” on the UI 110. Based on the user query, the route computation application 114 searches the landmark graph for an initial route that is represented by a sequence of landmarks. Next, the route computation application 114 connects a set of road segments between each pair of consecutive landmarks. The initial route is refined by calculating fastest paths from a starting point to each terminal point of the landmarks. Then a fastest path is computed, beginning from the landmarks that are near the starting point to ending at the landmarks near the destination point. The user interface 110 displays the route with landmarks 118, that is recommended based on the starting point and the destination point.
As mentioned, the environment 100 may include the route and landmark database 116, which may be a separate server or may be a representative set of servers 112 that is accessible via the network(s) 104. The route and landmark database 116 may store information, such as logs for the route-oriented vehicles which include a sequence of global positioning system (GPS) points, trajectories archive, a landmark graph, the initial route from the landmark graph, the fastest path from starting point to each terminal point of the landmarks, and the like.
The environment 100 shows a representation of the route computed 118, which is a recommendation by the route computation service 106 to the user 108. Shown is a heavy darken line, which is the route suggested with landmarks. While the route may not appear to be the shortest path from the start point Qs, it is the fastest path by learning smart driving patterns. Shown are Qs for query starting location at “401 4th Street”, L1 represents a landmark nearest to the starting location, L2 represents another landmark on where to turn south, such as “Northeast 4th Street”, and L3 represents yet another landmark to turn east. At the end of the path is Qe, which is the query ending location at “9 Main Street”, represented with the nearest landmark L4.
FIG. 2 is a flowchart showing an exemplary process 200 among high level functions performed by the route computation service 106. The route computation service 106 computes a route based on log information collected from the route-oriented vehicles. The process 200 is divided into three phases, an initial phase to preprocess route-oriented vehicle data for map generation 202, a second phase to construct a landmark graph using route-oriented vehicle data 204, and a third phase to compute routes that allow requesting users to travel past landmarks 206. The phases are to be used in the environment of FIG. 1. Details are discussed for preprocessing the route-oriented vehicle data for map generation 202 in FIG. 3; for constructing the landmark graph using the route-oriented vehicle data 204 in FIGS. 4, 5a, and 5b, and for computing the routes that allow requesting users to travel past landmarks 206 in FIGS. 6-8.
Preprocessing the route-oriented vehicle data for map generation 202 involves the route computation application 114 collecting GPS logs from various types of route-oriented vehicles. The logs may be obtained from GPS sensors located on each of the route-oriented vehicles. A GPS log is generally a collection of GPS points, which includes a date, a time, a longitude, and a latitude. In an implementation, the route computation service 106 may obtain GPS logs from a taxi company. Each taxi may be equipped with the GPS sensor that records GPS log data every two to eight minutes per point. Taxi drivers typically drive the fastest way based on their knowledge of the roads and traffic flows at various times, in order to make more profit. Thus, the route computation application 114 learns smart driving directions based on the taxi driver's knowledge. Next, the route-oriented trajectories are partitioned from the route-oriented logs, in order for the trajectories to provide a better representation of individual trips. Furthermore, the computation service application 114 determines when a time interval between two consecutive GPS points is greater than a predetermined threshold; to partition the two consecutive GPS points into two different trajectories. For example, this may occur when the taxi driver is quitting for the day by closing down their taxi for the night. On the other hand, if the time interval between the two consecutive GPS points is less than the predetermined threshold, to combine the two consecutive GPS points into a trajectory.
In another instance, the route-oriented vehicle trajectories may be divided into separate trajectories when a stay point is identified. The stay point represents a geographical region that the route-oriented vehicle remained stationary for a time period, the stay point based at least in part on a time threshold within a distance threshold. For example, if the taxi remained stationary for more than 20 minutes within a distance of 30 meters, the stay point is identified and used for separating the trajectory into two portions. The two parameters indicate the taxi may be waiting for passengers, rather than an individual trip. Once the GPS log data has been transformed into trajectory data, the information is stored in the route and landmark database 116 to be used in constructing the landmark graph. The information stored may be updated on predetermined time intervals.
The second phase, to construct the landmark graph 204 means the GPS log data has been transformed into trajectory data to be useful for building a graph with landmarks. Landmarks serve as guides that follow a natural thinking pattern of humans for easy driving directions. The trajectory data is retrieved from the route and landmark database 116. There may be 10-meter or more positioning error with the GPS sensor readings, which may cause the reported geographical locations of the route-oriented vehicles to not map correctly to the road segments. To address this problem, a map matching algorithm evaluates the spatial geometric and topological structures of the road network and the temporal/spatial speed constraints of the roads traversed by the route-oriented vehicles. The algorithm associates the trajectory to road segments based on identifying candidates for road segments, determining observation and transmission probabilities as likelihood of matching candidates and defining a true path, measuring a distance between actual average speed between candidates and speed constraints of the path, and identifying a best matching path.
Another aspect of constructing the landmark graph involves building the landmark graph by first specifying landmarks. This occurs by using a landmark construction algorithm to identify landmarks, represent landmarks as vertices, generate edges between two vertices, and estimate a time cost of the edges. In an implementation, the algorithm identifies a top k road segments that is frequently visited by taxis. Each trajectory is represented by a sequence of road segments with transition times and each landmark is represented as a vertex. The landmark graph may be stored in the route and landmark database 116 and utilized whenever the route computation service 106 is activated or when the information is updated.
The third phase, to compute the routes that allow requesting users to travel past landmarks 206, starts when the user 108 wants driving directions to a new location. For example, the user 108 initiates the route computation service 106 via the network 104. Upon activating the route computation service 106, the user interface 110 is presented to the user 108 requesting a starting location and a destination location. The user 108 may be starting from home, providing this as input for the starting location and providing the new location address as the destination location. Typically, the destination location may be for a first time visit or for a place not visited often, such as a dentist, accountant, and the like.
In another implementation, in addition to the starting and destination locations, there may be a request specified for a time period of travel. This may be desirable during rush hour traffic. For the time period request, the trajectories have been partitioned into multiple parts according to a time of a day and category of day, weekday or weekend. Also, there are multiple landmark graphs for different time spans.
In addition, the computing routes that allow requesting user to travel past landmarks 206 include an initial algorithm to search the landmark graph given the starting location and the destination location. The algorithm computes an initial route based on the sequence of landmarks with corresponding transition time between landmarks and landmarks nearest the starting and destination locations. Furthermore, Dijkstra algorithm is used to find a fastest path for pairs of start and end points nearest potential landmarks. The route computation application 114 takes the initial route as input to find a detailed path sequentially connecting the landmarks in the initial route. The route computation application 114 continues computing fastest paths between landmarks by using a refined algorithm. Once the route with landmarks 118 is identified, it is presented to the user 110. The route may not be the shortest but is the fastest based on the collection of GPS logs. Shown is L2 in 118, which helps guide the user 108 to turn south there.
Exemplary Processes
FIGS. 3, 4 and 6 are flowcharts showing exemplary processes for preprocessing route-oriented vehicle data for map generation, constructing the landmark graph using route-oriented vehicle data, and computing routes that allow requesting users to travel past landmarks, respectively. The processes are illustrated as a collection of blocks in logical flowcharts, which represent a sequence of operations that can be implemented in hardware, software, or a combination. For discussion purposes, the processes are described with reference to the computing environment 100 shown in FIG. 1. However, the processes may be performed using different environments and devices. Moreover, the environments and devices described herein may be used to perform different processes.
For ease of understanding, the methods are delineated as separate steps represented as independent blocks in the figures. However, these separately delineated steps should not be construed as necessarily order dependent in their performance. The order in which the process is described is not intended to be construed as a limitation, and any number of the described process blocks maybe be combined in any order to implement the method, or an alternate method. Moreover, it is also possible that one or more of the provided steps will be omitted.
FIG. 3 is a flowchart illustrating an exemplary process 300 of preprocessing route-oriented vehicle data for map generation 202 for the route computation service 106. The process 300 may collect or receive GPS logs from the route-oriented vehicles 302. For example, the route-oriented vehicles may include taxis, limousines, package delivery trucks for UPS or Federal Express, and the like. Drivers for the route-oriented vehicles may be very familiar with urban road networks and time-variant traffic flows on roads. To be effective and to make profit, the drivers for the route-oriented vehicles tend to select a fastest way based on their knowledge. Along with their knowledge, the drivers consider other factors, such as traffic flows and signals, accidents, road constructions, direction turns, and the like. By directly following their routes that are well supported by the GPS logs, the knowledge of the drivers may be effectively used.
It is possible to collect log information since a large number of the route-oriented vehicles may be equipped with a global positioning system (GPS) sensor that automatically records a sequence of GPS points. The GPS points contain a date, a time, a longitude, and a latitude, which may be collected with a low sampling rate every two-eight minutes per point. As shown at 302(a), three GPS points p1, p2, and p3 from the route-oriented vehicle have been collected with dates, times, latitudes, and longitudes for the points.
The process 300 identifies geographical locations from the route-oriented vehicle logs 304. The geographical locations represent locations where the route-oriented vehicles have travelled as recorded in the logs. The process 300 may further divide the geographical locations into road segments. A road segment is a directed edge that is associated with a direction symbol, two terminal points, and a list of intermediate points describing the road segment with a polyline. Shown in FIG. 3 is the polyline representing the road segments 304(a). The polyline is a collection of road segments r1, r2, r3, and r4.
The process 300 extracts the route-oriented vehicle trajectories from the route-oriented vehicle logs 306 to better represent the data as trips. The extractions of the route-oriented vehicle trajectories are to identify individual trips. As shown in 302(a), points p1, p2, p3, and p4 are identified as one trajectory, which represents a single trip.
The GPS points in the logs may be partitioned to identify more accurate driving directions. In one instance, the partitioning is based on a time interval 308. By evaluating the GPS points to determine when the time interval between two consecutive GPS points is greater than a predetermined threshold, the process 300 may partition the two consecutive GPS points into two different trajectories. In an implementation, the predetermined threshold may be 30 minutes. If the time interval for the two consecutive GPS points is greater than 30 minutes, it is presumed the drivers for the route-oriented vehicle may have stopped working for the day. On the other hand, when the time interval between the consecutive GPS points is less than the predetermined threshold, the consecutive GPS points are combined as a single trajectory. Shown at 308(a), the log may be divided into two parts. Based on the log information, division at p9 because the time interval between p9 and p10 is over the predetermined ΔT threshold (if ΔT=30 minutes).
In addition to partitioning, the process 300 may also detect or specify stay points 310 to identify more accurate driving directions. The stay point is based at least in part on a time threshold within a distance threshold, as shown to the right of 310. The stay point represents a geographical region that the route-oriented vehicle has remained stationary for a time period. When the stay point has been detected or identified, the process 300 segments the route-oriented vehicle trajectory by this stay point.
The stay point may be specified or detected when drivers for taxis or limousines are waiting for their passengers at some locations, while remaining in their vehicles. Alternatively, some drivers may be running in and out of their vehicles to deliver packages, causing a potential stay point to appear. By having the time threshold within the distance threshold avoids identifying traffic jams. For example, the drivers of the route-oriented vehicles may be stuck in traffic jams. In an implementation, the time threshold may be 20 minutes within a distance threshold of 30 meters. Assuming the place visited may be for less than 15 minutes and a distance of 120 meters. Thus, this place is not over the time threshold and not within the distance threshold, so there is no division of the trajectory.
After the GPS points for the route-oriented vehicle logs have been collected and the trajectories identified for the GPS points pertaining to a single trip, the process 300 may store the trajectory information in the route and landmark database 116 or archive the information 312. Alternatively, the information may be stored as part of a database attached to the server 112. In another implementation, the information may be downloaded and stored in the personal navigation device.
FIG. 4 is a flowchart showing an exemplary process 400 of constructing the landmark graph using route-oriented vehicle data 204 for the route computation service 106. The route-oriented vehicle logs were preprocessed into trajectories to be used in constructing the landmark graph. The trajectories shown in FIG. 3 may be retrieved from the route and landmark database 116 or from a database attached to the server 402.
The landmark graph is constructed 204 by accessing the trajectories stored in the route and landmark database 116. The landmark graph construction includes associating or matching each route-oriented vehicle trajectory to a corresponding road segment 404. Shown in 404a, are five trajectories, T0, . . . T4. The five trajectories are associated or matched to corresponding road segments, e.g., two points p1 and p2 from T1 have been mapped to r1 and r2, respectively. Thus, each trajectory may be represented by a sequence of road segments with transition times.
Problems may exist when collecting the GPS points for the logs. In one instance, readings from a GPS sensor may have a positioning error, causing locations of the route-oriented vehicle aligned to incorrect road segments. Another problem is that the route-oriented vehicles report their location-time information in a low sampling rate of about every five minutes. To address these problems, a global map-matching algorithm is proposed. The map-matching algorithm evaluates spatial geometric and topological structures of a road network and temporal/speed constraints of the roads traversed by the route-oriented vehicles. Details of the map-matching algorithm follow in FIGS. 5a and 5b. 
The construction of the landmark graph 204 also includes specifying or identifying road segments frequently visited by the route-oriented vehicles as landmarks 406. A frequency being based on a number of route-oriented vehicle logs recorded for the landmark. In an example shown in 406a, a top k number of road segments are identified as the landmarks. In 406a, when k=4, the four road segments may be identified as: r0, r2, r6, and r9.
Once the landmark is identified, it may be represented as a vertex 408. The vertex is shown at 408(a). A landmark edge may be used to connect two vertices 410, as long as a trajectory is directly passing the two vertices. Shown in 410a, the edge connects r0 to r2. The edge may be represented by δ=1 and denotes frequently travelled path between two landmarks. The landmark edges are computed and connected to any of the two vertices.
A time cost of the landmark edge is estimated 412. The time cost estimate of each edge is based on calculating a median of travel time over the trajectories passing the two vertices that are connected by the landmark edge. For example, the median of travel time cost is 0.3 from qs (query start point), to r2 and 0.4 from qs to r1, as shown in 412a. 
An algorithm proposed for the landmark graph construction is shown below. L is a collection of landmarks. As mentioned, the top k is used rather than a threshold to determine landmarks, as the threshold may vary in the scale of the trajectory set. With a fixed threshold, more road segments will be detected as landmarks given more trajectories. However, a threshold δ may be used to detect the landmark edge because the path may exist as long as the path has been traversed by some route-oriented vehicles. The algorithm follows:










Algorithm for Landmark Graph Construction (Gr, A, k, δ)















Input: A road network Gr, a trajectory archive A, the number of landmarks k


and a threshold δ determining the edge support.


Output: A landmark graph Gl.








1.
M= Ø, Count[ ]=0, E=Ø;


2.
Foreach trajectory T∈A;


3.
S=MapMatching(T, Gr); //Project a trajectory to road segments



  //S is a road segment sequence with transition times


4.
 M.Insert(S); //Add S to the sequence collection


5.
 Foreach road segment r∈S


6.
 Count[r]++; //The individual counter for each road segment


7. 
L = Top_k (Count[ ], k); //Select the top k road segments as landmarks;


8. 
Foreach S∈M


9.
 S = Convert(S, L); //Convert each S to a landmark sequence


10. 
 For i=0; i<|S|; i++;


11.
  l=[i], l'=S[i +1]; // two consecutive landmarks from S


12.
  If el:∉E //There is no edge between the two landmarks


13.
   el:=BuildEdge(l, l');


14.
   E. Insert (el:); //Add the edge to the collection


15.
  el,'.sup++; // Count the number of trajectories passing it


16.
  el,′.Δt.Add (Δt(l,l′)); // Save the transition time


17.
Foreach edge e∈E


18.
  If e.sup< δ


19.
   E.Remove(e);


20.
  Else


21.
   e.cost=Median (e.Δ[ ]); //Select the median value.


22. 
Return Gl=(L,E);









FIGS. 5a and 5b describe details of the map-matching algorithm that associates or matches each route-oriented vehicle trajectory to a corresponding road segment. FIG. 5a is a schematic showing an exemplary process 500 of selecting candidate road segments.
For each GPS point pi, a circle 502(1), 502(2), 502(3), . . . , 502(N) encompassing a set of road segments within a radius d is shown. For example, two candidate road segments and ri-11 and ri-12, fall in the radius d of pi-1, meaning the route-oriented vehicles may travel on ri-11 or ri-12. Utilizing this data, the map-matching algorithm identifies one or more candidate sets of one or more candidate projection points, ci-11 and ci-12, of pi-1. Furthermore, pi's candidate projection points ci1 and ci2 may be detected along candidate edges ri1 and ri2, respectively.
Spatial analysis is a product of observation probability and transmission probability. Observation probability is typically defined as the likelihood that the GPS point Pi matches a candidate point cij. computed based on a distance between two candidate points dist(cij, pi). Generally, the error in a GPS measurement is reasonably described as a normal distribution N(μ, σ2) of the distance between Pi and cij. The observation probability may defined as:




  
    N
    ⁡
    
      (
      
        c
        i
        j
      
      )
    
  
  =
  
    
      1
      
        
          
            2
            ⁢
            
              
            
            ⁢
            π
          
        
        ⁢
        σ
      
    
    =
    
      e
      
        
          
            (
            
              
                x
                i
                j
              
              -
              μ
            
            )
          
          2
        
        
          2
          ⁢
          
            
          
          ⁢
          
            σ
            2
          
        
      
    
  




where x is the distance between the GPS observation Pi and its corresponding candidate point cij, represented as xij=dist (cij, pi).

For example, given two candidate points ci-1t to cis for two neighboring GPS sampling points pi-1 and pi respectively, the transmission probability from ci-1t to cis is defined as the likelihood that the “true” path from pi-1 and pi follows the shortest path from ci-1t to cis. Such a true path may be represented by:




  
    V
    ⁡
    
      (
      
        
          c
          
            i
            -
            1
          
          t
        
        →
        
          c
          i
          s
        
      
      )
    
  
  =
  
    
      dist
      ⁡
      
        (
        
          
            p
            
              i
              ′
            
          
          ⁢
          
            p
            
              i
              -
              1
            
          
        
        )
      
    
    
      w
      
        
          (
          
            
              i
              -
              1
            
            ,
            t
          
          )
        
        →
        
          (
          
            i
            ,
            s
          
          )
        
      
    
  




where di-1′I=dist(pi, pi-1) is the Euclidean distance between pi and pi-1, and w(i−1,t) (I,s) is the length of the shortest path from to ci-1t to cis.

As mentioned, the spatial analysis is the product of the observation probability and the transmission probability. Combining the observation probability and the transmission probability, the spatial analysis function Fs(ci-1t to cis) may be defined by:

Fs(ci-1t→cis)=N(cis)*V(ci-1t→cis),

where ci-1t and cis may be any two candidate points for two neighboring GPS points pi-1 and pi.

Temporal analysis may be determined for two projected candidate points ci-1t and cis for two neighboring sampling points pi-1 and pi, respectively, the shortest path, as determined above, from ci-1t and cis is denoted as a list of road segments [r1′, r2′, . . . , rk′]. The average speed v(i−1,t)→(i,s) of the shortest path is computed using the following formula:




  
    
      υ
      _
    
    
      
        (
        
          
            i
            -
            1
          
          ,
          t
        
        )
      
      →
      
        (
        
          i
          ,
          s
        
        )
      
    
  
  =
  
    
      
        ∑
        
          u
          =
          1
        
        k
      
      ⁢
      
        
          r
          u
          ′
        
        ·
        l
      
    
    
      Δ
      ⁢
      
        
      
      ⁢
      
        t
        
          
            i
            -
            1
          
          →
          i
        
      
    
  




where ru′,l is the length of ru′, and Δti-1→i=pi,t−pi-1,t is the time interval between two points pi and pi-1. Note that each road segment ru′ is also associated with a typical speed value ru′,v. A cosine similarity may be used to measure the distance between the actual average speed from ci-1t to cis and the speed constraints of the path, i.e., a vector containing k elements of the same value v(i−1,t)→(i,s) and a vector (r1′.v, r2′.v, . . . , rk′ .v)T. The temporal analysis function may be defined as:




  
    
      F
      t
    
    ⁡
    
      (
      
        
          c
          
            i
            -
            1
          
          t
        
        →
        
          c
          i
          s
        
      
      )
    
  
  =
  
    
      
        ∑
        
          u
          =
          1
        
        k
      
      ⁢
      
        (
        
          
            
              r
              u
              ′
            
            ·
            υ
          
          ×
          
            
              υ
              _
            
            
              
                (
                
                  
                    i
                    -
                    1
                  
                  ,
                  t
                
                )
              
              →
              
                (
                
                  i
                  ,
                  s
                
                )
              
            
          
        
        )
      
    
    
      
        
          
            ∑
            
              u
              =
              1
            
            k
          
          ⁢
          
            
              (
              
                
                  r
                  u
                  ′
                
                ·
                υ
              
              )
            
            2
          
        
      
      ×
      
        
          
            ∑
            
              u
              =
              1
            
            k
          
          ⁢
          
            
              υ
              _
            
            
              
                (
                
                  
                    i
                    -
                    1
                  
                  ,
                  t
                
                )
              
              →
              
                (
                
                  i
                  ,
                  s
                
                )
              
            
            2
          
        
      
    
  




As in the spatial analysis functions described above, ci-1t and cis are for two neighboring sampling points pi-1 and pi, respectively.

FIG. 5b is a schematic showing an exemplary process 504 of generating a candidate graph G′T (V′T, E′T) for trajectory T. Following the spatial analysis and the temporal analysis calculations, the candidate graph is generated. As depicted in FIG. 5b, V′T is a set of candidate projection points and E′T is a set of edges representing the shortest paths between two neighboring candidate points. Each node in G′T is associated with N(cis) and each edge is associated with Ft(ci-1t→cis) and Fs(ci-1t→cis). Combining the equations, the spatial-temporal (ST) function may be defined as:

F(ci-1t→cis)=Fs(ci-1t→cis)*Ft(ci-1t→cis), 2≦i≦n. 

From all of the candidate sequences, the route computation service 106 finds the best matching path P (with the highest overall score) for the trajectory T using a dynamic strategy. The equation for finding the best math is:

P=arg maxPcF(Pc), ∀PcεG′T(V′T,E′T).

The map-matching algorithm is shown below. The framework may begin by computing a set of candidate points for each GPS sampling point on Trajectory T. The candidate graph may then be constructed based upon the spatial and temporal analyses, followed by a report identifying the path sequence P with the highest ST-function value from G′T as the result.










Map-Matching Algorithm

















Input: Road Network G, a trajectory T:p1→p2→. . .→pn.  Output: The matched sequence P: c1j1→c2j2→ . . .→ cnjn in G 










1:
Initialize tList as an empty list; // a list of sets of candidates



2:
for i = 1 to n do



3:
 s = GetCandidates(pi, G, r); // candidates within radius r



4:
tList.add(s);



5:
GT' = ConstructGraph(tList); // constructs graph GT'



6:
RETURN FindMatchedSequence (GT')










FIG. 6 is a flowchart showing an exemplary process 600 of computing the path 206 for the route computation service 106. The route computation service 106 presents the user interface 110 on the display of the computing device 102, after the user 108 activated the route computation service 106. The user interface 110 gives the user 108 access to the map-based services provided by the route computation service 106.
The route computation service 106 requests and receives input or query 602 from the user 108 on the user interface 110. In an implementation, the user input may be for a request for a starting location and a destination location. It is commonly understood that the time of day for travelling on the route may affect the amount of time provided for the driving directions. Traffic patterns are considerably different during rush hour on weekdays as compared to weekends.
In another implementation, the user-specified query may be for the starting location, the destination location, and a time of day and a category of day for travelling from the starting location to the destination location. The time of day may be given in hours, am or pm, and the category of day is a weekend or a weekend. The route computation service 106 recommends a fastest path to the user 108 in terms of the query time. Thus, the route computation service 106 may partition the trajectories into multiple parts, according to the time of a day (7 am to 9 am, 5 pm to 7 pm) and category of days (weekdays or weekends). The route computation service 106 builds multiple landmark graphs corresponding to different time spans. This implementation is based on the user 108 specifying time spans for travelling on the route.
In yet another implementation, the route computation service 106 estimates a time span for the user 108. This occurs when the user 108 issues a query on ts, a distance between the starting location and the destination location given by the user 108 may be dist(qs,qe). The possible driving time span may be shown as [ts,ts+(dist(qs,qe)V]. V is an imagined speed constraint, such as 40 KM/hr. The route computation service 106 selects the landmark graph according to time, covering most parts of the query time span. Then the route computation service 106 computes the path or the route based on the landmark graph according to a time frame.
Once the route computation service 106 receives the input or query from the user 108, the route computation service 106 accesses the landmark graph 604 constructed from the route-oriented vehicle trajectories. The construction of the landmark was previously described in FIGS. 4 and 5. The route computation service 106 searches the landmark graph for an initial route based on the user input for starting and destination locations. The route computation service 106 locates the sequence of landmarks with corresponding transition times between the landmarks and a least amount of travel time. This is shown below as:




  
    R
    =
    
      
        l
        0
      
      ⁢
      
        →
        
          Δ
          ⁢
          
            
          
          ⁢
          
            t
            0
          
        
      
      ⁢
      
        
          l
          1
        
        ⁢
        
          →
          
            Δ
            ⁢
            
              
            
            ⁢
            
              t
              1
            
          
        
        ⁢
        
          
        
        ⁢
        
          ...
          ⁢
          
            
          
          ⁢
          
            →
            
              Δ
              ⁢
              
                
              
              ⁢
              
                t
                
                  n
                  -
                  1
                
              
            
          
          ⁢
          
            l
            n
          
        
      
    
  
  ,
  
    
      l
      i
    
    ∈
    
      L
      .
    
  




In addition, the route computation service 106 locates m landmarks over the landmark graph. The m landmarks are landmarks that are nearest to the starting location and destination location. An illustration of the nearest landmarks to the starting and destination locations is shown in FIG. 7. For example, there may be a variable number of landmarks close to the starting location, such as if m=2, the two landmarks nearest the starting location may be r1 and r2 and the two landmarks nearest the ending location may be r6 and r7.
For each pair of start and end points, the route computation service 106 computes a fastest path or route 608 by using a shortest path algorithm. An example of a shortest path algorithm that may be used is:










Dijkstra's Algorithm
















1.
 INITIALIZE SINGLE-SOURCE (G, s)


2.
 S {} // S will ultimately contains vertices of final shortest-path



weights from s


3.
 Initialize priority queue Q i.e., Q V[G]


4. 
 while priority queue Q is not empty do


5.
  u← EXTRACT—MIN(Q) // Pull out new vertex


6.
  S← S ∪ {u}



  // Perform relaxation for each vertex v adjacent to u


7.
  for each vertex v in Adj[u] do


8.
   Relax (u,v,w)









The initial route is efficient since the landmark graph is a small subset of the original road network. As mentioned, the process selects the route with the least time cost. The time costs for travelling from the starting location to the destination location to their nearest landmarks are estimated in terms of speed constraints of the road networks. The starting and destination locations tend to be relatively close to their nearest landmarks. However, the estimated time cost may have a small inaccuracy that may not reduce the effectiveness of the initial routing. The algorithm used for the initial routing is shown below:










Algorithm for Initial Routing (Gl, qs, qe, m)















Input: A landmark graph Gl, the start point qs and destination point qe of a 


user-specified query, m-nearest landmarks of start and destination.


Output: A quick path R on landmark graph.








1.
 =Ø;


2.
Ls← NearestLankmark(qs,G1, m); //search m nearest landmarks for qs


3.
Le← NearestLankmark(qe, G1, m); //search m nearest landmarks for qe


4.
For i=0; i<m; i ++;


5. 
 For j=0; j<m; j ++;


6.
  R ← ShortestPath (Gl,si ,Lej ); //compute the fastest path


7.
   .Add (R);


8.
R = SelectRoute ( s,qe); //Select the lowest time-cost route;


9. 
Return R;









After the initial route has been computed 606, the process 600 applies this as input, and finds a detailed path that sequentially connects the landmarks 610 in the initial route. There may be some landmarks that are bidirectional road segments, the direction should be determined in which the route-oriented vehicles may traverse this segment. Thus, the process 600 may compute additional fastest paths for the unidirectional and bidirectional road segments.
A refined routing 612 may take advantage of the initial route. The sequence between the landmarks has already been specified by the initial route, making it possible to compute a fastest path 608 between each pair of consecutive landmarks, respectively and independently. Furthermore, the distance between two consecutive landmarks is much smaller than that between the start and destination locations, reducing the search area significantly.
After computing the fastest paths 608 between the landmarks, the process 600 performs the refined routing 612. The process 600 finds the fastest path from a starting point to each terminal point of the landmarks by employing a dynamic programming strategy. This process is performed step by step until the destination is reached. The algorithm for refining the route is shown below:










Algorithm for Refined Routing (Gr, qs, qe, R)















Input: A road network Gr, the start point qs and destination point qe of a 


user-specified query, an initial routing result R (a landmark sequence).


Output: A refined fast route Path.








1. 
Pat(r0.end)←ShortestPath(Gr,qs,r0.start) ∪(r0.start →end);


2. 
If r0.dir != one-way


3.
 Path(r0.start)←ShortestPath(Gr,qs,r0.end) ∪(r0.end→start);


4.
For each road segment ri∈R,1≦i<R ,


5.
 Set the time cost of R1,R2,R3,R4 to ∞; //intermediate candidates


6.
 R1←Pat(ri-1.end)∪ ShortestPath(Gr,ri-1.end,ri.start);


7.
 If ri-1 .di!= one-way


8.
  R2←Pat(ri-1.start)∪ ShortestPath(Gr ,ri-1.start,ri.start);


9.
 If Timecost R1 <Timecost R2


10.
  Path(ri.end)= R1∪(ri.start →end);


11.
 Else


12.
  Path(ri.end)= R2∪(ri.start →end);


13. 
 If ri.di!= one-way


14.
  R3←Path(ri-1.end)∪ ShortestPath(Gr,ri-1.end,ri.end);


15.
 If ri-l.di!= one-way && ri.dir != one-way


16.
  R4←Path(ri-1.start)∪ShortestPath(Gr,r-i.start,ri.end);


17.
 If Timecost R3 <Timecost R4


18.
  Path(ri.start)=R3∪(ri.end →start);


19.
 Else


20.
  Path(ri.start)= R4∪(ri.end →start);


21. 
End For each


22. 
R1 =Path rn.end ∪ ShortestPath(Gr,rn.end,qe) ; //n= | R | -1;


23. 
If rn.dir = one-way


24. 
Path ←R1;


25. 
Else


26.
 R2= Path rn.start ∪ ShortestPath(Gr,rn.start,qe);


27.
 R'=argmin R1,2 (Timecost R1 ,Timecost(R2));


28.
 Path←R';


29.
Return Path;









The process 600 determines the route or a final fastest path from the starting location to the destination location and visually presents the route to the user 614. The final fastest route may illustrate a nearest landmark to the starting location, various landmarks along the route to guide the user 108, and another nearest landmark to the destination location. An illustration of the route presented to user 108 is shown in FIG. 9.
FIG. 7 illustrates schematic diagrams 700 of the initial routing process 606. As mentioned, the route computation service 106 searches the landmark graph based on trajectories 702. Shown are seven road segments (r1, r2, . . . r7) that are specified as landmarks based on the trajectories. A corresponding landmark graph of the road network is shown in 704. The number shown on each landmark edge denotes a median time cost for travelling from one vertex (landmark) to another vertex (landmark). These are learned from the trajectories in the phase of landmark graph construction.
As previously mentioned, the nearest landmarks to the starting and destination locations are based on inputting a number for m landmarks. Shown at 704 are a variable number of landmarks close to the starting location. In an implementation, the input is m=2, the process identifies two landmarks nearest the starting location, which may be r1 and r2. The process also identifies the two landmarks nearest the ending location, which may be r6 and r7. There are four pairs of starting and ending landmarks. For each pair of start and end points, the route computation service 106 computes the fastest path or route 608 by using the shortest path algorithm. As mentioned, the process selects the route with the least time cost. The time costs for travelling from the starting location to the destination location to their nearest landmarks are estimated in terms of speed constraints of the road networks.
The initial route 706 is a result of finding the route with the least time cost. The time costs are estimated in terms of speed constraints of the road networks. Referring back to 704, at qs (query start point), the median of travel time cost is 0.3 from qs to r2 and 0.4 from qs to r1.
FIG. 8 illustrates an exemplary process 800 for refined routing 612. Steps are calculated for the fastest path from the start point qs to each terminal point of the landmarks of the initial route 802. For instance, the fastest path from qs to r4.end is coined as Path(r4.end). Shown along the top are true time costs learned from the trajectories.
Shown at 804, because r2 is a one-way road segment, the process will calculate the fastest path from qs to r2.start over the road network by employing the shortest path algorithm. However, the fastest path from ps to r2.start does not pass r2.end. Thus, the calculations may include, Path(r2.end)=qs→r2.start→r2.end=0.3+1=1.3.
The refinement routing process continues to compute the detailed fastest paths shown at 806. Starting from r2.end to r4.start and r4.end, respectively, as r4 is bidirectional. The fastest path from r2.end to r4.end does not pass r4.start, and from r2.end to r4.start does not pass r4.end. Therefore, Path(r4.start)=Path(r2.end)→r4.end→r4.start=1.3+1.4+1=3.7. Path(r4.end)=Path(r2.end)→r4.start→r4.end=1.3+4.5+1=6.8. These may be computed in parallel to speed up the process.
The process continues to search for the fastest paths for each pair of terminal points of r4 and r5, as both are bidirectional segments. Using the strategy of dynamic programming, it is easy to compute in parallel that:

Path(r5.start)=Path(r4.start)→r5.end→r5.start=3.7+1.7+1=6.4,

Path(r5.end)=Pat(r4.start)→r5.start→r5.end=3.7+2.5+1=7.2.

As r2 is a one-way road segment, it is not necessary to compute the shortest path from r5.end or r5.start to r6.end.

Path(r6.start)=Path(r5.end)→r6.start=7.2+0.9=8.1.

Path(pe)=Path(r6.start)→r6.end→pe=8.1+1+0.2=9.3.

The time cost of the refined route connecting the terminal points of the two landmarks (e.g., r2.start→4.end) is estimated according to the speed constraints of the road networks. As these constraints are ideal values, they may be smaller than the true time cost learned from the trajectories (shown at 802).
As discussed above, certain acts in processes 200-400, and 600 need not be performed in the order described, may be modified and/or may be omitted entirely, depending on the circumstances.
FIG. 9 is a schematic diagram showing an exemplary route 900 as computed by the route computation service 106 and presented to the user 108 on the user interface 110. As mentioned, the route 900 from the route computation service 106 may be provided by a network service provider, a web application, an application based on a live search map, an application stored in memory of a computing device, and the like.
Exemplary Server Implementation
FIG. 10 is a block diagram showing an exemplary server 112 to be used for the route computation service 106 and/or the route computation application 114. The server 112 may be configured as any suitable system capable of services, which includes, but is not limited to, implementing the route computation service 106 for map-based services, such as provide driving directions with landmarks. In one exemplary configuration, the server 112 comprises at least one processor 1000, a memory 1002, and a communication connection(s) 1004. The communication connection(s) 1004 may include access to a wide area network (WAN) module, a local area network module (e.g., WiFi), a personal area network module (e.g., Bluetooth), and/or any other suitable communication modules to allow the server 112 to communicate over the network(s) 104.
Turning to the contents of the memory 1002 in more detail, the memory 1002 may store an operating system 1006, the route computation service module 106a, the route computation application or module 114, and one or more applications 1008 for implementing all or a part of applications and/or services using the route computation service 106.
The one or more other applications 1008 or modules may include an email application, online services, a calendar application, a navigation module, a game, and the like. The memory 1002 in this implementation may also include Dijkstra's algorithm 1010, a map matching algorithm 1012, a landmark construction algorithm 1014, and routing algorithms 1016.
Dijkstra's algorithm 1010 determines a shortest path when there are pairs of starting points and ending points, close to nearest potential landmarks. It will find vertices of shortest paths. The map matching algorithm 1012 associates each route-oriented vehicle trajectory to a corresponding road segment. This algorithm 1012 finds the best match when given a road network and a trajectory as input. As mentioned, the map matching algorithm 1012 evaluates road segment candidates, determines observation and transmission probabilities, measures a distance between actual average speed and speed constraints of the path, and finds a best matching path for a trajectory. The landmark construction algorithm 1014 builds a landmark graph based on input of a road network, a trajectory information from archive or the route and landmark database 116, a number of landmarks, and a threshold for determining the edge support.
The memory 1002 in this implementation may also include routing algorithms 1016. The routing algorithms 1016 include the initial routing algorithm which uses the landmark graph, the starting point and the destination points nearest landmarks of start and destination as the input. As a result, the initial routing algorithm outputs a fast path on the landmark graph. The routing algorithms may also include the refined routing algorithm. The input may include the road network, the start point and the destination point of user-specified query, and initial routing result. The output is a refined fast route.
The server 112 may include the route and landmark database to store the collection of GPS logs, trajectories, landmark graphs, initial routes, and the like. Alternatively, this information may be stored on other databases
The server 112 may also include additional removable storage 1018 and/or non-removable storage 1020. Any memory described herein may include volatile memory (such as RAM), nonvolatile memory, removable memory, and/or non-removable memory, implemented in any method or technology for storage of information, such as computer-readable instructions, data structures, applications, program modules, emails, and/or other content. Also, any of the processors described herein may include onboard memory in addition to or instead of the memory shown in the figures. The memory may include storage media such as, but not limited to, random access memory (RAM), read only memory (ROM), flash memory, optical storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by the respective systems and devices.
The server as described above may be implemented in various types of systems or networks. For example, the server may be a part of, including but is not limited to, a client-server system, a peer-to-peer computer network, a distributed network, an enterprise architecture, a local area network, a wide area network, a virtual private network, a storage area network, and the like.
Various instructions, methods, techniques, applications, and modules described herein may be implemented as computer-executable instructions that are executable by one or more computers, servers, or computing devices. Generally, program modules include routines, programs, objects, components, data structures, etc. for performing particular tasks or implementing particular abstract data types. These program modules and the like may be executed as native code or may be downloaded and executed, such as in a virtual machine or other just-in-time compilation execution environment. The functionality of the program modules may be combined or distributed as desired in various implementations. An implementation of these modules and techniques may be stored on or transmitted across some form of computer-readable media.
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described. Rather, the specific features and acts are disclosed as exemplary forms of implementing the claims.

## Claims

1. A method implemented at least partially by a processor, the method comprising:
collecting a sequence of global positioning system (GPS) points from route-oriented vehicle logs;
identifying geographical locations from the route-oriented vehicle logs, the geographical locations representing locations where route-oriented vehicles travelled as recorded in the vehicle logs;
extracting route-oriented vehicle trajectories from the route-oriented vehicle logs, the route-oriented vehicle trajectories representing individual trips; and
constructing a landmark graph based at least in part on the route-oriented vehicle trajectories by:
associating each route-oriented vehicle trajectory to a corresponding road segment;
determining a first frequency that a first road segment is visited by the route-oriented vehicles and at least a second frequency that other road segments are visited by the route-oriented vehicles, the first frequency being determined based on a number of the route-oriented vehicle trajectories that are associated with the first road segment, and the second frequency being determined based on a number of the route-oriented vehicle trajectories that are associated with the other road segments;
comparing the first frequency to the second frequency; and
identifying a landmark, the landmark being the first road segment when the first frequency is greater than the second frequency.

2. The method of claim 1, wherein the first road segment is a directed edge that is associated with a direction symbol, two terminal points, and a list of intermediate points describing the road segment with a polyline.

3. The method of claim 1, further comprising:
determining whether a time interval between two consecutive GPS points meets or exceeds a predetermined threshold; and
partitioning the two consecutive GPS points into two different trajectories based on whether the time interval between the two consecutive GPS points meets or exceeds the threshold.

4. The method of claim 1, further comprising dividing the route-oriented vehicle trajectories into separate trajectories when a stay point is identified, the stay point representing a geographical region in which a route-oriented vehicle remained within a threshold distance for a threshold time period.

5. The method of claim 1, wherein the associating each route-oriented vehicle trajectory to a corresponding road segment comprises:
identifying candidate road segments and correlating the candidate road segments to candidate projection points;
detecting the candidate projection points on candidate edges;
identifying a probability that a GPS point matches a candidate point computed based on a distance between two points;
identifying a list of road segments based on determining a shortest path from a first candidate projection point to a second candidate projection point;
generating a candidate graph for the route-oriented vehicle trajectory with a set of candidate projection points and a set of edges to represent the shortest paths between neighboring candidate points; and
determining a road segment that matches the trajectory.

6. The method of claim 1, wherein the constructing the landmark graph further comprises:
computing a number of route-oriented vehicle trajectories that connect any of the landmarks; and
connecting the landmarks with a landmark edge when there is at least a subset of the route-oriented vehicle trajectories passing through the landmarks, the landmark edge to represent travels between the landmarks by the route-oriented vehicles.

7. The method of claim 1, further comprising:
determining a median time cost for travelling on a landmark edge, the landmark edge to connect one landmark to another landmark.

8. The method of claim 1, further comprising:
receiving a user query with a starting point and a destination point for directions;
searching the landmark graph for an initial route that is represented by a sequence of landmarks with corresponding transition times and a least amount of travel time;
computing a set of connected road segments between each pair of consecutive landmarks of an initial route; and
providing data indicating a route including the directions with landmarks from the starting point to the destination point.

9. One or more computer-readable media encoded with instructions that, when executed by a processor, perform acts comprising:
presenting a user interface on a display of a portable electronic device, the user interface to access a service application that provides map-based services;
receiving user input to the user interface indicating a starting location and a destination location;
accessing a landmark graph constructed from route-oriented vehicle trajectories, a landmark being identified when a first frequency of route-oriented vehicles visiting a road segment is compared to a second frequency of route-oriented vehicles visiting a second or subsequent road segment and the first frequency is greater than the second frequency;
computing an initial path, based on the starting location and the destination location, between each pair of consecutive landmarks of the initial path; and
refining the initial path by finding a route that sequentially connects the landmarks, from the starting location to the destination location.

10. The computer-readable media of claim 9, in response to the initial path, further comprising:
calculating additional paths from the starting location to each terminal point of the landmarks on the initial path; and
determining the additional paths for unidirectional and bidirectional road segments.

11. The computer-readable media of claim 9, further comprising:
searching the landmark graph for the initial path based on a sequence of landmarks with corresponding transition times between the landmarks and a least amount of travel time; and
visually presenting the route to a user, the route illustrating a nearest landmark to the starting location, any landmarks along the route, and another nearest landmark to the destination location.

12. The computer-readable media of claim 9, further comprising:
collecting the route-oriented vehicle logs that include a sequence of global positioning system (GPS) points from the variety of route-oriented vehicles;
determining geographical locations from the route-oriented vehicle logs, the geographical locations to represent regions where the variety of route-oriented vehicles have travelled as recorded in the vehicle logs; and
segmenting the geographical locations into the road segments, a road segment including a directed edge that is associated with a direction symbol, two terminal points, and a list of intermediate points describing the road segment with a polyline.

13. The computer-readable media of claim 9, further comprising:
extracting route-oriented vehicle trajectories from route-oriented vehicle logs, the route-oriented vehicle logs are represented with a sequence of global positioning system (GPS) points from the variety of route-oriented vehicles engaged in business related transportation;
representing individual trips based on a sequence of road segments with transition times with route-oriented vehicle trajectories;
determining when a time interval between two consecutive GPS points is greater than or less than a predetermined threshold:
in an event that the time interval between two consecutive GPS points is greater the predetermined threshold, partition the two consecutive GPS points into two different trajectories; or
in an event that the time interval between the two consecutive GPS points is less than the predetermined threshold, use the two consecutive GPS points in a trajectory.

14. The computer-readable media of claim 9, further comprising determining when to partition route-oriented vehicle logs into the route-oriented vehicle trajectories based on a stay point, the stay point represents a geographical region in which the route-oriented vehicle remained within a threshold distance for a threshold time period.

15. The computer-readable media of claim 9, further comprising constructing the landmark graph based at least in part on the route-oriented vehicle trajectories by:
matching each route-oriented vehicle trajectory to a corresponding road segment;
representing the landmark as a vertex on the landmark graph; and
connecting at least two vertices with a landmark edge, the landmark edge to represent travels between the at least two vertices by at least a subset of the variety of route-oriented vehicles by a number of times greater than a threshold.

16. A system comprising:
a memory;
one or more processors coupled to the memory having instructions to perform acts comprising:
receiving user input indicating a starting location, a destination location, and a time of day and a category of day;
accessing a landmark graph stored in a database, the landmark graph identifying landmarks on the landmark graph, landmarks being identified as road segments having a threshold frequency of visits by a variety of vehicles, the threshold frequency being greater than the frequency of visits by a variety of vehicles on other road segments;
searching the landmark graph for an initial route based on a sequence of landmarks and a least amount of travel time based at least in part on the starting location and the destination location;
calculating an initial path between each pair of consecutive landmarks of the initial route; and
presenting the initial route with nearest landmark to the starting location, landmarks along the route, and another nearest landmark to the destination location for the time of day and the category of day as specified.

17. The system of claim 16, further comprising:
collecting vehicle logs, which include a sequence of global positioning system (GPS) points from the variety of vehicles;
extracting vehicle trajectories from the vehicle logs, the vehicle trajectories representing individual trips made by the variety of vehicles;
partitioning the vehicle trajectories made by the variety of vehicles into multiple partitions according to times of day and categories of days; and
generating landmark graphs of landmarks for each of the multiple partitions, wherein the accessing accesses the landmark graph associated with the time of day and the category of day.

18. The system of claim 16, further comprising partitioning the vehicle trajectories into multiple parts based on a time of a day and a category of day.

19. The system of claim 16, further comprising computing paths between each pair of consecutive landmarks of the initial route, a path is a set of connected road segments.

20. The system of claim 16, further comprising:
associating each vehicle trajectory to a corresponding road segment; and
specifying a road segment visited at a greater frequency relative to another road segment as a landmark, the greater frequency being determined based on a number of vehicle logs for the landmark.