# Patent

## Title
Collaborative route planning for generating personalized and context-sensitive routing recommendations

## Abstract

A route-planning system is described that leverages a database of observations about routes taken by drivers in a region to generate context and/or preference sensitive routes. Contextual information such as time of day and day of week, along with such findings as the observed velocities on different roads and the efficiency of trips is noted from the database of trips to inform a route generation component. The route-generation component considers velocities, contextual information, and other findings to compute preferred routes for people requesting directions from a first geographical point to a second geographical point. In one usage, properties of a driver's own prior routes are used to generate personalized routes, including routes between previously unobserved starting and ending locations. In another application, sets of observed routes of other drivers are used in a collaborative manner to generate recommended routes for a specific driver based on inferred preferences of the driver.

## Background
BACKGROUND
Computer-driven route planning applications are utilized every day to aid users in locating points of interest, such as particular buildings, addresses, and the like. Additionally, in several existent commercial applications users can vary a zoom level, thereby enabling variation of context and detail as a zoom level of a map is altered. For example, as a user zooms in on a particular location, details such as names of local roads, identification and location of police and fire stations, identification and location of public services, such as libraries, museums, and the like can be provided to the user. When zooming out, the user can glean information from the map such as location of the point of interest within a city, state, and/or country, proximity of the point of interest to major freeways, proximity of the point of interest to a specific city, and the like. In some applications, satellite images can be utilized to provide users with additional detail regarding a particular geographic location or region. For example, a prospective purchaser of a house can obtain an overhead satellite image of the house, thereby enabling the prospective purchaser to view lines of occupation, proximity of the house to other adjacent houses, and other information that may be pertinent to the user.
Furthermore, conventional computer-implemented mapping applications often include route planning applications that can be utilized to provide users with directions between different locations. Pursuant to an example, a user can provide a route planning application with a beginning point of travel and an end point of travel (e.g., beginning and ending addresses). The route planning application can include or utilize representations of roads and intersections and one or more algorithms to output a suggested route of travel. These algorithms can output routes depending upon user-selected parameters. For instance, a commercial route planning application can include a check-box that enables a user to specify that she wishes to avoid highways. Similarly, a user can inform the route planning application that they wish to travel on a shortest route or a route that takes a least amount of time (as determined by underlying algorithms). Over the last several years, individuals have grown to increasingly rely on route planning applications to aid them in everything from locating a friend's house to planning cross-country road trips.
In the general case, a set of feasible streets are considered and a search algorithm is used to create a route that optimizes some objective function such as minimizing total distance or time to travel between two points. To perform optimization, a search method is applied to search among and to identify best routes between two or more locations. Search methods include comprehensive combinatorial search, or more efficient methods such as the Dykstra search algorithm, or A* search.
Route planning applications are also no longer confined to desktop computers. Rather, many automobile models are now equipped with standard mapping functionality, wherein the automobiles include graphical displays on a console to provide mapping data and directions to a user. Oftentimes, a compact disk or other storage medium that includes data to enable utilization of route-planning functionality must be purchased and loaded prior to use of the route planning application. As road conditions change, such as speed limits, number of lanes, etc., updates can be provided. Automobiles with GPS functionality (or other location identifying functionality) can additionally include real-time directions, wherein directions are provided to users of the automobile while they travel.
These route planners are fairly reliable in connection with details such as posted speed limits, location of one-way streets, and related information. However, conventional applications that include route-planning functionality make assumptions regarding the state of roads. With more specificity, today's route planning applications are built around assumptions of constancy and universality, such that optimal routes provided by the applications are independent of time of day, day of week, and detailed user preferences. In actuality, however, these assumptions do not hold. For example, in many instances, a best route between two points during rush hour in an urban area is not an optimal route at midnight between the same two points. Conventional route planning applications, however, do not take such context into account when providing routes for users. Similarly, different drivers may prefer different routes between the same two points. For example, one driver may avoid highways or particularly difficult merges, or is willing to extend duration of a journey by a few minutes in order to follow a scenic coastal road, while the other driver simply wants to arrive as quickly as possible or to traverse the shortest distance.
SUMMARY
The following presents a simplified summary in order to provide a basic understanding of some aspects of the claimed subject matter. This summary is not an extensive overview, and is not intended to identify key/critical elements or to delineate the scope of the claimed subject matter. Its sole purpose is to present some concepts in a simplified form as a prelude to the more detailed description that is presented later.
The route planning systems and methods described herein enable driving directions, which are not static with respect to context and user preferences, to be provided to users. Rather, driving directions can be created that are at least partially dependent upon contextual information associated with a driver's journey, wherein the contextual information can include time of day, day of week, weather conditions, whether a day is a holiday, existence of events (such as sporting events and/or concerts in a region), and any other suitable contextual information. As is known by commuters driving through highly congested regions during rush hour, time of day and day of week can have a significant impact upon traffic flows over particular roadways. Thus, utilizing features described herein, different driving directions can be provided at different times between the same two geographic points given altering contexts. More particularly, described herein are systems and/or methods for harnessing data collected about context-sensitive routes taken by drivers and utilizing such data to generate recommendations for routes based upon the contextual information, inferred or known preferences, or combinations of preferences and contextual information.
Additionally, conventional route planning systems do not take into account detailed user preferences. For instance, drivers do not always prefer to take a route that is deemed the fastest and/or shortest between two locations. Pursuant to an example, a driver may willingly extend their journey to avoid merging at a particular location. Route planning systems/methods described herein enable drivers to be associated with one or more driving profiles, wherein such profiles may be associated with detailed driver preferences. For example, one profile may represent drivers that always wish to travel along a route that will take a least amount of time, while another profile may represent drivers that prefer to somewhat extend their journey to drive on roads deemed as being scenic. Yet another profile can represent drivers who wish to avoid busy merges onto freeways at all costs.
A user can be associated with a driving profile by monitoring their activity. For instance, if the user's automobile is associated with a GPS sensor, then such user's driving activity can be tracked over time and their driving preferences can be inferred. In another example, the user's demographics may be indicative of how he/she should be profiled. If the user is in their seventies, then they typically will be less willing to drive on fast-moving and highly congested road segments than a driver in his/her twenties. Furthermore, there may be a correlation between web sites visited, demographic information, and driving preferences. It is thus understood that any suitable data relating to a user can be collected and utilized to infer driving preferences of the user. Driving directions can then be output based at least in part upon contextual data and inferred user preferences. Thus, the route planning systems/methods described herein can provide users with driving directions that are predictive of routes that such users would have taken if they were aware of all available routes between provided geographic locations.
To enable such robust creation of driving directions, a detailed and sophisticated representation of a traffic system can be employed. Such representation can include, for example, a graph that comprises edges that are representative of road segments and nodes that are representative of intersections. The nodes and edges of the graph can then be weighted through collection and analysis of data taken from actual drivers in a traffic system. For instance, the graph can be weighted by monitoring speeds associated with drivers over particular road segments with respect to different contexts. Therefore, weights within the graph can alter as context alters, just as traffic flow over certain road segments alters as context alters. Additionally, edges and nodes within the graph can be weighted based at least in part upon detailed user preferences. Thus, for instance, two different users can request driving directions between the same two geographic regions at the same time but be provided with different driving directions.
To the accomplishment of the foregoing and related ends, certain illustrative aspects are described herein in connection with the following description and the annexed drawings. These aspects are indicative, however, of but a few of the various ways in which the principles of the claimed subject matter may be employed and the claimed matter is intended to include all such aspects and their equivalents. Other advantages and novel features may become apparent from the following detailed description when considered in conjunction with the drawings.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a high-level block diagram of route planning system that can create driving directions based at least in part upon contextual data.
FIG. 2 is a block diagram of a route planning system that can create driving directions based at least in part upon inferred user driving preferences.
FIG. 3 is a block diagram of a route planning system that can create driving directions based at least in part upon data received from a plurality of data sources.
FIG. 4 is a block diagram of a route planning system that can be updated as road conditions alter.
FIG. 5 is a block diagram of a system that can be utilized to create a context-dependent representation of a traffic system.
FIG. 6 is a block diagram of a system that can be utilized to create a user-driving preference dependent representation of a traffic system.
FIG. 7 is a block diagram of a system that can be utilized to assign a driving profile to a user.
FIG. 8 is a representative flow diagram of a methodology for creating driving directions that can vary as context changes.
FIG. 9 is a representative flow diagram of a methodology for creating driving directions that are based at least in part upon inferred driving preferences of a user.
FIG. 10 is a representative flow diagram of a methodology for creating a context-dependent representation of a traffic system.
FIG. 11 is a representative flow diagram of a methodology for defining user profiles.
FIG. 12 is a graphical illustration of routes driven by a user familiar with a locale versus routes output by conventional route planning applications.
FIG. 13 is a graphical illustration of collected data points that are mapped onto a graph of a traffic system.
FIGS. 14 and 15 are screenshots that illustrate optimal routes given different times of day.
FIG. 16 is a schematic block diagram illustrating a suitable operating environment.
FIG. 17 is a schematic block diagram of a sample-computing environment.



DETAILED DESCRIPTION
The subject invention is now described with reference to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the claimed subject matter. It may be evident, however, that such subject matter may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing the subject invention.
As used in this application, the terms “component” and “system” are intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and a computer. By way of illustration, both an application running on a server and the server can be a component. One or more components may reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers. The word “exemplary” is used herein to mean serving as an example, instance, or illustration. Any aspect or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects or designs.
Furthermore, aspects of the claimed subject matter may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques to produce software, firmware, hardware, or any combination thereof to control a computer to implement various aspects of the subject invention. The term “article of manufacture” as used herein is intended to encompass a computer program accessible from any computer-readable device, carrier, or media. For example, computer readable media can include but are not limited to magnetic storage devices (e.g., hard disk, floppy disk, magnetic strips, optical disks (e.g., compact disk (CD), digital versatile disk (DVD), . . . ), smart cards, and flash memory devices (e.g. card, stick, key drive, . . . ). Additionally it should be appreciated that a carrier wave can be employed to carry computer-readable electronic data such as those used in transmitting and receiving electronic mail or in accessing a network such as the Internet or a local area network (LAN). Of course, those skilled in the art will recognize many modifications may be made to this configuration without departing from the scope or spirit of what is described herein.
Referring now to FIG. 1, a route planning system 100 is illustrated that takes into consideration current or predicted context associated with a requested route as well as detailed driving preferences associated with a user. The system 100 can be resident upon a server that is accessible by way of a network (e.g., the Internet), can be resident within an automobile, can be retained within a client, such as within a portable device, or any other suitable location. The system 100 includes a receiver component 102 that is configured to receive a request for driving directions between a point of beginning and a destination. For example, the request can receive an initial address or location and an end address and location. Moreover, the receiver component 102 can receive and analyze textual (e.g., typed) requests, spoken requests, or any other suitable requests. Thus, the receiver component 102 can be associated with voice recognition hardware/software that enables voice commands to be received, parsed, and interpreted.
The route planning system 100 further includes a context analyzer component 104 that analyzes context associated with the received request. For instance, the context analyzer component 104 can analyze time of day associated with the request, wherein the time of day can be assumed to be a time that the receiver component 102 receives the request or a time in the future that travel will take place (e.g., provided by the initiator of the request). Additionally, the context analyzer component 104 can determine/receive contextual information such as day of a week, whether a day is a weekday or weekend, whether a day is a holiday, current or forecasted weather conditions, current status of roadways within a traffic system (e.g., whether and where an accident has occurred), and any other suitable contextual data. In contrast to conventional route planning systems, the route planning system 100 can output directions between points that are based at least in part upon current, future, predicted, and/or inferred contextual data. Thus, a route/directions output by the route planning system 100 between the same two points may vary depending upon time of day, day of week, and the like. Accordingly, the route planning system 100 is much more robust than conventional route planning systems.
Such robustness is enabled through utilization of a route planning model 106 that is based at least in part upon collected data. As will be described in more detail below, data can be collected from vehicles operated by particular drivers over time, and such information can be utilized in connection with modeling a traffic system. Further, the collected data can be analyzed in light of disparate contexts associated with when the data was collected. Additionally, profiles can be defined that are representative of particular types of drivers, and the route planning system 100 can output routes based at least in part upon a profile associated with a requesting user. For example, a particular individual may attempt to avoid busy merges on freeways, and a profile can be defined that corresponds to such driving preference. The route planning system 100 can determine a profile of an individual requesting directions through explicitly provided driving preferences and/or implicitly through monitoring actions of the individual in connection with demographics associated therewith. For example, drivers at or near retirement age may be less likely to wish to travel on busy freeways than drivers in their mid twenties. These profiles can be defined based upon analysis of data collected from drivers in a region where they are familiar with the traffic system (thus indicating how they prefer to drive). Creation of the route planning model 106 and definition of profiles is described in more detail infra.
In operation, the receiver component 102 can receive a request for a route (directions) between two provided points, which can be addresses, cities, monuments, and the like. Upon receipt of such request, the context analyzer component 104 can receive/retrieve contextual information that is associated with the request as well as user-centric information that may aid in profiling the user's driving preferences, such as demographic information, answers to a driving questionnaire, etc. The route planning model 106, which can include a graph of one or more traffic systems, can then be accessed and analyzed in light of the received request, context, and user-centric information. For example, the route planning model 106 can include a weighted graph where nodes represent intersections and edges represent at least portions of roadways. The edges can be weighted differently depending upon context and user, such that different users providing requests between the same two points at different times may be provided with different directions. It is understood, however, that the route planning model 106 can be or include any suitable model of a traffic system. The route planning system 100 can then output the determined route to the requesting user. The system 100 therefore can output directions that are predictive of the route a particular user would take if they were familiar with at least a vast majority of possible routes between a provided beginning and destination point.
With more specificity, data can be collected from drivers who are familiar with an area during different contexts (e.g., at different times of day and days of the week). Such information is then utilized by the system 100 to enable naïve drivers (or drivers unfamiliar with a particular portion of a traffic system) to leverage such information. In other words, directions can be provided to a user, wherein such directions can be reflective of a route the user would travel if they were familiar with the road system they are traveling upon. Thus, the expertise of the masses can be employed to render the system 100 more insightful with respect to assisting individuals who may not have a great deal of knowledge regarding a particular traffic system. As more data is collected with respect to a particular user (e.g. types of roads the user travels given different contexts), the data collected from other drivers can be still more useful in connection with creating driving directions for such user. Thus, subtle (inferred or explicitly provided) driver preferences can be taken into account by the system, such that two individuals who request directions between the same two points at the same instance in time may be provided different directions. For example, it can be inferred that a first user prefers not to travel over highways while a second user only cares to take the route that will cause him to traverse between two points in a least amount of time. Accordingly, the system 100 can take into account such subtle preferences when outputting routes.
Turning now to FIG. 2, a route planning system 200 that can output directions that are based at least in part upon contextual information and detailed user preferences is illustrated. The system 200 includes the receiver component 102 that receives a request for directions between two geographic points, which can be addresses, monuments, cities, longitude/latitude points, etc. The receiver component 102 can additionally receive user-centric data that may be indicative of driving preferences. For example, the receiver component 102 can receive demographic information associated with the requesting user, wherein such information may be indicative of driving preferences of the user. Similarly, the receiver component 102 can receive a search log from the Internet, as there may be a correlation between searches and how a user prefers to drive. In a particular example, upon analyzing searches and driving habits it may be discerned that individuals searching for sports information tend to wish to take a fastest route between two points regardless of road type, while individuals searching for political news prefer scenic routes.
The system 200 additionally includes the context analyzer component 104 that analyzes context associated with the received request. For instance, as described above, the context analyzer component 104 can analyze the received request in connection with time of day, day of week, whether an event is being held within a traffic system, current and/or forecasted weather conditions, and the like. A profile matching component 202 can analyze received user-centric data and match such data to one or more profiles 204 that are resident within a data repository 206. For example, the profiles 204 can include a profile for drivers that prefer scenic routes, a profile for drivers that prefer a fastest route at all times, a profile for drivers that prefer to avoid busy freeways, a profile for drivers that prefer to avoid busy intersections and/or busy merges, and various other profiles. It is thus understood that numerous profiles of any suitable granularity can be stored within the data repository 206 and are accessible by the profile matching component 202 based upon received/stored user-centric data.
Once the request has been received, context associated with the request has been analyzed, and the requesting user has been profiled, the route planning model 106 can be accessed in connection with outputting a route that takes into consideration context associated with the request and detailed user driving preferences. As alluded to above, the route planning model 106 can include a graph that is representative of a traffic system, wherein edges and/or nodes can be weighted to enable estimation of an amount of time it will take a driver to travel over segments of roadways and/or intersections. The weights associated with the graph can vary depending upon time. For instance, driving over a particular road segment during rush hour may take much more time than driving over the same segment of road at midnight. Additionally, weights within the route planning model 106 can be altered based upon user-centric data. For instance, if the requesting user refuses to drive on busy freeways, the weight associated with a busy freeway can be weighted at or close to infinity. Once the weights have been assigned given the contextual data and an assigned profile, an algorithm (not shown) can be utilized to determine a least-weighted route between the two points provided in the received request. This route can then be provided to the requesting user (by way of, for example, a graphical user interface).
Referring now to FIG. 3, a route planning system 300 is illustrated. The route planning system 300 includes the receiver component 102 that receives a request for directions from a first geographic location to a second geographic location. The context analyzer component 104 determines a context associated with the request, wherein the context can include, for example, time of day, day of week, whether the day is a holiday, etc. The system 300 can additionally include a data collection component 302 that is utilized to collect detailed contextual data and/or user-centric data. For instance, the data collection component 302 can be communicatively coupled to a plurality of data sources 304-308, which can be sensors, web pages, radio programs, and the like. Pursuant to an example, the user initiating the route request can have a calendar application on a computer, and the data source 304 may be such calendar. The data collection component 302 can receive appointments from the calendar and the profile matching component 202 (FIG. 2) can utilize such data in connection with determining an appropriate profile for the user. For instance, typically the user may wish to drive over scenic routes; however, the appointment in his calendar may require that such user take a route to a destination that takes a least amount of time (when compared to other available routes).
The data sources 304-308 can be any suitable data sources. For instance, the data source 306 can be sensors associated with a roadway that indicate current traffic conditions. In another example, the data source 306 can be a website that describes current/forecast weather conditions. Still further, the data source 304 may be a radio station that announces traffic accidents, wherein the data collection component 302 can understand and interpret particular words relating to such accidents. Thus, the data collection component 302 can receive/retrieve data that is pertinent to a particular user's route and/or user preferences. The route planning model 106 can be updated according to the received data. For instance, as described above, the route planning model 106 can include a weighted graph, wherein the weights indicate cost to a user associated with particular road segments/intersections. The cost can be based at least in part upon expected time associated with traveling over road segments and/or through intersections and/or based at least in part upon user driving preferences. Once updated, the route planning model 106 can be employed to output a route/directions to a user that takes into consideration contextual data and detailed user driving preferences.
Referring now to FIG. 4, a route planning system 400 that outputs directions between two geographic locations based at least in part upon contextual data and user driving preferences is illustrated. The route planning system 400 includes the receiver component 102, the context analyzer component 104, and the route planning model 106, which can act in conjunction as described above. The system 400 can additionally include an updating component 402 that is employed to update the route planning model 104 as traffic systems alter. For instance, traffic systems are not static; rather, they are subject to significant change over time. Pursuant to an example, construction on a freeway can cause a typically free-flowing road segment to be associated with significant and long-lasting bottlenecks. Similarly, a two lane road that is altered to a four lane road may cause traffic to flow more smoothly. Still further, continued road degradation may make it undesirable to travel upon a particular segment of roadway. The updating component 402 can be employed to update the route planning system 400 as conditions associated with roadways alter.
Pursuant to an example, the updating component 402 can be communicatively coupled to a plurality of sensors 404-408, which can be, for example, GPS sensors associated with automobiles, a device that can determine location/rate of speed of a user by using triangulation in connection with a mobile communications device (such as a cellular telephone), and the like. Data from such sensors 404-408 can be analyzed by the updating component 402, which can in turn update the route planning model 106 based at least in part upon the analysis. For instance, if the route planning model 106 includes a weighted graph, the updating component 402 can update the weights as conditions within a traffic system modeled by the route planning model 106 alter. Therefore, if in actuality a road segment becomes associated with greater amounts of traffic, such change in traffic will be reflected within the route planning model 106. Additionally, the updating component 402 can be utilized to update the route planning model 106 with newly added streets, take into consideration newly erected stop signs or newly functioning stop lights, etc. Therefore, the route planning model 106 can accurately reflect real-world alterations to a traffic system. The route planning system 400 can thus continue to output directions/routes to users that reflect current traffic conditions.
Referring now to FIG. 5, a system 500 for building the route planning model 106 is illustrated. The system 500 includes a data repository 502 that includes sensed time-series data 504, wherein such data can be collected from a plurality of drivers as they travel through a traffic system. For example, the sensed time-series data 504 can be obtained by associating location-determining sensors (such as GPS receivers) with a plurality of drivers in a traffic system (e.g., a metropolitan traffic system). As data is generated from the sensors, such data can be associated with time-stamps. Thus, trace logs for each respective driver associated with the location-determining sensor(s) are generated and can be placed within the sensed time-series data 504. Additionally, the sensors can be configured to record/output data only when a vehicle is in motion, and can automatically cease recording/outputting after the vehicle is immobile for a threshold time and/or when the vehicle is shut off. The sensors can again record/generate data when the vehicle associated therewith begins to travel. A segmentation component 506 can be employed to discern when individual journeys stop and start. As sensors associated with automobiles stop recording when the automobiles stop moving for a threshold amount of time, most (but not all) individual journeys taken by the drivers can be identified by the segmentation component 506 through reviewing time gaps that appear in the sensor logs.
Some situations exist, however, where it may not be easy to discern where a journey started and stopped. For example, a driver may stop for a short period of time to drop off a passenger. To locate such situations, for example, the segmentation component 506 can analyze logs within the sensed time-series data to determine when a loop has been made (e.g., from location A to location B to location A). If the segmentation component 506 detects a loop, then a segmentation point can be chosen at a point in the loop that is physically furthest from where the loop closes.
As described above, the route planning model 106 can include a graph, where nodes in the graph represent intersection of roads and edges are roads themselves. A single road may be represented by multiple edges, as each road segment (the smallest unbroken portion of a road between two intersections) can be a separate edge in the graph. Additionally, the edges and nodes can be associated with latitudes and longitudes of roads that they represent. Once the sensed time-series data 504 has been segmented into individual journeys, such journeys can be “snapped” to the graph within the route planning model 106. This may be problematic in that, for example, noise can be associated with GPS signals. Additionally, the graph may be imperfect; for instance, two different maps may pinpoint a particular latitude/longitude position at slightly different locations relative to surrounding features in each representation. Thus, the sensed time-series data 504 when mapped to the route planning model 106 may not fit perfectly.
A snapping component 508 can be employed to “snap” each collected data point to an appropriate location represented within the route planning model 106. For instance, the snapping component 508 can snap each collected data point to an on-road location nearest to it, and trace logs can be reconstructed by connecting the on-road locations together by way of the shortest on-road paths between each consecutive pair. In another example, the snapping component 508 can employ a Hidden Markov Model in connection with snapping trace logs to a graph within the route planning model 106. Informally, the Hidden Markov Model can consider potential snaps for each raw piece of collected data oi, and can select a best on-road snap si for each such that a resulting sequence of on-road locations is as smooth as possible while maintaining proximity between the raw data and respective snapped locations. The set of possible snap locations for a single raw piece of sensed data (e.g., GPS point) oi is created by collecting, for each road segment within a threshold distance of oi, a location si for each road segment that is most proximate to oi. Several candidate si locations can result where a road network is dense while fewer result in areas of sparse road coverage.
Formally, the Hidden Markov Model that can be employed by the snapping component 508 can define the following joint probability over sequences of raw and snapped sensed locations (O and S, respectively), from which a maximum-probability sequence of snapped locations for a particular trace log can be deduced using the standard Viterbi algorithm:




  
    P
    ⁡
    
      (
      
        S
        ,
        O
      
      )
    
  
  =
  
    
      ∏
      i
    
    ⁢
    
      
        P
        ⁡
        
          (
          
            
              o
              i
            
            |
            
              s
              i
            
          
          )
        
      
      ⁢
      
        P
        ⁡
        
          (
          
            
              s
              i
            
            |
            
              s
              
                i
                -
                1
              
            
          
          )
        
      
    
  




The first term in the product is the observation probability: how likely would the observation oi have been if, for example, the GPS receiver had actually been at on-road location si? This probability can be given by error characteristics of GPS receivers, for example, modeled as a zero-mean Gaussian with a standard deviation of a particular distance (e.g., 10 meters). The second term in the product is the transition probability: how likely would the on-road location si have been if the sensing device was known to be at location si-1 when the previous measurement was recorded? This can be defined as the fraction





  
    a
    b
  
  ,




where a is the straight-line distance from si-1 to si and b is the length of the shortest on-road path between the same. Such a definition may penalize transitions that round corners, emphasizing the idea that turns are relatively rare during travel. The false “penalty” incurred by two consecutive points on a curved road is negligible because location data can be collected at relatively high frequency (e.g., every six seconds or less). Additionally, transitions between distant snap locations can be penalized, since generally there is no on-road, straight-line path between them. It can be noted that





  
    
      a
      b
    
    <
    1
  
  ,




and the snapping component 508 can normalize such that transition probabilities emanating from each node of the Hidden Markov Model sum to one.

In another example, the snapping component 508 can use an alternative definition for the transition probability. Namely, a value can be assigned with magnitude that is inversely proportional to the number of “hops” (road segment transitions) in the transition. In this case, a pair of points for which the shortest on-road connecting path includes three road segments will have a lower probability than a pair of points on the same segment. Another alternative for transition probability is to use a single, fixed probability for transitions between points on the same road and separate, lower probability transitions for different roads. Defining such probabilities, however, can be a difficult task: a large ratio between two probabilities may result in on-road routes that remain on a single road to the point of ignoring collected data, while a small ratio may place too much emphasis on potentially noisy readings.
Once the trace logs are mapped into road segments, a speed analysis component 510 can associate different weights to edges/nodes within the graph of the route planning model 106 over different times. For example, the speed analysis component 510 can learn time-dependent traffic speed for roads by breaking days of the week into multiple categories and breaking such categories into several time slices. For purposes of illustration, it can be assumed that the speed analysis component 510 breaks the days of the week into two categories: weekdays and weekends. Such categories can then be broken into 96 time slices: 15-minute blocks of time covering 24 hours of the day. It is understood, however, that the speed analysis component 510 can create categories associated with any sort of contextual data. For instance, the speed analysis component 510 can create categories based upon weather conditions, holidays, and the like.
Continuing with the above example, the speed analysis component 510 can learn a separate average speed for each time-of-day and weekday/weekend breakdown by examining each pair (A, B) of consecutive GPS points in snapped traces. The average speed of a driver between each pair can be calculated, and the speed can be utilized to create a running average for every road segment traversed to get from A to B. Speed measurement can be applied to the running average associated with a block of time whose time characteristics match those of timestamps of collected data involved in the speed calculation. Thus, the speed analysis component 510 can determine speeds associated with road segments in various categories (time of day, day of week, . . . ). The speed analysis component 510 can then associated such data with the route planning model 106, such that edges and nodes are weighted based upon the collected data.
It can be discerned, however, that it may be impossible to obtain data for every road in a traffic system over every category. Thus, road speeds can be generalized given known road speeds of “similar” road segments. In more detail, a generalizer component 512 can analyze the route planning model 106 and provide speed values to road segments that are not associated with collected data for each category. For instance, for road segments and time segments where no data is available, the generalizer component 512 can assign the speed that is associated with the same road segment at an adjacent time block. If there is no speed associated with an adjacent time block, the generalizer component 512 can assign the segment a speed from a similar road and/or a system-wide average of speeds from similar roads, where similarity can be defined by road class within the route planning model 106. Additionally, similarity can be determined by analyzing speed limits, geographic proximity of road segments, geographic location of road segments, and the like. Still further, if similar roads cannot be located and/or if a system-wide speed average is unavailable, the speed for a time segment can be defined as the posted speed limit.
Referring now to FIG. 6, a system 600 that facilitates updating the route planning model 106 to take into account detailed user preferences is illustrated. The route planning model 106 as described above can produce routes that are, in expectation, faster to traverse, as road speeds are based upon collected data. Nevertheless, drivers are not always or necessarily concerned only with speed; their utility functions involve other variables. The system 600 enables such variables to be accounted for to personalize proposed routes to maximize implicit utilities of each driver. To provide such robustness in the route planning model 106, a profile definer component 602 can identify implicit preferences of users. To that end, the profile definer component 602 can treat each journey in a driver's trace log as a preference statement. In particular, the profile definer component 602 can assume that the route actually taken by a driver is preferred by that driver over any other route that he could have taken between same endpoints. For instance, if drivers associated with sensed data are familiar with the region, this assumption will typically hold true.
In one particular example, the profile definer component 602 can examine each trace within the sensed time-series data 504 and calculate an inefficiency ratio r, which can be defined as a ratio of the duration of a fastest route (in expectation) between the trace's endpoints (as determined through use of the segmentation component 506 and the route planning model 106, for example) and actual duration of the user's trip. Thus, the value of r will be between zero and one. In a rare instance that the driver's actual time was shorter than the expected time, the value for r can be capped at one. The meaning of r can most easily be understood in terms of its inverse, which is a value between one and infinity and represents a portion of time by which a driver has extended his/her journey beyond the shortest possible time in order to satisfy preferences unrelated to efficiency.
For each driver, the profile definer component 602 can calculate a personal inefficiency parameter r by averaging individual r values computed from each of the driver's traces. Like the r values, r will reside between zero and one. A value of one indicates that the driver typically takes the most efficient route, while lower values imply a higher willingness to sacrifice efficiency for other preferences. The profile definer component 602 can utilize r in the following utility function defining the driver-specific cost of traversing a particular road segment i:




  
    c
    i
  
  =
  
    {
    
      
        
          
            
              
                r
                _
              
              ⁢
              
                t
                i
              
              ⁢
              
                
              
              ⁢
              if
              ⁢
              
                
              
              ⁢
              i
              ⁢
              
                
              
              ⁢
              previously
              ⁢
              
                
              
              ⁢
              traversed
            
          
        
        
          
            
              
              ⁢
              
                
                  t
                  i
                
                ⁢
                
                  
                
                ⁢
                if
                ⁢
                
                  
                
                ⁢
                i
                ⁢
                
                  
                    
                  
                  ⁢
                  
                    
                  
                
                ⁢
                not
                ⁢
                
                  
                
                ⁢
                previously
                ⁢
                
                  
                
                ⁢
                traversed
              
            
          
        
      
      ,
    
  




where ti is an estimated time required to traverse segment i (dependent upon the time of traversal). The result is that a path using only non-traversed (non-preferred) edges and requiring x seconds to traverse is equivalent in cost to a path using only preferred (previously traversed) edges and requiring





  
    1
    
      r
      _
    
  
  ⁢
  x




seconds to traverse, since the discount of r to the latter path will result in a cost of





  
    
      
        r
        _
      
      ⁡
      
        (
        
          1
          
            r
            _
          
        
        )
      
    
    ⁢
    x
  
  =
  
    x
    .
  




This equivalence is consistent with the assumption that the user is willing to extend the duration of his/her trip by up to a factor of





  1
  
    r
    _
  




in order to satisfy preferences not related to efficiency. The cost function also reflects interpretation of driver histories as statements of preference by allowing the profile definer component 602 to reduce cost of previously used (preferred) edges.

The profile definer component 602 generates profiles through utilizing two major assumptions: 1) drivers associated with the sensed time-series data 504 are making informed choices and are not extending duration of journeys out of ignorance; and 2) drivers prefer roads they have previously taken. The profile definer component 602 can thus weight roads given the individuals preferences. These individuals can then be a base to employ in defining profiles for other users of a route planning system. For instance, drivers with preferences similar to those of a tracked driver can be assigned a profile associated with the tracked driver. Any suitable manner for creating a profile that can be mapped to members of the general public through utilization of the profile definer component 602.
Referring now to FIG. 7, a system 700 that enables a user to be mapped to a particular profile is illustrated, wherein the profile can cause weights associated with the route planning model 106 to be altered. The system 700 includes a monitoring component 702 that can monitor a user 704 over time, wherein the monitoring can include monitoring driving habits, monitoring Internet usage to determine or infer demographic information relating to the user, and the like. Monitored data can then be provided to a profile matching component 706 that is utilized to analyze the monitored data to map the user 704 to one or more available profiles 708. For example, as described above, drivers utilized in connection with creating a route planning system can be associated with personal preferences. A profile can be generated that is representative of such individuals, and later users of the system can be mapped to such profiles.
Referring now to FIGS. 8-11, methodologies in accordance with the claimed subject matter will now be described by way of a series of acts. It is to be understood and appreciated that the claimed subject matter is not limited by the order of acts, as some acts may occur in different orders and/or concurrently with other acts from that shown and described herein. For example, those skilled in the art will understand and appreciate that a methodology could alternatively be represented as a series of interrelated states or events, such as in a state diagram. Moreover, not all illustrated acts may be required to implement a methodology in accordance with the claimed subject matter. Additionally, it should be further appreciated that the methodologies disclosed hereinafter and throughout this specification are capable of being stored on an article of manufacture to facilitate transporting and transferring such methodologies to computers. The term article of manufacture, as used herein, is intended to encompass a computer program accessible from any computer-readable device, carrier, or media.
Referring specifically to FIG. 8, a methodology 800 for outputting directions to a user is illustrated, wherein such directions are predictive of a route that the user would take between points if the user were aware of all available routes between the points. The methodology 800 starts at 802, and at 804 a request for directions between two geographic points is received. For example, the points can be a beginning and ending address, beginning and ending cities, or any other suitable geographic points. At 806, a context associated with the request is analyzed. For instance, if the user indicates that they will be beginning a journey immediately after receiving directions, current context can be analyzed, including current day of the week, current time of day, current weather conditions, and the like. In another example, in the request the user can indicate which day of the week they will be traveling as well as what time they will be traveling. In such a case, a future context can be analyzed, including future day of week, future time of day, predicted weather conditions, etc.
At 808, user-centric data is analyzed. For instance, information indicative of driving preferences can be gleaned based upon the request and/or previously collected data. Pursuant to a particular example, generalizations can be made relating to driving preferences based at least in part upon age and sex of a driver. Specifically, older drivers are less likely to wish to travel through areas of high traffic congestion, and are willing to extend their journey with respect to time to avoid such high-congestion areas. In another example, GPS or other location-related data may be associated with a driver's vehicle, and such information can be received along with a request and/or accessed from a data repository. It is thus understood that any suitable data that may be indicative of driving preferences of the user providing the request can be received and analyzed. At 810, directions are output that are based at least in part upon the analyzed context and the user-centric data. The use of contextual data and user preferences provides significant improvements over conventional systems. For instance, a road segment may be congested at rush hour on weekdays but essentially free of traffic outside of rush hour and/or on weekends. Conventional route planning systems output same routes regardless of time of day, day of week, weather conditions, and the like. The methodology 800 completes at 812.
Now referring to FIG. 9, a methodology 900 for outputting driving directions based upon detailed/inferred user preferences is illustrated. The methodology 900 starts at 902, and at 904 user activity is monitored. The monitoring can include monitoring information that can be indicative of demographic information, such as types of websites, location of the user, home address of the user, etc. Additionally, the monitoring may include mileage on a car, miles driven per week, and the like, as miles driven may indicate a driver's comfort on freeways or high-congested areas. Still further, calendar information can be monitored to determine how quickly a user must travel between locations. It is thus understood that the monitoring of act 904 can be undertaken to receive/analyze any suitable data that may be indicative of driving preferences.
At 906, a request for driving directions is received from the user, wherein the request includes parameters that describe a journey desirably taken by the user (e.g., beginning and end point, time and data that the journey will occur, . . . ). At 908, one or more profiles are assigned to the user based at least in part upon the monitored user activity. For instance, numerous profiles can be defined wherein at least one of the profiles generally represents preferences associated with each user. At 910, contextual data that is associated with the request is analyzed, such as time of day that travel will occur, day of week that travel will occur, etc. At 912, driving directions are created/output based at least in part upon the assigned profile(s) and the contextual data associated with the request. This enables driving directions to be output that vary with different contexts and are tailored to user preferences; in other words, the driving directions are predictive of a route that the user would take given a certain context if the user were aware of all available routes between the points. After the driving directions are output, the methodology 900 completes at 914.
Turning now to FIG. 10, a methodology 1000 for defining parameters associated with a route planning model is illustrated. The methodology 1000 starts at 1002, and at 1004 trace logs with respect to a plurality of drivers are received. For instance, automobiles driven by the plurality of drivers can be equipped with GPS receivers (or other suitable location-tracking equipment), which can be configured to create/output location data while the automobile is running and/or moving and cease creating/outputting location data after the automobile has been at a standstill for a particular period of time. Collected data associated with each driver can be referred to as a trace log, as it is a log of their driving activities over a particular period of time.
At 1006, the trace logs are segmented so that each segment is representative of a journey undertaken by the driver. As described above, in most instances large time gaps may be indicative of a journey (as sensors cease creating/outputting data when the vehicle is not moving). Thus, the trace logs can be segmented based at least in part upon large time gaps within the trace logs. The trace logs can also be segmented by noting where a driver made a loop (e.g., started and stopped at a same location). In these instances, the trace log can be segmented with respect to the geographic point furthest from where the loop closes. At 1008, the resulting segments of the trace logs (that represent individual journeys by a driver) can be snapped to a representation of a traffic system model associated therewith. Thus, data points from the trace logs can be snapped to road segments that correspond to the data points. For example, a Hidden Markov Model can be employed in connection with such snapping.
At 1010, the snapped segments are categorized based upon context. For instance, the snapped segments can be associated with day of a week, time of day, weather conditions when the data was collected, whether a sporting event was undertaken when the data was collected, and any other suitable number of categories. At 1012, average speeds for road segments that are associated with the snapped segments are determined for each category. A road segment can be defined as a portion of road between intersections. Thus, different average road speeds for a same road segment can be calculated for different times of day, days of week, weather conditions, events, etc. At 1014, average speeds are assigned to road segments and/or categories where it is not possible to calculate average road speeds using collected data. For instance, data may not be received with respect to a particular segment of road at 3:00 a.m. Thus, the average speeds can be assigned by analyzing similar roads and assigning similar speeds based upon the analysis. In one particular example, a road segment can be assigned similar speeds that are assigned to the same road segment with respect to different categories. Posted speed limits can also be utilized in connection with assigning average speeds to road segments with respect to certain categories. Once average speeds have been assigned to road segments within the traffic system, a robust, context-sensitive model of the traffic system can be created. The methodology 1000 then completes at 1016.
Now turning to FIG. 11, a methodology 1100 for creating a profile that is reflective of one or more drivers' preferences is illustrated. The methodology 1100 starts at 1102, and at 1104 segmented trace logs are analyzed to determine which route a user employed to travel between two geographic points. As described above, segmented trace logs indicate a journey taken by a driver, including a beginning point and an endpoint. At 1106, a comparison is made with respect to the most efficient route a driver could have taken (given contextual information when the driver traveled along the route) and the route the driver actually undertook. Therefore, assuming that the driver was aware of alternate routes, traveling a route that is not the most efficient route is indicative of driving preferences associated with the driver. Over time, continued analysis and comparison of routes taken by the driver and most efficient routes can enable profiling of one or more drivers. For instance, if most efficient routes involve traveling over busy merges and the driver consistently takes less efficient routes by avoiding the merges, it can be determined that the driver prefers not to travel over any busy merges. At 1108, weights associated with a route planning model can be adjusted to reflect driver preferences based at least in part upon the comparison. Thereafter, if the driver requests a route, a greater probability exists that the route provided will match the driver's preferred route. At 1110, a profile is created based at least in part upon the driver's preferences. Thus, other drivers not directly related to the driver utilized to create the profile can be assigned such profile. The methodology 1100 then completes at 1112.
Referring now to FIG. 12, a graphical representation 1200 of routes output by various route planning applications versus a route actually traveled by a monitored driver (who was familiar with the area) is illustrated. In more detail, routes labeled “B”, “C”, and “D” were three routes output by three different route planning applications between the same two points. It can be assumed that each of the three route planning applications utilize reasonable metrics in connection with outputting routes. The route labeled “A” is an actual route typically taken by a driver between the same two points (1202 and 1204, respectively). This indicates that the driver utilizing route “A” has preferences, assumptions, and/or knowledge that differs from the knowledge, assumptions, and preferences implicit in the three route planners. Thus it can be discerned that it is desirable to incorporate actual knowledge and/or preferences of a driver into a route planning application.
Referring briefly to FIG. 13, a screenshot 1300 of a mapping application that is overlaid with data points associated with location-sensors in automobiles is illustrated. These data points can be associated with a plurality of different drivers over time. It can also be discerned upon viewing the screenshot 1300 that the data points often do not map to roadways, even though most of such data points were taken from vehicles on such roadways. Therefore, it is important to carefully “snap” these data points to roadways to enable creation of a robust traffic flow representation over different contexts. In one example, a Hidden Markov Model can be utilized in connection with snapping data points to associated road segments.
Turning now to FIGS. 14 and 15 collectively, screenshots 1400 and 1500 that illustrate context-dependent routes are illustrated. The screenshot 1400 illustrates two “optimal” routes between the same two points (1402 and 1404, respectively). In more detail, the route 1406 is the optimal route (least time-consuming) during rush-hour, while the route 1408 is the optimal route at midnight. Similarly, the screenshot 1500 illustrates different optimal routes between the same two points (1502 and 1504, respectively) that depend upon time of day. The route 1506 is the optimal route between the points 1502 and 1504 during rush hour, while the route 1508 is the optimal route between the points 1502 and 1504 at midnight. From these screenshots 1400 and 1500 it can be determined that the assumption that optimal routes are context independent (used by conventional route planning systems) does not hold true.
In order to provide additional context for various aspects of the claimed subject matter, FIG. 16 and the following discussion are intended to provide a brief, general description of a suitable operating environment 1610 in which various aspects may be implemented. While the claimed subject matter is described in the general context of computer-executable instructions, such as program modules, executed by one or more computers or other devices, those skilled in the art will recognize that the invention can also be implemented in combination with other program modules and/or as a combination of hardware and software.
Generally, however, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular data types. The operating environment 1610 is only one example of a suitable operating environment and is not intended to suggest any limitation as to the scope of use or functionality of the features described herein. Other well known computer systems, environments, and/or configurations that may be suitable for use with the claimed subject matter include but are not limited to, personal computers, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include the above systems or devices, and the like.
With reference to FIG. 16, an exemplary environment 1610 that can be employed in connection with creating context-sensitive driving directions includes a computer 1612. The computer 1612 includes a processing unit 1614, a system memory 1616, and a system bus 1618. The system bus 1618 couples system components including, but not limited to, the system memory 1616 to the processing unit 1614. The processing unit 1614 can be any of various available processors. Dual microprocessors and other multiprocessor architectures also can be employed as the processing unit 1614.
The system bus 1618 can be any of several types of bus structure(s) including the memory bus or memory controller, a peripheral bus or external bus, and/or a local bus using any variety of available bus architectures including, but not limited to, 8-bit bus, Industrial Standard Architecture (ISA), Micro-Channel Architecture (MSA), Extended ISA (EISA), Intelligent Drive Electronics (IDE), VESA Local Bus (VLB), Peripheral Component Interconnect (PCI), Universal Serial Bus (USB), Advanced Graphics Port (AGP), Personal Computer Memory Card International Association bus (PCMCIA), and Small Computer Systems Interface (SCSI). The system memory 1616 includes volatile memory 1620 and nonvolatile memory 1622. The basic input/output system (BIOS), containing the basic routines to transfer information between elements within the computer 1612, such as during start-up, is stored in nonvolatile memory 1622. By way of illustration, and not limitation, nonvolatile memory 1622 can include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM), or flash memory. Volatile memory 1620 includes random access memory (RAM), which acts as external cache memory. By way of illustration and not limitation, RAM is available in many forms such as synchronous RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), Synchlink DRAM (SLDRAM), and direct Rambus RAM (DRRAM).
Computer 1612 also includes removable/nonremovable, volatile/nonvolatile computer storage media. FIG. 16 illustrates, for example a disk storage 1624. Disk storage 1624 includes, but is not limited to, devices like a magnetic disk drive, floppy disk drive, tape drive, Jaz drive, Zip drive, LS-100 drive, flash memory card, or memory stick. In addition, disk storage 1624 can include storage media separately or in combination with other storage media including, but not limited to, an optical disk drive such as a compact disk ROM device (CD-ROM), CD recordable drive (CD-R Drive), CD rewritable drive (CD-RW Drive) or a digital versatile disk ROM drive (DVD-ROM). For instance, a DVD-ROM drive can be employed in connection with reading video content from a DVD. To facilitate connection of the disk storage devices 1624 to the system bus 1618, a removable or non-removable interface is typically used such as interface 1626.
It is to be appreciated that FIG. 16 describes software that acts as an intermediary between users and the basic computer resources described in suitable operating environment 1610. Such software includes an operating system 1628. Operating system 1628, which can be stored on disk storage 1624, acts to control and allocate resources of the computer system 1612. System applications 1630 take advantage of the management of resources by operating system 1628 through program modules 1632 and program data 1634 stored either in system memory 1616 or on disk storage 1624. It is to be appreciated that the subject invention can be implemented with various operating systems or combinations of operating systems.
A user enters commands or information into the computer 1612 through input device(s) 1636. Input devices 1636 include, but are not limited to, a pointing device such as a mouse, trackball, stylus, touch pad, touch screen, steering wheel buttons, keyboard, microphone, joystick, game pad, satellite dish, scanner, TV tuner card, digital camera, digital video camera, web camera, remote control, and the like. These and other input devices connect to the processing unit 1614 through the system bus 1618 via interface port(s) 1638. Interface port(s) 1638 include, for example, a serial port, a parallel port, a game port, and a universal serial bus (USB). Output device(s) 1640 use some of the same type of ports as input device(s) 1636. Thus, for example, a USB port may be used to provide input to computer 1612, and to output information from computer 1612 to an output device 1640. Output adapter 1642 is provided to illustrate that there are some output devices 1640 like monitors, in-dash displays, speakers, and printers among other output devices 1640 that require special adapters. The output adapters 1642 include, by way of illustration and not limitation, video and sound cards that provide a means of connection between the output device 1640 and the system bus 1618. It should be noted that other devices and/or systems of devices provide both input and output capabilities such as remote computer(s) 1644.
Computer 1612 can operate in a networked environment using logical connections to one or more remote computers, such as remote computer(s) 1644. The remote computer(s) 1644 can be a personal computer, a server, a router, a network PC, a workstation, a microprocessor based appliance, a peer device or other common network node and the like, and typically includes many or all of the elements described relative to computer 1612. For purposes of brevity, only a memory storage device 1646 is illustrated with remote computer(s) 1644. Remote computer(s) 1644 is logically connected to computer 1612 through a network interface 1648 and then physically connected via communication connection 1650. Network interface 1648 encompasses communication networks such as local-area networks (LAN) and wide-area networks (WAN). LAN technologies include Fiber Distributed Data Interface (FDDI), Copper Distributed Data Interface (CDDI), Ethernet/IEEE 802.3, Wireless Lan (e.g., 802.11 and WiMax) Token Ring/IEEE 802.5 and the like. WAN technologies include, but are not limited to, point-to-point links, circuit switching networks like Integrated Services Digital Networks (ISDN) and variations thereon, packet switching networks, and Digital Subscriber Lines (DSL).
Communication connection(s) 1650 refers to the hardware/software employed to connect the network interface 1648 to the bus 1618. While communication connection 1650 is shown for illustrative clarity inside computer 1612, it can also be external to computer 1612. The hardware/software necessary for connection to the network interface 1648 includes, for exemplary purposes only, internal and external technologies such as, modems including regular telephone grade modems, cable modems and DSL modems, ISDN adapters, and Ethernet cards.
FIG. 17 is a schematic block diagram of a sample-computing environment 1700 with which the claimed subject matter can interact. The system 1700 includes one or more client(s) 1710. The client(s) 1710 can be hardware and/or software (e.g., threads, processes, computing devices). The system 1700 also includes one or more server(s) 1730. The server(s) 1730 can also be hardware and/or software (e.g., threads, processes, computing devices). The servers 1730 can house threads to perform transformations by employing the claimed subject matter, for example. One possible communication between a client 1710 and a server 1730 can be in the form of a data packet adapted to be transmitted between two or more computer processes. The system 1700 includes a communication framework 1750 that can be employed to facilitate communications between the client(s) 1710 and the server(s) 1730. The client(s) 1710 are operably connected to one or more client data store(s) 1760 that can be employed to store information local to the client(s) 1710. Similarly, the server(s) 1730 are operably connected to one or more server data store(s) 1740 that can be employed to store information local to the server(s) 1730. In one particular example, the server(s) can include a route planning system that is accessible to a client by way of a network. Users can request driving directions from the route planning system by submitting a request to the route planning system within the server by way of the client and the network, and the route planning system can then output resultant driving directions to the client.
What has been described above includes examples of the claimed subject matter. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing such subject matter, but one of ordinary skill in the art may recognize that many further combinations and permutations are possible. Accordingly, the claimed subject matter is intended to embrace all such alterations, modifications, and variations that fall within the spirit and scope of the appended claims. Furthermore, to the extent that the term “includes” is used in either the detailed description or the claims, such term is intended to be inclusive in a manner similar to the term “comprising” as “comprising” is interpreted when employed as a transitional word in a claim.

## Claims

1. A route planning system comprising:
a processor;
a memory communicatively coupled to the processor, the memory having stored therein computer-executable instructions configured to implement the route planning system including:
a receiver component that receives a request for directions from a first geographical point to a second geographical point; and
a context analyzer component that analyzes contextual data associated with the received request, the contextual data including reference to at least one of time of day or day of week;
a profile matching component that analyzes user-centric data including a historical driving activity of a user initiating the request, matches the user-centric data to one or more predetermine driving profiles, and infers user preferences for directions based on a matched driving profile; and
a route planner that outputs directions between the first and second geographical points based at least in part upon the received request, the analyzed contextual data, and the user preferences.

2. The route planning system of claim 1, the route planner includes a weighted graph that is representative of a traffic system, weights assigned to edges within the weighted graph are based at least in part upon the analyzed contextual data and the user preferences.

3. The route planning system of claim 2, weights of the weighted graph are assigned based at least in part upon data collected from multiple drivers traversing through a road system, the directions between the first and second geographical points are output as a function of user preferences that are inferred through analysis of the collected data.

4. The route planning system of claim 2, at least one of the user preferences is explicitly provided to the route planning system by the user.

5. The route planning system of claim 2, further comprising a monitoring component that monitors user activity, the user preferences are inferred based at least in part upon the monitored user activity.

6. The route planning system of claim 2, further comprising an updating component that receives data relating to roadways represented by the route planner and alters weights of the graph based at least in part upon the received data.

7. The route planning system of claim 1, further comprising a data collection component that receives data from one or more external data sources, the route planning system outputs directions between the first and second geographical points based at least in part upon the received request, the analyzed contextual data, and data received from the one or more external data sources.

8. The route planning system of claim 7, the external data sources include one or more of a calendar application, a website, a radio station, sensors configured to monitor traffic flow, or a television station.

9. The route planning system of claim 1, further comprising an automobile, the receiver component and the context analyzer component mounted to the automobile.

10. The route planning system of claim 1, further comprising a server, the server hosting the receiver component and the context analyzer component.

11. The route planning system of claim 1, the route planner models a traffic system related to the request, the route planner includes a weighted graph, where nodes of the graph represent intersections and edges represent road segments, weights associated with the nodes and edges alter as the contextual data changes.

12. A method for outputting directions between two geographic points comprising the following computer-executable acts:
receiving a request from a driver for driving directions from a first geographic point to a second geographic point;
tracking historical driving activity of the driver;
selecting at least one driving profile from a plurality of predetermined driving profiles based at least in part on the historical driving activity;
assigning the selected driving profile to the driver;
determining contextual data associated with the request; and
creating driving directions from the first geographic point to the second geographic point based at least in part on the selected driving profile and the contextual data.

13. The method of claim 12, the contextual data includes a time of day that the driver of the request will be traveling from the first geographic point to the second geographic point, wherein creating the driving directions includes creating the driving directions based at least in part upon the time of day.

14. The method of claim 12, the contextual data includes a day of a week that the driver of the request will be traveling from the first geographic point to the second geographic point, wherein creating the driving directions includes creating the driving directions based at least in part upon the day of the week.

15. The method of claim 12, wherein selecting at least one driving profile includes selecting at least one driving profile based at least upon an age of the driver.

16. The method of claim 12, wherein tracking historical driving activity of the driver includes:
receiving trace logs with a respect to the driver, wherein the trace logs have indications of the end of individual journeys for the driver, wherein each indication is based upon the driver's automobile having stopped moving for a threshold amount of time;
segmenting the trace logs to represent individual journeys of the driver; and
inferring preferences of the driver based at least in part upon the individual journeys of the driver.

17. The method of claim 16, further comprising:
categorizing the segmented trace logs based upon context associated with the trace logs; and
wherein creating driving directions includes creating the driving directions based at least in part upon the categorization.

18. A route planning system comprising the following computer-executable components:
means for receiving a request for driving directions between two geographic points;
means for determining contextual information associated with the request;
means for assigning a driving profile to an initiator of the request, wherein the driving profile is automatically selected from a plurality of defined driving profiles based upon inferred preferences of the initiator, wherein the inferred preferences are inferred based at least upon tracked historical driving activity of the initiator, wherein each defined driving profile includes detailed driving preferences used in creating driving directions; and
means for creating driving directions between the two geographic points based at least in part upon the request, the contextual information, and the assigned driving profile.

19. The route planning system of claim 18, further comprising:
means for receiving data from a plurality of automobiles as they travel through a traffic system; and
means for leveraging the received information to create the driving directions for the initiator.