US 8,620,532 B2Grant
Passive crowd-sourced map updates and alternate route recommendations
Issue Date:2013-12-31
•24 Claims
•12 Drawing Sheets
Abstract
Systems and methods for providing passive crowd-sourced alternate route recommendations. In one embodiment, locations of users of a number of mobile location-aware devices are tracked over time. Upon receiving a request, users of mobile location-aware devices that have traveled from a desired start location to a desired stop location are identified. Location histories for the identified users are analyzed to determine one or more different routes taken from the desired start location to the desired stop location. The one or more different routes, or a select subset thereof, are then returned to the requestor as recommended alternate routes.
Metadata
Assignee
- Waldeck Technology, LLC
Inventors
- Scott Curtis
- Eric P. Halber
- Gregory M. Evans
- Steven L. Petersen
Application Information
Application Number:US 12/731,242
Filing Date:2010-03-25
Priority Date:2009-03-25
Art Unit:3667
Classifications
IPC:
G06F19/00
Patent Drawings (12 sheets)
Description
Related Applications
[0001] This application claims the benefit of provisional patent application Ser. No. 61/163,091, filed Mar. 25, 2009, the disclosure of which is hereby incorporated herein by reference in its entirety.
Field of the Disclosure
[0002] The present disclosure relates to crowd-sourced map updates and crowd-sourced alternate route recommendations.
Background
[0003] Personal Navigation Devices (PNDs) often have maps that are out-of-date. Traditional mechanisms for updating the maps of PNDs are cumbersome and inconvenient. More specifically, traditionally companies such as NAVTEQ collect information regarding roads by driving every road using specially equipped cars. These companies then provide the collected information to PND providers for use in their maps. Recently, TomTom has introduced a service referred to as Map Share that enables users of TomTom® PNDs to manually make corrections to their maps and then share their corrections with other users of the TomTom® Map Share service. However, even though the TomTom® Map Share service provides some advantages, it is still cumbersome and burdensome on the users in that they must manually make corrections to their maps. As such, there is a need for a system and method for updating the maps of PNDs that places little, if any, burden on users of the PNDs. In addition, an improved system and method for providing alternate route recommendations to users is needed.
Summary
[0004] Systems and methods for providing passive crowd-sourced alternate route recommendations are disclosed. In one embodiment, locations of users of a number of mobile location-aware devices are tracked over time. Upon receiving a request for alternate routes from a requestor, users of mobile location-aware devices that have traveled from a start location identified by the request to a stop location identified by the request are identified. Location histories for the identified users are analyzed to determine one or more routes taken by the users from the start location to the stop location. The one or more routes, or a select subset of the one or more routes, are then returned to the requestor as recommended alternate routes. In addition, one or more characteristics of the recommended alternate routes may be determined and returned to the requestor. For each recommended alternate route, the one or more characteristics may include, for example, an average travel time for the recommended alternate route, an average travel time for the recommended alternate route for a desired time window, a number of users that have previously traveled the recommended alternate route, or the like.
[0005] In addition, systems and methods for providing passive crowd-sourced map updates are disclosed. In one embodiment, locations of users of a number of mobile location-aware devices are tracked over time. The locations of the users of the mobile location-aware devices are analyzed with respect to a map data model defining a map to detect a travel pattern that is indicative of an update that should be made to the map. An update that reflects the detected travel pattern is then added to the map via the map data model. In one embodiment, the pattern that is detected is indicative of a new road that is not currently included in the map. As such, a new road corresponding to the detected pattern is added to the map via the map data model. Further, a degree of confidence for the new road may be computed based on frequency of use, how recently the new road has been used, or the like. In addition, a name for the new road may be suggested based on the speed at which users have traveled on the new road, how the new road is related to surrounding roads as represented by the map data model, or the like.
[0006] Those skilled in the art will appreciate the scope of the present invention and realize additional aspects thereof after reading the following detailed description of the preferred embodiments in association with the accompanying drawing figures.
Brief Description of the Drawing Figures
[0007] The accompanying drawing figures incorporated in and forming a part of this specification illustrate several aspects of the invention, and together with the description serve to explain the principles of the invention.
[0008] FIG. 1 illustrates a system for providing crowd-sourced map updates and crowd-sourced alternate route recommendations according to one embodiment of the present disclosure;
[0009] FIG. 2 illustrates the operation of the system of FIG. 1 to track the locations of users of the mobile location-aware devices according to one embodiment of the present disclosure;
[0010] FIG. 3 is a flow chart illustrating a process for providing crowd-sourced map updates according to one embodiment of the present disclosure;
[0011] FIG. 4 is a more detailed flow chart illustrating a process for providing crowd-sourced map updates according to one embodiment of the present disclosure;
[0012] FIG. 5 is a flow chart illustrating a process for detecting a pattern indicative of a new road according to one embodiment of the present disclosure;
[0013] FIG. 6 illustrates an exemplary bounding region utilized during the pattern detection process of FIG. 5 according to one embodiment of the present disclosure;
[0014] FIG. 7 illustrates an exemplary Graphical User Interface (GUI) for presenting a new road and a degree of confidence for the new road to a user according to one embodiment of the present disclosure;
[0015] FIG. 8 illustrates the operation of the system of FIG. 1 to provide crowd-sourced alternate route recommendations according to one embodiment of the present disclosure;
[0016] FIG. 9 is a flow chart illustrating a process for generating crowd-sourced alternate route recommendations according to one embodiment of the present disclosure;
[0017] FIG. 10 is a block diagram of the server of FIG. 1 according to one embodiment of the present disclosure;
[0018] FIG. 11 is a block diagram of one of the mobile location-aware devices of FIG. 1 according to one embodiment of the present disclosure; and
[0019] FIG. 12 is a block diagram of a computing device hosting the third-party map function of FIG. 1 according to one embodiment of the present disclosure.
Detailed Description of the Preferred Embodiments
[0020] The embodiments set forth below represent the necessary information to enable those skilled in the art to practice the invention and illustrate the best mode of practicing the invention. Upon reading the following description in light of the accompanying drawing figures, those skilled in the art will understand the concepts of the invention and will recognize applications of these concepts not particularly addressed herein. It should be understood that these concepts and applications fall within the scope of the disclosure and the accompanying claims.
[0021] FIG. 1 illustrates a system 10 for providing passive crowd-sourced map updates, passive crowd-sourced alternate route recommendations, or both according to one embodiment of the present disclosure. As illustrated, the system 10 includes a server 12 and a number of mobile location-aware devices 14-1 through 14-N having associated users 16-1 through 16-N. The server 12 and the mobile location-aware devices 14-1 through 14-N are connected via a network 18. The network 18 is preferably a publicly accessible distributed network such as the Internet. In addition, in this embodiment, the system 10 may also include a third-party map function 20.
[0022] The server 12 is a physical server. Note, however, that while only a single server 12 is illustrated for clarity and ease of discussion, the system 10 may include multiple servers 12 that operate in a collaborative manner for purposes of load-sharing and/or redundancy. The server 12 includes a location tracking function 22, a map updating function 24, and an alternate route recommendation function 26, each of which is preferably implemented in software but is not limited thereto. In addition, the server 12 includes a map data model 28 and a location tracking repository 30. The location tracking function 22 generally operates to receive location updates from the mobile location-aware devices 14-1 through 14-N defining locations of the users 16-1 through 16-N over time and to store corresponding data in the location tracking repository 30. Note that while the description herein refers to the tracking of the locations of the users 16-1 through 16-N, as used herein, the locations of the users 16-1 through 16-N is synonymous with the locations of the mobile location-aware devices 14-1 through 14-N. The data stored in the location tracking repository 30 may include a location history for each of the users 16-1 through 16-N or anonymized location histories that anonymously record the locations of the users 16-1 through 16-N. Using the user 16-1 of the mobile location-aware device 14-1 as an example, for each location update received from the mobile location-aware device 14-1 for the user 16-1, the location history for the user 16-1 includes the data from the location update (i.e., location and, optionally, a time-stamp, direction of travel, and/or speed of travel). Alternatively, the location history for the user 16-1 may include a number of vectors in the form of <start, stop, time-stamp, direction, speed> derived from the location updates received from the mobile location-aware device 14-1 for the user 16-1.
[0023] In another embodiment, anonymized location histories are stored in the location tracking repository 30. More specifically, again using the user 16-1 of the mobile location-aware device 14-1 as an example, the location history of the user 16-1 may be periodically persisted in the location tracking repository 30 as an anonymous location history. The anonymous location history is preferably a location history record or data object that has a new or unique identifier that is not tied back to the user 16-1 or the mobile location-aware device 14-1. For example, at a desired periodic time interval (e.g., hourly, daily, weekly, or the like), the location history of the user 16-1 may be persisted as an anonymous location history that is not tied back to the user 16-1. At the end of each periodic time interval, the location history of the user 16-1 is persisted as a new anonymous location history. Further, each time the location history of the user 16-1 is persisted as an anonymous location history, all of the location data (i.e., previous locations and, if any, time-stamps, directions of travel, and/or speed of travel) may be removed from the location history of the user 16-1.
[0024] The map updating function 24 generally operates to analyze the data in the location tracking repository 30 that reflects the locations of the users 16-1 through 16-N of the mobile location-aware devices 14-1 through 14-N over time in order to detect patterns that are indicative of updates that should be made to a map defined by the map data model 28. The map data model 28 is generally data that defines a map of a geographic area (e.g., North America, the United States of America, North Carolina, or the like). For instance, the map data model 28 may be Geographic Information Systems (GIS) data that defines a map for a geographic area. As discussed below in detail, in the preferred embodiment, the map updating function 24 operates to detect patterns of movement of the users 16-1 through 16-N of the mobile location-aware devices 14-1 through 14-N that are indicative of new roads that should be added to the map defined by the map data model 28. However, in a similar manner, the map updating function 24 may additionally or alternatively detect other changes that should be made to the map such as, for example, temporary or permanent road closures. For instance, the absence of movement of the users 16-1 through 16-N of the mobile location-aware devices 14-1 through 14-N over a particular road in the map for at least a threshold amount of time may be used as a detection that the road is closed.
[0025] The alternate route recommendation function 26 generally operates to recommend alternate routes to the users 16-1 through 16-N of the mobile location-aware devices 14-1 and 14-N and the third-party map function 20 based on the data in the location tracking repository 30. More specifically, as discussed below, the alternate route recommendation function 26 receives a request for alternate routes from a requestor, where the requestor may be one of the mobile location-aware devices 14-1 through 14-N or the third-party map function 20. The request identifies a desired start location and a desired stop location. The alternate route recommendation function 26 then uses the data in the location tracking repository 30 to identify a number of different routes previously taken by the users 16-1 through 16-N of the mobile location-aware devices 14-1 through 14-N from the desired start location to the desired stop location. One or more of the identified routes are then returned to the requestor as recommended alternate routes.
[0026] The mobile location-aware devices 14-1 through 14-N are generally any type of user devices that are enabled to determine the locations of the users 16-1 through 16-N and provide location updates for the users 16-1 through 16-N to the server 12 via the network 18. For example, each of the mobile location-aware devices 14-1 through 14-N may be a personal navigation device permanently installed in an automobile, a portable personal navigation device similar to those manufactured and sold by Garmin or TomTom, a mobile smart phone providing personal navigation device functionality such as an Apple® iPhone having a software application providing personal navigation device functionality, or the like. As illustrated, the mobile location-aware devices 14-1 through 14-N include personal navigation functions 32-1 through 32-N, location reporting functions 34-1 through 34-N, and Global Positioning System (GPS) receivers 36-1 through 36-N. In addition, in this embodiment, the mobile location-aware devices 14-1 through 14-N include map data models 38-1 through 38-N. Each of the map data models 38-1 through 38-N is a copy of the map data model 28 of the server 12 or a subset of the map data model 28 defining a portion of the map for a relevant geographic area. However, the present disclosure is not limited thereto. In an alternative embodiment, the mobile location-aware devices 14-1 through 14-N obtain map data from the server 12 as needed.
[0027] Using the mobile location-aware device 14-1 as an example, the personal navigation function 32-1 may be implemented in software, hardware, or a combination thereof. The personal navigation function 32-1 generally operates in a manner similar to a traditional personal navigation device. More specifically, the personal navigation function 32-1 provides turn-by-turn directions to the user 16-1 in order to navigate the user 16-1 from a desired start location to a desired stop location. The personal navigation function 32-1 may also provide additional features such as Point-of-Interest (POI) lookup, current traffic conditions, or the like. The location reporting function 34-1 generally operates to provide location updates for the user 16-1 to the server 12.
[0028] The third-party map function 20 may be implemented in hardware, software, or a combination thereof. For example, the third-party map function 20 may be a software application hosted by a physical server or farm of physical servers, a user device such as a personal computer, or the like. In general, the third-party map function 20 provides map-based services to users or entities. For example, the third-party map function 20 may be a web-based map service such as, or similar to, the Google® Maps service, the Bing® Maps service, the MapQuest® service, or the like. The third-party map function 20 may interact with the server 12 to obtain map updates and/or alternate routes.
[0029] FIG. 2 illustrates the operation of the system 10 of FIG. 1 to track the locations of the users 16-1 through 16-N according to one embodiment of the present disclosure. In this embodiment, tracking is performed passively by obtaining location updates for the users 16-1 through 16-N and storing corresponding data at the server 12. While this discussion uses the mobile location-aware device 14-1 and the user 16-1 as an example, this discussion is equally applicable to the other mobile location-aware devices 14-2 through 14-N and the other users 16-2 through 16-N. As illustrated, the mobile location-aware device 14-1, and more specifically the location reporting function 34-1, first gets a current location of the mobile location-aware device 14-1 (step 1000). In addition to the current location, the location reporting function 34-1 may get a time-stamp that defines the current time, a direction of travel of the mobile location-aware device 14-1, and/or a speed of travel of the mobile location-aware device 14. In the preferred embodiment, the location reporting function 34-1 gets the current location and, optionally, the current time, the direction of travel, and/or the speed of travel from the GPS receiver 36-1. However, the GPS receiver 36-1 is exemplary. Any suitable technology for determining or otherwise obtaining the current location of the mobile location-aware device 14-1 may be used. Next, the location reporting function 34-1 of the mobile location-aware device 14-1 sends a location update to the server 12 (step 1002). The location update includes the current location of the user 16-1, which is the current location of the mobile location-aware device 14-1 obtained from the GPS receiver 36-1. In addition, the location update may obtain a time-stamp defining the time at which the current location was obtained (i.e., the current time), the direction of travel of the mobile location-aware device 14-1 as the direction of travel of the user 16-1, and/or the speed of travel of the mobile location-aware device 14-1 as the speed of travel of the user 16-1.
[0030] Upon receiving the location update, the location tracking function 22 stores data in the location tracking repository 30 corresponding to the location update (step 1004). In one embodiment, the location tracking repository 30 includes a location history for each of the users 16-1 through 16-N. As such, in this embodiment, the location update, or more specifically the data included in the location update, is stored in a location history of the user 16-1 maintained in the location tracking repository 30. Alternatively, the location update may be processed to provide a vector from the last location of the user 16-1 to the current location of the user 16-1, where the vector may be <start location, stop location, time-stamp, direction, speed>. In another embodiment, as discussed above, the location tracking function 22 stores anonymized location histories. More specifically, the location tracking function 22 stores location histories for each of the users 16-1 through 16-N. However, periodically (e.g., hourly, daily, weekly, or the like), the location tracking function 22 persists the location histories of the users 16-1 through 16-N as anonymous location histories that are not tied back to the users 16-1 through 16-N and removes the location data (i.e., the previous locations and/or corresponding time-stamps, speeds of travel, and/or directions of travel, or previous vectors) from the location histories of the users 16-1 through 16-N. Anonymization may be performed as a background process. Alternatively, anonymization may be triggered by receipt of location updates. Thus, upon receiving the location update from the mobile location-aware device 14-1, the location tracking function 22 may store the location update in the location history of the user 16-1 and then determine if it is time to anonymize the location history of the user 16-1. If so, the location tracking function 22 removes the location updates from the location history of the user 16-1 and stores the location updates as an anonymous location history that is not tied back to the user 16-1 or the mobile location-aware device 14-1. Note that the most recent location update, most recent vector, or current location of the user 16-1 may be retained in the location history of the user 16-1 after anonymization is performed.
[0031] In the same manner, the other mobile location-aware devices 14-2 through 14-N get their current locations and send corresponding location updates to the server 12 (steps 1006 and 1008). In response, the location tracking function 22 stores corresponding data in the location tracking repository 30 for the users 16-2 through 16-N (step 1010). As illustrated, this process continues such that the mobile location-aware devices 14-1 through 14-N continue to send location updates for the users 16-1 through 16-N to the server 12 over time and corresponding data is stored in the location tracking repository 30 (steps 1012 through 1022).
[0032] FIG. 3 illustrates the operation of the map updating function 24 of the server 12 according to one embodiment of the present disclosure. First, the map updating function 24 detects a travel pattern that is indicative of a new road that is not included on the map defined by the map data model 28 (step 2000). More specifically, the map updating function 24 analyzes the data in the location tracking repository 30 as compared to the map data model 28 to detect a pattern of movement of the users 16-1 through 16-N that is indicative of a new road that is not included on the map defined by the map data model 28. In general, a pattern indicative of a new road is a pattern of consistent and frequent travel of the users 16-1 through 16-N, or more specifically at least a subset of the users 16-1 through 16-N, in a manner that is consistent with travel along a road. In addition, the map updating function 24 may compute a degree of confidence for the new road. The degree of confidence is preferably a function of frequency of use and how recently the new road has been used.
[0033] Once the new road is detected, the map updating function 24 updates the map to include the new road (step 2002). More specifically, the map updating function 24 adds data defining the new road to the map data model 28. In addition, the map updating function 24 may add the degree of confidence for the new road to the map data model 28. At this point, in one embodiment, the map updating function 24 sends an update to the map data model 28 for the new road and the degree of confidence for the new road, if any, to one or more of the mobile location-aware devices 14-1 through 14-N. Those mobile location-aware devices 14-1 through 14-N that receive the update then add the update to their map data models 38-1 through 38-N. In addition, the map updating function 24 may send the update for the map data model 28 to the third-party map function 20. In an alternative embodiment, rather than immediately updating the map data model 28, the map updating function 24 may flag the update or otherwise send an alert regarding the update to an owner or editor of the map represented by the map data model 28 for verification before the map is officially updated.
[0034] FIG. 4 is a more detailed flow chart illustrating the operation of the server 12 to update the map according to one embodiment of the present disclosure. In this embodiment, the location tracking function 22 receives a location update (step 3000). For this discussion, the location update is received from the mobile location-aware device 14-1 for the user 16-1. In response, the location tracking function 22 generates and stores a vector from a previous location of the user 16-1 to a current location of the user 16-1 identified in the location update (step 3002). The previous location of the user 16-1 is the location of the user 16-1 identified in the immediately preceding location update received from the mobile location-aware device 14-1. Again, the vector is preferably in the form of <start location, stop location, time-stamp, direction, speed> but is not limited thereto. “Start location” is the previous location of the user 16-1 identified by the immediately preceding location update for the user 16-1, “stop location” is the current location of the user 16-1 identified in the location update, time-stamp is the timestamp from the corresponding location update, direction is the direction of travel from the location update, and speed is the speed of travel from the location update.
[0035] Next, the map updating function 24 determines whether the user 16-1 is currently on a crowd-sourced road (step 3004). As used herein, a crowd-sourced road is a road previously added to the map by the map updating function 24 based on detected patterns of travel, or movement, of the users 16-1 through 16-N. Note, however, that a crowd-sourced road may be promoted to a permanent road in the map data model 28 when, for example, the crowd-sourced road is verified by an operator of the server 12 (i.e., a person) or the degree of confidence of the crowd-sourced road reaches a predefined threshold (e.g., 90% or 100%). The map updating function 24 determines whether the user 16-1 is currently on a crowd-sourced road by comparing the current location of the user 16-1 to the map data model 28. If the user 16-1 is on a crowd-sourced road, the map updating function 24 updates the degree of confidence of the crowd-sourced road (step 3006). Again, the degree of confidence is preferably a function of frequency of use of the crowd-sourced road and how recently the crowd-sourced road has been used. The more frequently and recently the crowd-sourced road has been used by the users 16-1 through 16-N, the higher the degree of confidence for the crowd-sourced road. At this point, the process returns to step 3000 and is repeated for the next received location update.
[0036] If the user 16-1 is not on a crowd-sourced road, the map updating function 24 determines whether the user 16-1 is currently on a permanent road (step 3008). As used herein, a permanent road is a road that was originally in the map or a crowd-sourced road added by the map updating function 24 that has been verified or that has a degree of confidence equal to or greater than a predefined threshold degree of confidence. If the user 16-1 is currently on a permanent road, the process returns to step 3000 and is repeated for the next received location update. If the user 16-1 is neither on a crowd-sourced road nor a permanent road, the map updating function 24 determines whether a predefined number (M) of location updates have been received for the user 16-1 since the user 16-1 was last determined to be on a road (i.e., a permanent road or a crowd-sourced road) (step 3010). The number M may be any integer greater than or equal to one (1). If less than M location updates have been received for the user 16-1 since the user 16-1 was last on a road, the process returns to step 3000 and is repeated for the next received location update.
[0037] If M location updates have been received for the user 16-1 since the user 16-1 was last on a road, the map updating function 24 performs a pattern detection process for the last M vectors in the location history of the user 16-1 (step 3012). Note that if vectors are not used, the pattern detection process is performed for the last M entries in the location history of the user 16-1. In general, the map updating function 24 obtains the last M vectors from the location history of the user 16-1. In addition, the map updating function 24 obtains other vectors from the location histories stored in the location tracking repository 30 that have start and stop locations in the same vicinity as the start and stop locations of one or more of the last M vectors for the user 16-1. These vectors are then analyzed to determine whether there is a pattern of travel or movement that is indicative of a new road. If so, the map updating function 24 updates the map data model 28 with data defining the new road. In addition, map updates may be sent to one or more of the mobile location-aware devices 14-1 through 14-N and/or the third-party map function 20. At this point, the process returns to step 3000 and is repeated for the next received location update.
[0038] FIG. 5 is a flow chart illustrating step 3012 of FIG. 4 in more detail according to one embodiment of the present disclosure. First, the map updating function 24 gets the last M vectors from the location history of the user 16-1 stored in the location tracking repository 30 (step 4000). The map updating function 24 then establishes a bounding region for the last M vectors (step 4002). The bounding region is generally a geographic region that encompasses the start and stop locations for the last M vectors for the user 16-1. Preferably, the bounding region is established such that the bounding region is, or is approximately, a geographic region defined by a maximum distance (D) from the last M vectors of the user 16-1, as illustrated in FIG. 6 .
[0039] Returning to FIG. 5 , the map updating function 24 then gets all known vectors from the location tracking repository 30 having start locations and stop locations located within the bounding region for the last M vectors of the user 16-1 (step 4004). Alternatively, the map updating function 24 may get a subset of all known vectors from the location tracking repository 30 having start locations and stop locations located within the bounding region for the last M vectors of the user 16-1, such as all known vectors from the location tracking repository 30 having start locations and stop locations within the bounding region for the last M vectors of the user 16-1 that have time-stamps within a defined time window. The defined time window may be a relative time window such as, for example, the last month.
[0040] The map updating function 24 then analyzes the known vectors obtained in step 4004 and, optionally, the last M vectors for the user 16-1 to determine whether there is a pattern of travel or movement that is indicative of a new road (step 4006). For example, the known vectors may be filtered to remove those vectors having directions and, optionally, speeds that are inconsistent with the directions and speeds of the last M vectors for the user 16-1. More specifically, for each known vector, the map updating function 24 may determine to filter the known vector if the direction and optionally speed of the known vector are more than a predefined amount of deviation from the direction and optionally speed of a nearest one of the last M vectors for the user 16-1 (i.e., the one of the last M vectors having a start location and/or stop location that is closest to the start location and/or stop location, respectively, of the known vector). If the direction and, if used, the speed of the known vector are within the predefined amount of deviation from the direction and, if used, the speed of the nearest one of the last M vectors for the user 16-1, then the known vector is not filtered. Once filtering is complete, the remaining known vectors, which are referred to herein as the filtered vectors, are counted. If the number of filtered vectors is greater than a predefined threshold number of vectors, then a pattern is detected. Note that this process for detecting a pattern is exemplary and is not intended to limit the scope of the present disclosure. Any suitable pattern recognition technique may be used.
[0041] Once the analysis is complete, the map updating function 24 determines whether a pattern that is indicative of a new road has been detected (step 4008). If not, the process ends. If so, the map updating function 24 computes a path for the new road that corresponds to the detected pattern and, optionally, a confidence factor for the new road (step 4010). In one embodiment, the bounding region for the last M vectors for the user 16-1 is divided into a series of sub-regions. For example, each sub-region may include one of the last M vectors for the user 16-1. Then, for each sub-region, the map updating function 24 may identify vectors from the filtered vectors that have start locations within that sub-region and then combine (e.g., average) the start locations for the identified vectors to provide a combined point for the sub-region. Once complete, the combined points for the sub-regions define the path for the new road. Again, the degree of confidence for the new road may be computed as a function of frequency of use by the users 16-1 through 16-N and how recently the new road has been used by the users 16-1 through 16-N.
[0042] In addition, the map updating function 24 may suggest a name for the new road. The map updating function 24 may suggest a name of the road based on detected patterns in the movement of users that have traveled the new road, surrounding roads in the map data model 28, or a combination thereof. The detected patterns in movement may be, for example, an average speed of the users that have traveled the road, start and stop patterns, patterns indicating that the new road extends from an existing road, patterns indicating that the new road merges into an existing road, patterns indicating that the new road extends from and merges back into an existing road, or the like. For example, the average speed at which users have traveled the new road may be used to determine whether the new road is likely to be an Interstate Highway, a city street, or the like. Similarly, start and stop patterns may be used to determine that the new road is a city street. In addition or alternatively, the path of the new road may be analyzed with respect to surrounding roads to determine whether the new road is an extension of an existing road, an alternate version of an existing road (e.g., Alternate I-40 as an alternate for I-40).
[0043] Lastly, the map updating function 24 updates the map data model 28 to include data defining the new road (step 4012). In addition, a corresponding update may be provided to one or more of the mobile location-aware devices 14-1 through 14-N and/or the third-party map function 20. At this point, the process ends. Again, in an alternative embodiment, rather than immediately updating the map data model 28, the map updating function 24 may flag the update or otherwise send an alert regarding the update to an owner or editor of the map represented by the map data model 28 for verification before the map is officially updated.
[0044] FIG. 7 illustrates an exemplary Graphical User Interface (GUI) 40 for presenting a map including a crowd-sourced map update provided by the map updating function 24 of the server 12 according to one embodiment of the present disclosure. As illustrated, the GUI 40 generally presents a map, which is preferably a portion of the map defined by the map data model 28 of the server 12. A new road 42 detected by the map updating function 24 of the server 12 based on a detected travel pattern of the users 16-1 through 16-N is shown in the GUI 40. In one embodiment, an opacity of the new road 42 in the GUI 40 corresponds to a degree of confidence for the new road 42 computed by the map updating function 24. In addition or alternatively, the GUI 40 may include a window providing information for the new road 42 such as, for example, the degree of confidence for the new road 42 and a likely, or suggested name, of the new road 42.
[0045] In this example, since the new road 42 diverges from I-40 and rejoins I-40, the map updating function 24 determines that the new road 42 is likely an Alternate I-40. More specifically, based on the map data model 28, the map updating function 24 knows that I-40 is an interstate and that characteristic speeds on I-40 are 55 to 80 mph. The map updating function 24 detects a large number of users diverging from I-40 onto the newly detected road at speeds that are characteristic of merging onto another highway. Then, ten miles later, the map updating function 24 detects a large number of users diverging from this newly detected road back onto I-40 at a speed that is characteristic of merging onto another highway. From these characteristic and passively detected inputs, the map updating function 24 is enabled to determine that the newly detected route is likely to be an “Alternate” or “Business Bypass” of I-40 and therefore suggest “Alternate I-40” as a name for the newly detected road.
[0046] FIG. 8 illustrates the operation of the system 10 to recommend alternate routes according to one embodiment of the present disclosure. As illustrated, first, the mobile location-aware device 14-1 sends an alternate route request to the server 12 (step 5000). Note that while the mobile location-aware device 14-1 is the requestor in this discussion, the requestor may alternatively be one of the other mobile location-aware devices 14-2 through 14-N or the third-party map function 20. The alternate route request identifies a desired start location and a desired stop location. More specifically, in one embodiment, the personal navigation function 32-1 sends the alternate route request to the server 12 either automatically in response to a request from the user 16-1 to be navigated from the desired start location to the desired stop location or in response to an explicit request for alternate routes from the user 16-1.
[0047] In response to receiving the alternate route request, the alternate route recommendation function 26 of the server 12 generates one or more alternate routes from the desired start location to the desired stop location (step 5002). In general, the alternate route recommendation function 26 utilizes data in the location tracking repository 30 to identify routes previously taken by the users 16-1 through 16-N from the desired start location to the desired stop location. The alternate route recommendation function 26 then selects one or more of the identified routes as alternate routes to recommend, and then returns the alternate routes to the mobile location-aware device 14-1 (step 5004). The personal navigation function 32-1 of the mobile location-aware device 14-1 then utilizes the alternate routes (step 5006). For example, the personal navigation function 32-1 may display the alternate routes to the user 16-1 and enable the user 16-1 to select one of the alternate routes to use. Note that, in an alternative embodiment, rather than immediately sending the alternate routes to the mobile location-aware device 14-1, the recommended routes may be verified, such as by an owner or editor of the map represented by the map data model 28, before the recommended routes are sent to the mobile location-aware device 14-1.
[0048] FIG. 9 is a flow chart illustrating the operation of the alternate route recommendation function 26 of the server 12 in more detail according to one embodiment of the present disclosure. First, the alternate route recommendation function 26 receives an alternate route request that identifies a desired start location and a desired stop location (step 6000). In response, the alternate route recommendation function 26 identifies users from the users 16-1 through 16-N that have traveled from the desired start location to the desired stop location (step 6002). Note that the users that have traveled from the desired start location to the desired stop location preferably include users that have started at the desired start location and ended at the desired stop location as well as users that have traveled from or through the desired start location to or through the desired stop location. Optionally, the identified users may be only those users that have traveled from the desired start location to the desired stop location during a desired time window. The desired time window may be a reoccurring time window corresponding to a current time of day (e.g., 10 AM to Noon), a current day of the week (Monday, Weekday, or Weekend), a combination of a current or defined time of day and day of week (e.g., Monday from 10 AM to Noon or Weekdays from 10 AM to Noon), or the like.
[0049] The alternate route recommendation function 26 then determines one or more different routes taken by the identified users from the desired start location to the desired stop location (step 6004). More specifically, for each of the identified users, the alternate route recommendation function 26 determines a route taken by the identified user from the desired start location to the desired stop location. The routes taken by the identified users are compared to one another to determine a number of different routes taken by the identified users from the desired start location to the desired stop location.
[0050] Next, the alternate route recommendation function 26 determines one or more characteristics for each of the different route(s) (step 6006). For each of the different routes, the one or more characteristics for that route may include, for example, a number of the identified users that took that route, an average travel time for that route, an average travel time for that route for desired time window, or the like. The average travel time for a route is determined based on actual travel times for that route for corresponding users determined based on the location histories of those users. Similarly, the average travel time for a route for the desired time window is determined based on actual travel times for that route for corresponding users that traveled that route during the desired time window. The desired time window may be a reoccurring time window corresponding to a current time of day (e.g., 10 AM to Noon), a current day of the week (Monday, Weekday, or Weekend), a combination of a current or defined time of day and day of week (e.g., Monday from 10 AM to Noon or Weekdays from 10 AM to Noon), or the like. The alternate route recommendation function 26 then returns the one or more different routes and the characteristics of the one or more different routes to the requestor as alternate route recommendations (step 6008). Note that either prior to step 6006 or before returning the recommendations in step 6008, the different routes identified in step 6004 may be filtered or otherwise processed to remove unwanted routes. For example, filtering may be performed to remove a particular route that has already been provided to the user 16-1 (e.g., an optimal route that has already been generated by the personal navigation function 32-1 using a traditional route generation technique).
[0051] FIG. 10 is a block diagram of the server 12 according to one embodiment of the present disclosure. As illustrated, the server 12 includes a controller 46 connected to memory 48, one or more secondary storage devices 50, and a communication interface 52 by a bus 54 or similar mechanism. The controller 46 is a microprocessor, digital Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA), or the like. In this embodiment, the controller 46 is a microprocessor, and the location tracking function 22, the map updating function 24, and the alternate route recommendation function 26 are implemented in software and stored in the memory 48 for execution by the controller 46. Further, the map data model 28 and the location tracking repository 30 may be stored in the one or more secondary storage devices 50. The secondary storage devices 50 are digital data storage devices such as, for example, one or more hard disk drives. The communication interface 52 is a wired or wireless communication interface that communicatively couples the server 12 to the network 18 (FIG. 1 ). For example, the communication interface 52 may be an Ethernet interface, local wireless interface such as a wireless interface operating according to one of the suite of IEEE 802.11 standards, or the like.
[0052] FIG. 11 is a block diagram of the mobile location-aware device 14-1 according to one embodiment of the present disclosure. This discussion is equally applicable to the other mobile location-aware devices 14-2 through 14-N. As illustrated, the mobile location-aware device 14-1 includes a controller 56 connected to memory 58, a communication interface 60, one or more user interface components 62, and the GPS receiver 36-1 by a bus 64 or similar mechanism. The controller 56 is a microprocessor, digital ASIC, FPGA, or the like. In this embodiment, the controller 56 is a microprocessor and the location reporting function 34-1 and, in some implementations, the personal navigation function 32-1 are implemented in software and stored in the memory 58 for execution by the controller 56. In this embodiment, the GPS receiver 36-1 is a hardware component. The communication interface 60 is a wireless communication interface that communicatively couples the mobile location-aware device 14-1 to the network 18 (FIG. 1 ). For example, the communication interface 60 may be a local wireless interface such as a wireless interface operating according to one of the suite of IEEE 802.11 standards, a mobile communications interface such as a cellular telecommunications interface, or the like. The one or more user interface components 62 include, for example, a touchscreen, a display, one or more user input components (e.g., a keypad), a speaker, or the like, or any combination thereof.
[0053] FIG. 12 is a block diagram of a computing device 66 that hosts the third-party map function 20 according to one embodiment of the present disclosure. As illustrated, the computing device 66 includes a controller 68 connected to memory 70, one or more secondary storage devices 72, a communication interface 74, and one or more user interface components 76 by a bus 78 or similar mechanism. The controller 68 is a microprocessor, digital ASIC, FPGA, or the like. In this embodiment, the controller 68 is a microprocessor, and the third-party map function 20 is implemented in software and stored in the memory 70 for execution by the controller 68. The one or more secondary storage devices 72 are digital storage devices such as, for example, one or more hard disk drives. The communication interface 74 is a wired or wireless communication interface that communicatively couples the computing device 66 to the network 18 (FIG. 1 ). For example, the communication interface 74 may be an Ethernet interface, local wireless interface such as a wireless interface operating according to one of the suite of IEEE 802.11 standards, a mobile communications interface such as a cellular telecommunications interface, or the like. The one or more user interface components 76 include, for example, a touchscreen, a display, one or more user input components (e.g., a keypad), a speaker, or the like, or any combination thereof.
[0054] Those skilled in the art will recognize improvements and modifications to the preferred embodiments of the present invention. All such improvements and modifications are considered within the scope of the concepts disclosed herein and the claims that follow.
Claims
What is claimed is:
1. A method comprising:
tracking locations of a plurality of users of a plurality of mobile location-aware devices over time;
receiving an alternate route request from a requestor, the alternate route request identifying a desired start location and a desired stop location;
identifying one or more users of the plurality of users that have traveled from the desired start location to the desired stop location based on the locations of the plurality of users of the plurality of mobile location-aware devices, wherein the one or more users of the plurality of users includes users other than the requestor;
determining, by a processor, one or more different routes taken by the one or more users from the desired start location to the desired stop location based on the locations of the one or more users; and
providing, by the processor, at least one of the one or more different routes taken by the one or more users from the desired start location to the desired stop location to the requestor as at least one recommended alternate route.
2. The method of claim 1 wherein identifying one or more users of the plurality of users that have traveled from the desired start location to the desired stop location comprises identifying one or more users of the plurality of users that have traveled from the desired start location to the desired stop location during a desired time window.
3. The method of claim 2 wherein the desired time window is a reoccurring time window corresponding to at least one of a group consisting of: a current time of day and a current day of the week.
4. The method of claim 1 further comprising:
determining, for each different route of the at least one of the one or more different routes, a characteristic of the different route; and
providing the characteristic of each different route to the requestor.
5. The method of claim 4 wherein the characteristic of the different route is a number of users of the plurality of users that have traveled the different route.
6. The method of claim 4 wherein the characteristic of the different route is an average travel time for the different route determined based on actual travel times of users of the plurality of users that have traveled the different route.
7. The method of claim 4 wherein the characteristic of the different route is an average travel time for the different route determined based on actual travel times of users of the plurality of users that have traveled the different route during a desired time window.
8. The method of claim 7 wherein the desired time window is a reoccurring time window corresponding to at least one of a group consisting of: a current time of day and a current day of the week.
9. A server comprising:
a communication interface communicatively coupling the server to a plurality of mobile location-aware devices via a network; and
a controller associated with the communication interface and adapted to:
track locations of a plurality of users of the plurality of mobile location-aware devices over time;
receive an alternate route request from a requestor, the alternate route request identifying a desired start location and a desired stop location;
identify one or more users of the plurality of users that have traveled from the desired start location to the desired stop location based on the locations of the plurality of users of the plurality of mobile location-aware devices, wherein the one or more users of the plurality of users includes users other than the requestor;
determine one or more different routes taken by the one or more users from the desired start location to the desired stop location based on the locations of the one or more users; and
provide at least one of the one or more different routes taken by the one or more users from the desired start location to the desired stop location to the requestor as at least one recommended alternate route.
10. The server of claim 9 wherein in order to identify one or more users of the plurality of users that have traveled from the desired start location to the desired stop location, the controller is further adapted to identify one or more users of the plurality of users that have traveled from the desired start location to the desired stop location during a desired time window.
11. The server of claim 10 wherein the desired time window is a reoccurring time window corresponding to at least one of a group consisting of: a current time of day and a current day of the week.
12. The server of claim 9 wherein the controller is further adapted to:
determine, for each different route of the at least one of the one or more different routes, a characteristic of the different route; and
provide the characteristic of each different route to the requestor.
13. The server of claim 12 wherein the characteristic of the different route is a number of users of the plurality of users that have traveled the different route.
14. The server of claim 12 wherein the characteristic of the different route is an average travel time for the different route determined based on actual travel times of users of the plurality of users that have traveled the different route.
15. The server of claim 12 wherein the characteristic of the different route is an average travel time for the different route determined based on actual travel times of users of the plurality of users that have traveled the different route during a desired time window.
16. The server of claim 15 wherein the desired time window is a reoccurring time window corresponding to at least one of a group consisting of: a current time of day and a current day of the week.
17. A non-transitory computer-readable medium storing software for instructing a controller of a server to:
track locations of a plurality of users of a plurality of mobile location-aware devices over time;
receive an alternate route request from a requestor, the alternate route request identifying a desired start location and a desired stop location;
identify one or more users of the plurality of users that have traveled from the desired start location to the desired stop location based on the locations of the plurality of users of the plurality of mobile location-aware devices, wherein the one or more users of the plurality of users includes users other than the requestor;
determine one or more different routes taken by the one or more users from the desired start location to the desired stop location based on the locations of the one or more users; and
provide at least one of the one or more different routes taken by the one or more users from the desired start location to the desired stop location to the requestor as at least one recommended alternate route.
18. The non-transitory computer-readable medium of claim 17 wherein in order to identify one or more users of the plurality of users that have traveled from the desired start location to the desired stop location, the software further instructs the controller to identify one or more users of the plurality of users that have traveled from the desired start location to the desired stop location during a desired time window.
19. The non-transitory computer-readable medium of claim 18 wherein the desired time window is a reoccurring time window corresponding to at least one of a group consisting of: a current time of day and a current day of the week.
20. The non-transitory computer-readable medium of claim 17 wherein the software further instructs the controller to:
determine, for each different route of the at least one of the one or more different routes, a characteristic of the different route; and
provide the characteristic of each different route to the requestor.
21. The non-transitory computer-readable medium of claim 20 wherein the characteristic of the different route is a number of users of the plurality of users that have traveled the different route.
22. The non-transitory computer-readable medium of claim 20 wherein the characteristic of the different route is an average travel time for the different route determined based on actual travel times of users of the plurality of users that have traveled the different route.
23. The non-transitory computer-readable medium of claim 20 wherein the characteristic of the different route is an average travel time for the different route determined based on actual travel times of users of the plurality of users that have traveled the different route during a desired time window.
24. The non-transitory computer-readable medium of claim 23 wherein the desired time window is a reoccurring time window corresponding to at least one of a group consisting of: a current time of day and a current day of the week.
Patent Citations (361)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5177685(A) | 1993-01-01 | Davis et al. | Applicant |
| US5220507(A) | 1993-06-01 | Kirson | Applicant |
| US5371678(A) | 1994-12-01 | Nomura | Applicant |
| US5452212(A) | 1995-09-01 | Yokoyama | Applicant |
| US5493692(A) | 1996-02-01 | Theimer et al. | Applicant |
| US5528501(A) | 1996-06-01 | Hanson | Applicant |
| US5539232(A) | 1996-07-01 | Nakanishi et al. | Applicant |
| US5659476(A) | 1997-08-01 | LeFebvre et al. | Applicant |
| US5682525(A) | 1997-10-01 | Bouve et al. | Applicant |
| US5729457(A) | 1998-03-01 | Seymour | Applicant |
| US5754939(A) | 1998-05-01 | Herz et al. | Applicant |
| US5790976(A) | 1998-08-01 | Boll et al. | Applicant |
| US5802492(A) | 1998-09-01 | DeLorme et al. | Examiner |
| US5848373(A) | 1998-12-01 | DeLorme et al. | Examiner |
| US5987380(A) | 1999-11-01 | Backman et al. | Applicant |
| US6014090(A) | 2000-01-01 | Rosen et al. | Applicant |
| US6023241(A) | 2000-02-01 | Clapper | Applicant |
| US6047235(A) | 2000-04-01 | Hiyokawa et al. | Applicant |
| US6049711(A) | 2000-04-01 | Ben-Yehezkel et al. | Applicant |
| US6098015(A) | 2000-08-01 | Nimura et al. | Applicant |
| US6124826(A) | 2000-09-01 | Garthwaite et al. | Applicant |
| US6127945(A) | 2000-10-01 | Mura-Smith | Applicant |
| US6204844(B1) | 2001-03-01 | Fumarolo et al. | Applicant |
| US6212474(B1) | 2001-04-01 | Fowler et al. | Applicant |
| US6240069(B1) | 2001-05-01 | Alperovich et al. | Applicant |
| US6249742(B1) | 2001-06-01 | Friederich et al. | Applicant |
| US6282492(B1) | 2001-08-01 | Gorai et al. | Applicant |
| US6321158(B1) | 2001-11-01 | DeLorme et al. | Examiner |
| US6324467(B1) | 2001-11-01 | Machii et al. | Applicant |
| US6334086(B1) | 2001-12-01 | Park et al. | Applicant |
| US6339746(B1) | 2002-01-01 | Sugiyama et al. | Applicant |
| US6349203(B1) | 2002-02-01 | Asaoka et al. | Applicant |
| US6366856(B1) | 2002-04-01 | Johnson | Applicant |
| US6415226(B1) | 2002-07-01 | Kozak | Applicant |
| US6424819(B1) | 2002-07-01 | Yan | Applicant |
| US6430498(B1) | 2002-08-01 | Maruyama et al. | Applicant |
| US6459987(B1) | 2002-10-01 | Krull et al. | Applicant |
| US6466938(B1) | 2002-10-01 | Goldberg | Applicant |
| US6477526(B2) | 2002-11-01 | Hayashi et al. | Applicant |
| US6480783(B1) | 2002-11-01 | Myr | Applicant |
| US6484092(B2) | 2002-11-01 | Seibel | Applicant |
| US6490587(B2) | 2002-12-01 | Easty et al. | Applicant |
| US6505118(B2) | 2003-01-01 | Chowanic et al. | Applicant |
| US6510379(B1) | 2003-01-01 | Hasegawa et al. | Applicant |
| US6526349(B2) | 2003-02-01 | Bullock et al. | Applicant |
| US6529136(B2) | 2003-03-01 | Cao et al. | Applicant |
| US6539080(B1) | 2003-03-01 | Bruce et al. | Applicant |
| US6539232(B2) | 2003-03-01 | Hendrey et al. | Applicant |
| US6542749(B2) | 2003-04-01 | Tanaka et al. | Applicant |
| US6542750(B2) | 2003-04-01 | Hendrey et al. | Applicant |
| US6546336(B1) | 2003-04-01 | Matsuoka et al. | Applicant |
| US6549768(B1) | 2003-04-01 | Fraccaroli | Applicant |
| US6567743(B1) | 2003-05-01 | Mueller et al. | Applicant |
| US6577949(B1) | 2003-06-01 | Robinson et al. | Applicant |
| US6580999(B2) | 2003-06-01 | Maruyama et al. | Applicant |
| US6611754(B2) | 2003-08-01 | Klein | Applicant |
| US6618593(B1) | 2003-09-01 | Drutman et al. | Applicant |
| US6633812(B1) | 2003-10-01 | Martin et al. | Applicant |
| US6654681(B1) | 2003-11-01 | Schmidt et al. | Applicant |
| US6662105(B1) | 2003-12-01 | Tada et al. | Applicant |
| US6694252(B2) | 2004-02-01 | Ukita | Applicant |
| US6708172(B1) | 2004-03-01 | Wong et al. | Applicant |
| US6721650(B2) | 2004-04-01 | Fushiki et al. | Applicant |
| US6721653(B2) | 2004-04-01 | Watanabe | Applicant |
| US6748317(B2) | 2004-06-01 | Maruyama et al. | Applicant |
| US6762696(B2) | 2004-07-01 | Hulverscheidt et al. | Applicant |
| US6765998(B2) | 2004-07-01 | Bruce et al. | Applicant |
| US6766245(B2) | 2004-07-01 | Padmanabhan | Applicant |
| US6778903(B2) | 2004-08-01 | Robinson et al. | Applicant |
| US6813502(B2) | 2004-11-01 | Son et al. | Applicant |
| US6819919(B1) | 2004-11-01 | Tanaka | Applicant |
| US6820005(B2) | 2004-11-01 | Matsuda et al. | Applicant |
| US6895329(B1) | 2005-05-01 | Wolfson | Applicant |
| US6961658(B2) | 2005-11-01 | Ohler | Applicant |
| US6968179(B1) | 2005-11-01 | De Vries | Applicant |
| US6987885(B2) | 2006-01-01 | Gonzalez-Banos et al. | Applicant |
| US7096233(B2) | 2006-08-01 | Mori et al. | Applicant |
| US7116985(B2) | 2006-10-01 | Wilson et al. | Applicant |
| US7123189(B2) | 2006-10-01 | Lalik et al. | Applicant |
| US7123918(B1) | 2006-10-01 | Goodman | Applicant |
| US7130740(B2) | 2006-10-01 | Vanegas et al. | Applicant |
| US7149625(B2) | 2006-12-01 | Mathews et al. | Applicant |
| US7158798(B2) | 2007-01-01 | Lee et al. | Applicant |
| US7158876(B2) | 2007-01-01 | Crook | Applicant |
| US7167910(B2) | 2007-01-01 | Farnham et al. | Applicant |
| US7200638(B2) | 2007-04-01 | Lake | Applicant |
| US7231293(B2) | 2007-06-01 | Lapstun et al. | Applicant |
| US7234117(B2) | 2007-06-01 | Zaner et al. | Applicant |
| US7236739(B2) | 2007-06-01 | Chang | Applicant |
| US7236799(B2) | 2007-06-01 | Wilson et al. | Applicant |
| US7239960(B2) | 2007-07-01 | Yokota et al. | Applicant |
| US7243134(B2) | 2007-07-01 | Bruner et al. | Applicant |
| US7247024(B2) | 2007-07-01 | Bright et al. | Applicant |
| US7248841(B2) | 2007-07-01 | Agee et al. | Applicant |
| US7254406(B2) | 2007-08-01 | Beros et al. | Applicant |
| US7269590(B2) | 2007-09-01 | Hull et al. | Applicant |
| US7271742(B2) | 2007-09-01 | Sheha et al. | Applicant |
| US7272357(B2) | 2007-09-01 | Nishiga et al. | Applicant |
| US7280822(B2) | 2007-10-01 | Fraccaroli | Applicant |
| US7283628(B2) | 2007-10-01 | Stein et al. | Applicant |
| US7333820(B2) | 2008-02-01 | Sheha et al. | Applicant |
| US7333889(B2) | 2008-02-01 | Hashizume | Applicant |
| US7336928(B2) | 2008-02-01 | Paalasmaa et al. | Applicant |
| US7398081(B2) | 2008-07-01 | Moran | Applicant |
| US7418268(B1) | 2008-08-01 | Cabano et al. | Applicant |
| US7423580(B2) | 2008-09-01 | Markhovsky et al. | Applicant |
| US7424363(B2) | 2008-09-01 | Cheng et al. | Applicant |
| US7444237(B2) | 2008-10-01 | Dale | Applicant |
| US7444655(B2) | 2008-10-01 | Sardera | Applicant |
| US7509093(B2) | 2009-03-01 | Persson et al. | Applicant |
| US7509131(B2) | 2009-03-01 | Krumm et al. | Applicant |
| US7538691(B2) | 2009-05-01 | Horstemeyer | Applicant |
| US7558404(B2) | 2009-07-01 | Ma et al. | Applicant |
| US7590486(B2) | 2009-09-01 | Okude et al. | Applicant |
| US7617542(B2) | 2009-11-01 | Vataja | Applicant |
| US7620404(B2) | 2009-11-01 | Chesnais et al. | Applicant |
| US7624024(B2) | 2009-11-01 | Levis et al. | Examiner |
| US7680959(B2) | 2010-03-01 | Svendsen | Applicant |
| US7694156(B2) | 2010-04-01 | Gammel et al. | Applicant |
| US7698061(B2) | 2010-04-01 | Singh | Applicant |
| US7702456(B2) | 2010-04-01 | Singh | Applicant |
| US7706280(B2) | 2010-04-01 | Raciborski et al. | Applicant |
| US7729947(B1) | 2010-06-01 | Philbin et al. | Applicant |
| US7787886(B2) | 2010-08-01 | Markhovsky et al. | Applicant |
| US7809500(B2) | 2010-10-01 | Couckuyt et al. | Applicant |
| US7874521(B2) | 2011-01-01 | Shuster | Applicant |
| US7890871(B2) | 2011-02-01 | Etkin | Applicant |
| US7912642(B2) | 2011-03-01 | Zhao et al. | Examiner |
| US7917154(B2) | 2011-03-01 | Fortescue et al. | Applicant |
| US8000726(B2) | 2011-08-01 | Altman et al. | Applicant |
| US8010601(B2) | 2011-08-01 | Jennings et al. | Applicant |
| US8073140(B2) | 2011-12-01 | Shirai et al. | Applicant |
| US8208943(B2) | 2012-06-01 | Petersen et al. | Applicant |
| US8249807(B1) | 2012-08-01 | Barbeau et al. | Examiner |
| US2001/0013009(A1) | 2001-08-01 | Greening et al. | Applicant |
| US2001/0019309(A1) | 2001-09-01 | Saeki et al. | Applicant |
| US2001/0029425(A1) | 2001-10-01 | Myr | Applicant |
| US2001/0044310(A1) | 2001-11-01 | Lincke | Applicant |
| US2001/0047241(A1) | 2001-11-01 | Khavakh et al. | Applicant |
| US2001/0056325(A1) | 2001-12-01 | Pu et al. | Applicant |
| US2002/0010628(A1) | 2002-01-01 | Burns | Applicant |
| US2002/0049690(A1) | 2002-04-01 | Takano | Applicant |
| US2002/0062368(A1) | 2002-05-01 | Holtzman et al. | Applicant |
| US2002/0070862(A1) | 2002-06-01 | Francis et al. | Applicant |
| US2002/0086676(A1) | 2002-07-01 | Hendrey et al. | Applicant |
| US2002/0087335(A1) | 2002-07-01 | Meyers et al. | Applicant |
| US2002/0120396(A1) | 2002-08-01 | Boies et al. | Applicant |
| US2002/0128773(A1) | 2002-09-01 | Chowanic et al. | Applicant |
| US2002/0152020(A1) | 2002-10-01 | Seibel | Applicant |
| US2002/0156572(A1) | 2002-10-01 | Bullock et al. | Examiner |
| US2002/0165662(A1) | 2002-11-01 | Maruyama et al. | Applicant |
| US2003/0005056(A1) | 2003-01-01 | Yamamoto et al. | Applicant |
| US2003/0055558(A1) | 2003-03-01 | Watanabe et al. | Applicant |
| US2003/0105585(A1) | 2003-06-01 | Ukita | Applicant |
| US2003/0109985(A1) | 2003-06-01 | Kotzin | Applicant |
| US2003/0126100(A1) | 2003-07-01 | Chithambaram | Applicant |
| US2003/0144794(A1) | 2003-07-01 | Schuessler | Applicant |
| US2003/0158855(A1) | 2003-08-01 | Farnham et al. | Applicant |
| US2003/0163333(A1) | 2003-08-01 | Podgurny et al. | Applicant |
| US2003/0182052(A1) | 2003-09-01 | DeLorme et al. | Applicant |
| US2003/0191584(A1) | 2003-10-01 | Robinson et al. | Applicant |
| US2003/0195695(A1) | 2003-10-01 | Maruyama et al. | Applicant |
| US2004/0009750(A1) | 2004-01-01 | Beros et al. | Applicant |
| US2004/0025185(A1) | 2004-02-01 | Goci et al. | Applicant |
| US2004/0106415(A1) | 2004-06-01 | Maeda et al. | Applicant |
| US2004/0117110(A1) | 2004-06-01 | Sasajima | Applicant |
| US2004/0158393(A1) | 2004-08-01 | Oonishi et al. | Applicant |
| US2004/0172191(A1) | 2004-09-01 | Vitikainen et al. | Applicant |
| US2004/0181668(A1) | 2004-09-01 | Blew et al. | Applicant |
| US2004/0186661(A1) | 2004-09-01 | Barton | Applicant |
| US2004/0192331(A1) | 2004-09-01 | Gorday et al. | Applicant |
| US2004/0192339(A1) | 2004-09-01 | Wilson et al. | Applicant |
| US2004/0196163(A1) | 2004-10-01 | Takenaga et al. | Applicant |
| US2004/0203902(A1) | 2004-10-01 | Wilson et al. | Applicant |
| US2004/0203903(A1) | 2004-10-01 | Wilson et al. | Applicant |
| US2004/0224702(A1) | 2004-11-01 | Chaskar | Applicant |
| US2004/0225436(A1) | 2004-11-01 | Yoshihashi | Applicant |
| US2005/0015432(A1) | 2005-01-01 | Cohen | Applicant |
| US2005/0027442(A1) | 2005-02-01 | Kelley et al. | Applicant |
| US2005/0038876(A1) | 2005-02-01 | Chaudhuri | Applicant |
| US2005/0043881(A1) | 2005-02-01 | Brulle-Drews et al. | Applicant |
| US2005/0060088(A1) | 2005-03-01 | Helal et al. | Applicant |
| US2005/0064864(A1) | 2005-03-01 | Horton et al. | Examiner |
| US2005/0070298(A1) | 2005-03-01 | Caspi et al. | Applicant |
| US2005/0080556(A1) | 2005-04-01 | Toelle | Applicant |
| US2005/0096840(A1) | 2005-05-01 | Simske | Applicant |
| US2005/0102098(A1) | 2005-05-01 | Montealegre et al. | Applicant |
| US2005/0102101(A1) | 2005-05-01 | Beesley et al. | Applicant |
| US2005/0113123(A1) | 2005-05-01 | Torvinen | Applicant |
| US2005/0130634(A1) | 2005-06-01 | Godfrey | Applicant |
| US2005/0131628(A1) | 2005-06-01 | Peeters | Applicant |
| US2005/0174975(A1) | 2005-08-01 | Mgrdechian et al. | Applicant |
| US2005/0192742(A1) | 2005-09-01 | Okochi | Applicant |
| US2005/0198305(A1) | 2005-09-01 | Pezaris et al. | Applicant |
| US2005/0209773(A1) | 2005-09-01 | Hara | Applicant |
| US2005/0210387(A1) | 2005-09-01 | Alagappan et al. | Applicant |
| US2005/0231425(A1) | 2005-10-01 | Coleman et al. | Applicant |
| US2005/0246095(A1) | 2005-11-01 | Banet et al. | Applicant |
| US2005/0256635(A1) | 2005-11-01 | Gardner | Applicant |
| US2005/0272413(A1) | 2005-12-01 | Bourne | Applicant |
| US2005/0278371(A1) | 2005-12-01 | Funk et al. | Applicant |
| US2005/0288859(A1) | 2005-12-01 | Golding | Applicant |
| US2006/0004512(A1) | 2006-01-01 | Herbst et al. | Applicant |
| US2006/0004713(A1) | 2006-01-01 | Korte et al. | Applicant |
| US2006/0009907(A1) | 2006-01-01 | Kuroda et al. | Applicant |
| US2006/0015249(A1) | 2006-01-01 | Gieseke | Applicant |
| US2006/0031007(A1) | 2006-02-01 | Agnew et al. | Applicant |
| US2006/0036363(A1) | 2006-02-01 | Crook | Applicant |
| US2006/0036457(A1) | 2006-02-01 | McNamara | Applicant |
| US2006/0046740(A1) | 2006-03-01 | Johnson | Applicant |
| US2006/0046743(A1) | 2006-03-01 | Mirho | Applicant |
| US2006/0047568(A1) | 2006-03-01 | Eisenberg et al. | Applicant |
| US2006/0048059(A1) | 2006-03-01 | Etkin | Applicant |
| US2006/0069500(A1) | 2006-03-01 | Hashizume | Applicant |
| US2006/0069503(A1) | 2006-03-01 | Suomela et al. | Applicant |
| US2006/0080029(A1) | 2006-04-01 | Kodani et al. | Applicant |
| US2006/0080034(A1) | 2006-04-01 | Hayashi | Applicant |
| US2006/0082472(A1) | 2006-04-01 | Adachi et al. | Applicant |
| US2006/0085419(A1) | 2006-04-01 | Rosen | Applicant |
| US2006/0129308(A1) | 2006-06-01 | Kates | Applicant |
| US2006/0149461(A1) | 2006-07-01 | Rowley et al. | Applicant |
| US2006/0161599(A1) | 2006-07-01 | Rosen | Applicant |
| US2006/0166679(A1) | 2006-07-01 | Karaoguz et al. | Applicant |
| US2006/0184313(A1) | 2006-08-01 | Butler | Applicant |
| US2006/0195361(A1) | 2006-08-01 | Rosenberg | Applicant |
| US2006/0203804(A1) | 2006-09-01 | Whitmore et al. | Applicant |
| US2006/0217879(A1) | 2006-09-01 | Ikeuchi et al. | Applicant |
| US2006/0227047(A1) | 2006-10-01 | Rosenberg | Applicant |
| US2006/0229058(A1) | 2006-10-01 | Rosenberg | Applicant |
| US2006/0229802(A1) | 2006-10-01 | Vertelney et al. | Applicant |
| US2006/0247849(A1) | 2006-11-01 | Mohsini et al. | Applicant |
| US2006/0247852(A1) | 2006-11-01 | Kortge et al. | Applicant |
| US2006/0256959(A1) | 2006-11-01 | Hymes | Applicant |
| US2006/0265119(A1) | 2006-11-01 | McMahan et al. | Applicant |
| US2006/0265121(A1) | 2006-11-01 | Kuo et al. | Applicant |
| US2006/0270419(A1) | 2006-11-01 | Crowley et al. | Applicant |
| US2006/0287815(A1) | 2006-12-01 | Gluck | Applicant |
| US2007/0005419(A1) | 2007-01-01 | Horvitz et al. | Applicant |
| US2007/0015518(A1) | 2007-01-01 | Winter et al. | Applicant |
| US2007/0030824(A1) | 2007-02-01 | Ribaudo et al. | Applicant |
| US2007/0032242(A1) | 2007-02-01 | Goodman | Applicant |
| US2007/0032942(A1) | 2007-02-01 | Thota | Applicant |
| US2007/0037574(A1) | 2007-02-01 | Libov et al. | Applicant |
| US2007/0050129(A1) | 2007-03-01 | Salmre | Applicant |
| US2007/0075898(A1) | 2007-04-01 | Markhovsky et al. | Applicant |
| US2007/0078596(A1) | 2007-04-01 | Grace | Applicant |
| US2007/0083428(A1) | 2007-04-01 | Goldstein | Applicant |
| US2007/0093955(A1) | 2007-04-01 | Hughes | Applicant |
| US2007/0118278(A1) | 2007-05-01 | Finn et al. | Applicant |
| US2007/0124157(A1) | 2007-05-01 | Laumeyer et al. | Applicant |
| US2007/0135138(A1) | 2007-06-01 | Brown et al. | Applicant |
| US2007/0142065(A1) | 2007-06-01 | Richey et al. | Applicant |
| US2007/0149214(A1) | 2007-06-01 | Walsh et al. | Applicant |
| US2007/0150444(A1) | 2007-06-01 | Chesnais et al. | Applicant |
| US2007/0155416(A1) | 2007-07-01 | Donnellan | Applicant |
| US2007/0159299(A1) | 2007-07-01 | Tsai | Applicant |
| US2007/0167174(A1) | 2007-07-01 | Halcrow et al. | Applicant |
| US2007/0168888(A1) | 2007-07-01 | Jawerth | Applicant |
| US2007/0174243(A1) | 2007-07-01 | Fritz | Applicant |
| US2007/0179863(A1) | 2007-08-01 | Stoll | Applicant |
| US2007/0202844(A1) | 2007-08-01 | Wilson et al. | Applicant |
| US2007/0203644(A1) | 2007-08-01 | Thota et al. | Applicant |
| US2007/0210937(A1) | 2007-09-01 | Smith et al. | Applicant |
| US2007/0218900(A1) | 2007-09-01 | Abhyanker | Applicant |
| US2007/0244633(A1) | 2007-10-01 | Phillips et al. | Applicant |
| US2007/0255785(A1) | 2007-11-01 | Hayashi et al. | Applicant |
| US2007/0255831(A1) | 2007-11-01 | Hayashi et al. | Applicant |
| US2007/0260393(A1) | 2007-11-01 | Abernethy et al. | Applicant |
| US2007/0282621(A1) | 2007-12-01 | Altman et al. | Applicant |
| US2007/0290832(A1) | 2007-12-01 | Kalinichenko et al. | Applicant |
| US2008/0004043(A1) | 2008-01-01 | Wilson et al. | Applicant |
| US2008/0016018(A1) | 2008-01-01 | Malik | Applicant |
| US2008/0016205(A1) | 2008-01-01 | Svendsen | Applicant |
| US2008/0027643(A1) | 2008-01-01 | Basir et al. | Applicant |
| US2008/0030376(A1) | 2008-02-01 | Tunnell et al. | Applicant |
| US2008/0048856(A1) | 2008-02-01 | Culpepper et al. | Applicant |
| US2008/0076418(A1) | 2008-03-01 | Beyer, Jr. | Applicant |
| US2008/0086741(A1) | 2008-04-01 | Feldman et al. | Applicant |
| US2008/0097999(A1) | 2008-04-01 | Horan | Applicant |
| US2008/0106599(A1) | 2008-05-01 | Liu et al. | Applicant |
| US2008/0113674(A1) | 2008-05-01 | Baig | Applicant |
| US2008/0118106(A1) | 2008-05-01 | Kilambi et al. | Applicant |
| US2008/0134088(A1) | 2008-06-01 | Tse et al. | Applicant |
| US2008/0140650(A1) | 2008-06-01 | Stackpole | Applicant |
| US2008/0146157(A1) | 2008-06-01 | Aaron | Applicant |
| US2008/0146250(A1) | 2008-06-01 | Aaron | Applicant |
| US2008/0155080(A1) | 2008-06-01 | Marlow et al. | Applicant |
| US2008/0177469(A1) | 2008-07-01 | Geelen et al. | Applicant |
| US2008/0182563(A1) | 2008-07-01 | Wugofski et al. | Applicant |
| US2008/0182591(A1) | 2008-07-01 | Krikorian | Applicant |
| US2008/0188246(A1) | 2008-08-01 | Sheha et al. | Examiner |
| US2008/0188261(A1) | 2008-08-01 | Arnone | Applicant |
| US2008/0195428(A1) | 2008-08-01 | O'Sullivan | Applicant |
| US2008/0222295(A1) | 2008-09-01 | Robinson et al. | Applicant |
| US2008/0227473(A1) | 2008-09-01 | Haney | Applicant |
| US2008/0242317(A1) | 2008-10-01 | Abhyanker | Applicant |
| US2008/0250312(A1) | 2008-10-01 | Curtis | Applicant |
| US2008/0262717(A1) | 2008-10-01 | Ettinger | Applicant |
| US2008/0280626(A1) | 2008-11-01 | Choi et al. | Applicant |
| US2008/0288355(A1) | 2008-11-01 | Rosen | Applicant |
| US2008/0306826(A1) | 2008-12-01 | Kramer et al. | Applicant |
| US2008/0318597(A1) | 2008-12-01 | Berns et al. | Applicant |
| US2008/0319808(A1) | 2008-12-01 | Wofford et al. | Applicant |
| US2009/0005965(A1) | 2009-01-01 | Forstall et al. | Applicant |
| US2009/0023410(A1) | 2009-01-01 | Ghosh | Applicant |
| US2009/0024315(A1) | 2009-01-01 | Scheibe | Applicant |
| US2009/0030999(A1) | 2009-01-01 | Gatzke et al. | Applicant |
| US2009/0047972(A1) | 2009-02-01 | Neeraj | Applicant |
| US2009/0076894(A1) | 2009-03-01 | Bates et al. | Applicant |
| US2009/0082038(A1) | 2009-03-01 | McKiou et al. | Applicant |
| US2009/0103722(A1) | 2009-04-01 | Anderson et al. | Applicant |
| US2009/0106040(A1) | 2009-04-01 | Jones | Applicant |
| US2009/0111438(A1) | 2009-04-01 | Chan | Applicant |
| US2009/0112467(A1) | 2009-04-01 | Jiang et al. | Applicant |
| US2009/0115570(A1) | 2009-05-01 | Cusack, Jr. | Applicant |
| US2009/0115617(A1) | 2009-05-01 | Sano et al. | Applicant |
| US2009/0132652(A1) | 2009-05-01 | Athale et al. | Applicant |
| US2009/0138346(A1) | 2009-05-01 | Kalaboukis et al. | Applicant |
| US2009/0143984(A1) | 2009-06-01 | Baudisch et al. | Applicant |
| US2009/0144211(A1) | 2009-06-01 | O'Sullivan et al. | Applicant |
| US2009/0150501(A1) | 2009-06-01 | Davis et al. | Applicant |
| US2009/0157312(A1) | 2009-06-01 | Black et al. | Applicant |
| US2009/0164431(A1) | 2009-06-01 | Zivkovic et al. | Applicant |
| US2009/0164459(A1) | 2009-06-01 | Jennings et al. | Applicant |
| US2009/0182492(A1) | 2009-07-01 | Alten | Applicant |
| US2009/0201896(A1) | 2009-08-01 | Davis et al. | Applicant |
| US2009/0210480(A1) | 2009-08-01 | Sivasubramaniam et al. | Applicant |
| US2009/0239552(A1) | 2009-09-01 | Churchill et al. | Applicant |
| US2009/0307263(A1) | 2009-12-01 | Skibiski et al. | Applicant |
| US2010/0004857(A1) | 2010-01-01 | Pereira et al. | Applicant |
| US2010/0017261(A1) | 2010-01-01 | Evans et al. | Applicant |
| US2010/0020776(A1) | 2010-01-01 | Youssef et al. | Applicant |
| US2010/0027527(A1) | 2010-02-01 | Higgins et al. | Applicant |
| US2010/0030459(A1) | 2010-02-01 | Geelen et al. | Applicant |
| US2010/0130226(A1) | 2010-05-01 | Arrasvuori et al. | Applicant |
| US2010/0169131(A1) | 2010-07-01 | Robertson | Applicant |
| US2010/0197318(A1) | 2010-08-01 | Petersen et al. | Applicant |
| US2010/0197319(A1) | 2010-08-01 | Petersen et al. | Applicant |
| US2010/0198826(A1) | 2010-08-01 | Petersen et al. | Applicant |
| US2010/0198828(A1) | 2010-08-01 | Petersen et al. | Applicant |
| US2010/0198862(A1) | 2010-08-01 | Jennings et al. | Applicant |
| US2010/0198870(A1) | 2010-08-01 | Petersen et al. | Applicant |
| US2010/0198917(A1) | 2010-08-01 | Petersen et al. | Applicant |
| US2010/0217525(A1) | 2010-08-01 | King et al. | Applicant |
| US2011/0136506(A1) | 2011-06-01 | Stewart | Applicant |
| US2012/0041672(A1) | 2012-02-01 | Curtis et al. | Examiner |
| US2012/0041983(A1) | 2012-02-01 | Jennings | Applicant |
| US2012/0042046(A1) | 2012-02-01 | Petersen et al. | Applicant |
| US2012/0042258(A1) | 2012-02-01 | Etkin | Applicant |
| US2012/0072495(A1) | 2012-03-01 | Jennings et al. | Applicant |
| US2012/0173135(A1) | 2012-07-01 | Gutman | Examiner |
| CN1776684(A) | 2006-05-01 | Applicant | |
| CN101118162(A) | 2008-02-01 | Applicant | |
| EP1463354 | 2005-12-01 | Applicant | |
| JP9-287970 | 1997-04-01 | Applicant | |
| JP2003132158 | 2003-05-01 | Applicant | |
| JP2004045054 | 2004-02-01 | Applicant | |
| WO3/081391(A2) | 2003-10-01 | Applicant | |
| WO2008/000046 | 2008-01-01 | Applicant | |
| WO2009/045262(A2) | 2009-04-01 | Applicant | |
| WO2009/070368(A1) | 2009-06-01 | Applicant |
Non-Patent Literature (88)
- “About Google Map Maker,” at <http://sites.google.com/site/mapmakeruserhelp/home>, printed May 21, 2009, 1 page.Applicant
- “AirSage's WiSE Technology,” at <http://www.airsage.com/site/index.cfm?id—art=46598&actMenuItemID=22134&vsprache/EN/AIRSAGE—WiSE—TECHNOLOGY—L.cfm>, viewed as early as Mar. 22, 2010, company founded in May 2000, 1 page.Applicant
- Ardagna, C.A. et al., “Location Privacy Protection Through Obfuscation-based Techniques”, Lecture Notes in Computer Science, 2007, vol. 4602, pp. 47-60, Data and Applications Security XXI, Jul. 8-11, 2007, Redondo Beach, California, 16 pages.Applicant
- Bruntrup, R. et al., “Incremental Map Generation with GPS Traces,” Presentation Slides, University of Dortmund, Germany, 2005, found at <http://www.google.com/url?sa=t&rct=j&q=bruntrup%20incremental%20map%20generation&source=web&cd=2&ved=0CCoQFjAB&url=http%3A%2F%2Fmapgeneration.berlios.de%2Ftiki%2Ftiki-download—wiki—attachment.php%3Fattld%3D1&ei=ZruVT—O8J9L16AGV-LGKBA&usg=AFQjCNF4B61uAHpAjtDc46FyNLqw4bgl1A>, 16 pages.Applicant
- Bruntrup, R., et al., “Incremental Map Generation with GPS Traces,” in Proc. of the IEEE Conference on Intelligent Transportation Systems, Sep. 13-16, 2005, Vienna, Austria, pp. 574-579, copyright 2005, IEEE, 7 pages.Applicant
- Davies, J. J. et al., “Distributed, vehicular computation for map generation,” presentation slides, 2007 Annual Meeting of the Association of American Geographers, Apr. 2007, found at <http://www.cl.cam.ac.uk/research/dtg/www/files/publications/public/jjd27/davies-aag07.pdf>, 21 pages.Applicant
- Davies, J. J. et al., “Scalable, Distributed, Real-Time Map Generation,” Pervasive Computing, vol. 5, No. 4, Oct.-Dec. 2006, pp. 47-54, copyright 2006, IEEE, 9 pages.Applicant
- Ekpenyong, F. et al., “Updating of Road Network Databases: Spatio-Temporal Trajectory Grouping Using Snap-Drift Neural Network,” In Proceedings of International Conference on Engineering Applications of Neural Networks, EANN 2007, Aug. 29-31, 2007, Thessaloniki, Greece, 10 pages.Applicant
- Abstract, Ekpenyong, F., Palmer-Brown, D., and Brimicombe, A., “Extracting road information from recorded GPS data using snap-drift neural network,” Neurocomputing, vol. 73, Issues 1-3, Dec. 2009, pp. 24-36, 6 pages.Applicant
- “Fire Eagle : What is Fire Eagle?”, found at <http://fireeagle.yahoo.net/help> on the Internet Archive, dated Jul. 9, 2011, copyright 2007-2011, Yahoo! Inc., printed Nov. 10, 2011, 4 pages.Applicant
- “Fire Eagle,” at <http://fireeagle.yahoo.net>, copyright 2007-2011, Yahoo! Inc., printed Apr. 28, 2011, 2 pages.Applicant
- “Intel and Arm collaborate on device security”, Oct. 15, 2007, at <http://www.windowsfordevices.com/news/NS5120676853.html>, copyright 1996-2010, Ziff Davis Enterprise Holdings, Inc., printed Apr. 20, 2012, 5 pages.Applicant
- Jones, M., “Matt's Wikimapia Blog,” Sep. 15, 2006, at <http://wikimapia.mattjonesblog.com/2006/09/15/how-to-1-adding-a-new-place/>, printed May 21, 2009, 24 pages.Applicant
- “OpenStreetMap,” <http://www.openstreetmap.org/>, printed May 21, 2009, 1 page.Applicant
- Privat, Ludovic, “NAVX: ‘We provide Content to TomTom, Garmin and Mio,’” GPS Business News, Feb. 2, 2009, at <http://www.gpsbusinessnews.com/NAVX-we-provide-content-to-TomTom,-Garmin-and-Mio-—a1305.html>, printed Apr. 20, 2012, 2 pages.Applicant
- Priya Ganapati, “Navigation Companies Crowdsource Maps, Traffic Services,” Feb. 11, 2009, at <http://www.wired.com/gadgetlab/2009/02/user-generated/>, printed May 21, 2009, 4 pages.Applicant
- Shankland, Stephen, “Google crowdsources maps directions, too,” Mar. 11, 2009, at <http://news.cnet.com/8301-17939—109-10193481-2.html>, printed May 21, 2009, 3 pages.Applicant
- “WikiMapia,” Wikipedia, at <http://en.wikipedia.org/wiki/WikiMapia>, last modified May 19, 2009, printed May 21, 2009, 4 pages.Applicant
- Zahradnik, Fred, “Dash Express is Innovative, but There's Room for Improvement,” at <http://gps.about.com/od/incarportablegp1/fr/dash—review.htm>, from the Internet Archive, dated Nov. 8, 2009, printed Apr. 20, 2012, 3 pages.Applicant
- Abstract, CN 101118162 A, published Feb. 6, 2008, Applicant: E Ten Information Sys Co Ltd, Inventor: Shicheng Huang, printed from www.espacenet.com on Jun. 9, 2011, 1 page.Applicant
- Choney, Suzanne, “Mobile services mushroom for locating friends,” Aug. 14, 2008, copyright 2008, MSNBC.com, 1 page.Applicant
- “dodgeball.com :: mobile social software,” at <http://www.dodgeball.com/>, copyright 2008, Google Inc., printed Jan. 16, 2008, 1 page.Applicant
- Jones, Q. et al., “Urban Enclave Location-Aware Social Computing,” Proceeds of Internet Research 7.0: Internet Convergences, Brisbane, Australia, Sep. 27-30, 2006, found at <http://aoir.org/files/c4d0c2e397e8a5ddb140a40f7fa9.pdf>, 10 pages.Applicant
- Millonig, A. and Schechtner, K., “Developing Landmark-based Pedestrian Navigation Systems,” Proceedings of the 8th International IEEE Conference on Intelligent Transportation Systems, Vienna, Austria, Sep. 13-16, 2005, copyright 2005, IEEE, 6 pages.Applicant
- “MySpace,” at <http://www.myspace.com/>, copyright 2003-2008, MySpace.com, printed Jan. 16, 2008, 2 pages.Applicant
- “Neatcall—Products,” found at <http://neatcall.com/index.php?dir=site&page=content&cs=3008> on Internet Archive, dated Mar. 1, 2010, copyright 2010, Neatcall Ltd., printed Oct. 26, 2011, 2 pages.Applicant
- “TrackItBack—The World's Largest Lost & Found Recovery Service | News,” articles dating from Mar. 29, 2005, to Jun. 27, 2008, found at <http://www.trackitback.com/portal/press.html>, copyright 2003-2011, TrackItBack, printed on Apr. 18, 2011, 4 pages.Applicant
- MacArthur, Amanda, “21 iPhone Food Apps to Eat Your Heart Out,” at <http://mashable.com/2008/08/13/iphone-food-apps/>, Aug. 13, 2008, 11 pages.Applicant
- Vigueras, G. et al., “A comparative study of partitioning methods for crowd simulations,” Applied Soft Computing, vol. 10, Issue 1, Jan. 2010, received Dec. 20, 2008, received in revised form Jul. 1, 2009, available online Jul. 22, 2009, pp. 225-235, 12 pages.Applicant
- Penrod, Sam, “Automobile Navigator,” Magellan's Roadmate 360, Dec. 18, 2005, <http://www.gpsinformation.org/penrod/rm360/rm360.html>17 pages.Applicant
- Oh, Sejin et al., “CAMAR: Context-aware Mobile Augmented Reality in Smart Space,” In Proceedings of International Workshop on Ubiquitous Virtual Reality 2009, Bruce Thomas et al. (Eds.), Jan. 15-18, 2009, University of South Australia, Adelaide, Australia, pp. 48-51, 4 pages.Applicant
- “CitySense—Powered by Sense Networks,” at <http://www.citysense.com/moreinfo.php>, copyright 2008, Sense Networks, printed Sep. 8, 2009, 2 pages.Applicant
- “ConnectingCadence.com—Mapping the social world.,” at <http://www.connectingcadence.com/>, found on the Internet Archive, copyright 2008, ConnectingCadence, printed Apr. 28, 2011, 1 page.Applicant
- Wu et al., “Crowd Flow Segmentation Using a Novel Region Growing Scheme,” In Proceedings PCM 2009, 10th Pacific Rim Conference on Multimedia, Bangkok, Thailand, Dec. 15-18, 2009, pp. 898-907, 10 pages.Applicant
- Benford, S. et al., “Crowded Collaborative Virtual Environments,” Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, Atlanta, Georgia, Mar. 22-27, 1997, 7 pages.Applicant
- Anciaux, N. et al., “Data Degradation: Making Private Data Less Sensitive Over Time,” CIKM 2008, Oct. 26-30, 2008, Napa Valley, California, 2 pages.Applicant
- Harney, John, Digital prospecting—social networks in sales, Jun. 1, 2004, KMWorld.com, available at <http://www.kmworld.com/Articles/ReadArticle.aspx?ArticleID=9558>, printed Dec. 21, 2011, 3 pages.Applicant
- Ngai, Wang Kay et al., “Efficient Clustering of Uncertain Data,” Proceedings of the Sixth International Conference on Data Mining (ICDM'06), Dec. 18-22, 2006, pp. 436-445, copyright 2006, IEEE, 10 pages.Applicant
- Ertoz, L. et al., “Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data,” Proceedings of the 2003 SIAM International Conference on Data Mining (SDM 2003), Jan. 24, 2003, pp. 47-58, San Francisco, CA, 12 pages.Applicant
- “Flickr Shapefiles Public Dataset 1.0,” posted by aaron on May 21, 2009, found at <http://code.flickr.com/blog/2009/05/21/flickr-shapefiles-public-dataset-10/>, Yahoo! Inc., printed Jul. 13, 2011, 5 pages.Applicant
- “Friend of a Friend (FOAF) project,” at <http://www.foaf-project.org/>, from the Internet Archive dated May 26, 2008, printed Aug. 10, 2012, 2 pages.Applicant
- “Garmin: MapSource POI Sources,” at <http://www8.garmin.com/products/poiloader/POISource/>, earliest date available for this webpage on Internet Archive is Oct. 24, 2005, copyright 1996-2012, Garmin Ltd., printed Apr. 3, 2012, 4 pages.Applicant
- “Google Maps,” at <http://maps.google.com>, printed May 3, 2011, 1 page.Applicant
- “Goombah” Preview, at <http://www.goombah.com/preview.html>, printed Jan. 8, 2008, 5 pages.Applicant
- “GPS software for cell phones, update Nov. 2008,” Nov. 2008, at <http://www.gps-practice-and-fun.com/gps-software-for-cell-phones-update.html>, copyright GPS-practice-and-fun.com, printed Apr. 22, 2009, 6 pages.Applicant
- “Harnessing Dynamic Personal Social Network Applications,” posted Jan. 13, 2009, peterpixel, at <http://www.peterpixel.nl/writings/harnessing-dynamic-personal-social-network-applications/>, printed Jun. 12, 2009, 4 pages.Applicant
- Tan, Thai, “Honda GPS with Weather Info and Social Networking,” Oct. 16, 2006, laptoplogic.com, at <http://laptoplogic.com/news/detail.php?id=1557>, copyright 2007-2009, LaptopLogic, printed Apr. 22, 2009, 3 pages.Applicant
- Arrington, M., “I Saw the Future of Social Networking the Other Day,” TechCrunch, Apr. 9, 2008, at <http://www.techcrunch.com/2008/04/09/i-saw-the-future-of-social-networking-the-other-day/>, printed May 27, 2009, 28 pages.Applicant
- Estrin, M., “Is the MySpace crowd lying to marketers?”, Oct. 16, 2007, posted at iMedia Connection, at <http://www.innediaconnection.com/content/16993.asp>, copyrighted by iMedia Communications, Inc., printed Apr. 28, 2011, 2 pages.Applicant
- Acroterion, “Knowledge Base Social Network Applications,” available at <http://www.acroterion.ca/Knowledge—Base—Social—Network—Applications.html>, copyright 2001-2005, printed Dec. 21, 2011, 2 pages.Applicant
- “About Loopt,” at <http://about.loopt.com/>, printed May 3, 2011, 4 pages.Applicant
- “Loopt—About Us,” at <https://loopt.com/loopt/aboutUs.aspx>, from the Internet Archive, dated Jun. 29, 2007, copyright 2007, Loopt, Inc., 1 page.Applicant
- Microsoft Outlook 2000 SP-3, email example, printed Oct. 23, 2007, copyright 1995-1999, Microsoft Corp., 3 pages.Applicant
- “MobiClique,” copyright 2007-2009, Thomson, originally found at <http://www.thlab.net/˜apietila/mobiclique/>, printed Oct. 23, 2009, 5 pages.Applicant
- Abstract, Ratti, C. et al., “Mobile Landscapes: using location data from cell phones for urban analysis,” Environment and Planning B: Planning and Design, vol. 33, No. 5, 2006, pp. 727-748, 1 page.Applicant
- “Online adult dating service and personals—Lavalife—Where Singles Click,” at <http://lavalife.com/>, copyright 2006, Lavalife Corp., printed Jan. 16, 2008, 1 page.Applicant
- Hardt, D. et al., “OpenID Attribute Exchange 1.0—Final,” at <http://openid.net/specs/openid-attribute-exchange-1—0.html>, Dec. 5, 2007, 11 pages.Applicant
- “OpenID Foundation website,” at <http://openid.net>, copyright 2006-2011, OpenID Foundation, printed Apr. 28, 2011, 2 pages.Applicant
- PAJ 2003-132158.Applicant
- Quinn, M. et al., “Parallel Implementation of the Social Forces Model,” Proceedings of the Second International Conference in Pedestrian and Evacuation Dynamics, Greenwich, England, 2003, pp. 63-74, found at <http://web.engr.oregonstate.edu/˜metoyer/docs/parallelPeds.pdf>, 12 pages.Applicant
- “Plazes—Right Plaze, Right Time,” at <http://plazes.com>, copyright 2004-2011, Plazes AG, printed May 3, 2011, 2 pages.Applicant
- Miller, B. N. et al., “PocketLens: Toward a Personal Recommender System,” ACM Transactions on Information Systems, vol. 22, No. 3, Jul. 2004, pp. 437-476, 40 pages.Applicant
- “Portable Contacts,” at <http://portablecontacts.net>, from the Internet Archive dated Mar. 5, 2009, printed Mar. 27, 2012, 2 pages.Applicant
- Cox, L.P. et al., “Presence-Exchanges: Toward Sustainable Presence-Sharing,” In Proc. of 7th IEEE Workshop on Mobile Computing Systems and Applications, Apr. 6-7, 2006, Semiahmoo Resort, Washington, pp. 55-60, 6 pages.Applicant
- “Reality Mining,” at <http://reality.media.mit.edu/dyads.php>, copyright 2009, Nathan Eagle, Massachusetts Institute of Technology, with references back to 2000, 3 pages.Applicant
- “Resource Description Framework (RDF) / W3C Semantic Web Activity,” at <http://www.w3.org/RDF/>, from the Internet Archive dated Jul. 30, 2008, printed Aug. 10, 2012, 6 pages.Applicant
- Abstract, “Self-Organized Pedestrian Crowd Dynamics: Experiments, Simulations, and Design Solutions,” by Helbing, D. et al., Transportation Science, vol. 39, Issue 1, Feb. 2005, obtained from ACM Digital Library at <http://portal.acm.org/citation.cfm?id=1247227>, printed Apr. 28, 2011, 2 pages.Applicant
- “Sense Networks,” at <http://www.sensenetworks.com/about—us.php>, copyright 2008-2010, Sense Networks, printed Apr. 28, 2011, 1 page.Applicant
- “Sense Networks—Machine Learning,” at <http://www.sensenetworks.com/machine—learning.php>, copyright 2008-2009, Sense Networks, printed Jan. 12, 2009, 2 pages.Applicant
- “Sense Networks—Technology,” at <http://www.sensenetworks.com/technology.php>, copyright 2008-2009, Sense Networks, printed Jan. 12, 2009, 2 pages.Applicant
- “Sense Networks—The Minimum vol. Embedding Algorithm,” at <http://www.sensenetworks.com/mve—algorithm.php>, copyright 2008-2009, Sense Networks, printed Jan. 12, 2009, 2 pages.Applicant
- Abstract, “Sensor networks for social networks,” by Farry, M.P., Thiesis, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Feb. 2006, obtained from Dspace@MIT, at <http://dspace.mit.edu/handle/1721.1/36764>, printed Apr. 28, 2011, 3 pages.Applicant
- “Six degrees of separation,” at <http://en.wikipedia.org/wiki/Six—degrees—of—separation>, last modified on Apr. 19, 2011,printed Apr. 28, 2011, 11 pages.Applicant
- Cox et al., “SmokeScreen: Flexible Privacy Controls for Presence-Sharing,” Proceedings of the 5th International Conference on Mobile Systems, Applications, and Services (2007) (MobiSys '07), Jun. 11-13, 2007, San Juan, Puerto Rico, 13 pages.Applicant
- “Social Serendipity,” MIT Media Lab: Reality Mining, at <http://reality.media.mit.edu/serendipity.php>, available online as early as Apr. 2005, copyright 2009, Nathan Eagle / Massachusetts Institute of Technology, printed Jun. 12, 2009, 10 pages.Applicant
- Agostini, A. et al., “Towards Highly Adaptive Services for Mobile Computing,” In Proceedings of IFIP TC8 Working Conference on. Mobile Information Systems (MOBSIS), Sep. 15-17, 2004, Oslo, Norway, Springer, 2004, pp. 121-134, 14 pages.Applicant
- Hofte, Henri ter, “Using groups and social networks in mobile applications,” Freeband Ambient Communication Event, Jul. 4, 2006, Enschede, The Netherlands, 41 pages.Applicant
- “What is Linkedln?,” at <http://www.linkedin.com/static?key=what—is—linkedin&trk=hb—what>, copyright 2011, Linkedln Corporation, printed Apr. 28, 2011, 1 page.Applicant
- Dogru, Muzaffer, “Car Pooling With Gis Map Server and Web Services,” Department of Information Technology, University of Zurich, Switzerland, Aug. 6, 2004, pp. 1-83.Applicant
- Marshall, M., “Destination Known,” The Mercury News [online] (Sep. 27, 2004) [retrieved on Aug. 2, 2005] Retrieved from the Internet: <URL: http://www.mercurynews.com/mid/mercury-news/business/9770733.htm?1c> 2 pages.Applicant
- “GPS Mapping Software” [online] Des Newman's OziExplorer [retrieved on Aug. 2, 2005] Retrieved from the Internet <URL: http://www.ozieplorer.com> 2 pages.Applicant
- “Off Road Navigation” [online] Thales Navigation, Inc., 2005 [retrieved on Aug. 2, 2005] Retrieved from the Internet: <URL: http://www.magellangps.com/assets/manuals/newprod/manual—offroadnay.pdf> 21 pages.Applicant
- “RFID in Japan, Crossing the Chasm, RFID Gets Bendy,” Card Korea & Ubiquitous Biz Show 2005 in Seoul [online] (Mar. 17, 2005), [retrieved on Aug. 2, 2005] Retrieved from the Internet: <URL: http://ubiks.net/local/blog/jmt/archives3/003524.html> 2 pages.Applicant
- Amin, Saurabh et al., “Mobile Century—Using GPS Mobile Phones as Traffic Sensors: A Field Experiment,” 15th World Conference on Intelligent Transportation Systems, Nov. 16-20, 2008, New York, New York, available from <http://www.ce.berkeley.edu/˜bayen/conferences/its08.pdf>, 4 pages.Applicant
- “Club TomTom,” at <http://www.clubtomtom.com/general/get-to-know-tomtom-mapshare%E2%84%A2/>, Jul. 31, 2007, copyright TomTom, printed Mar. 12, 2010, 9 pages.Applicant
- “NAVTEQ: The secrets behind Ovi Maps,” at <http://noknok.tv/2009/07/08/navteq-the-secrets-behind-ovi-maps/>, Jul. 8, 2009, copyright 2007-2010, Republic Publishing Ltd, printed Mar. 12, 2010, 6 pages.Applicant
- “Tele Atlas Leverages Community Input to Add New Roads and Location Content,” at <http://www.teleatlas.com/WhyTeleAtlas/Pressroom/PressReleases/TA—CT031226>, Jun. 22, 2009, Gent, Belgium, copyright 2010, Tele Atlas BV, printed Mar. 12, 2010, 2 pages.Applicant
- “TomTom Map Share technology,” at <http://www.tomtom.com/page/mapshare>, copyright 2009, TomTom International BV, printed Mar. 12, 2010, 3 pages.Applicant