Systems and methods that provide map-based directions for mobile devices and other computers are well known. For example, Google Maps for Mobile allows mobile devices, such as cell phones and PDAs, to display maps and text-based directions in response to user requests.
Some software, including Google Maps for Mobile, also allows users to display their progress relative to a map in real time. For example, if a mobile device is able to determine its geographic location, the device may download or otherwise access maps corresponding with its location and then display its location on the map. Mobile devices typically calculate their position via an internal or external GPS component, or by calculating their position relative to one or more cell phone towers.
Relatively complete and accurate maps are available with respect to many parts of the world. However, in many other areas of the world, the map data is incomplete and sometimes even incorrect, particularly when it comes to undeveloped or rapidly-developing areas. For example, a map database may not reflect the fact that a road has been recently built, closed or rerouted. Moreover, the database may be aware that a road is present, but it may not store the street name. Some streets will not even have a name.
One method of coping with the problem of incomplete maps is for mapping companies to retain people who drive around with GPS devices, manually detect road changes and enter new roads into the database. In addition to being relatively expensive, such a method of uploading data to a map database has other disadvantages as well.
One aspect of the invention comprises a method of providing directions, and includes: receiving a request for map information from a plurality of mobile devices as the mobile devices travel along a route, the request identifying the geographical location of a mobile device as it changes over time; storing the route traveled by each of the mobile devices based on the changing geographical locations received from each device; transmitting map information to the mobile devices in response to the request for map information and based on the geographical locations associated with the request; receiving, from a user, a request for directions from a starting location to an ending location; and providing directions to the user based on a stored route, the starting location and the ending location.
Another aspect of the invention relates to providing directions to end user computers. This aspect includes a plurality of mobile devices, where each mobile device includes a component to determine the geographic location of the device. The aspect also includes a computer in communication with the plurality of mobile devices, where the computer includes a processor and instructions executable by the processor. The instructions comprise: receiving and storing a set of geographic locations periodically received from each mobile device; receiving a request for a route between a starting point and ending point; selecting the route based on either (a) a set containing locations at or near the starting and ending point and locations there between or (b) a set containing locations at or near the starting and ending point and locations there between by joining the sets received from a plurality of mobile devices. The aspect further includes a plurality of end user computers, in communication with the computer over a network, that provide the requests for routes to the computer and receive the routes in response.
Yet another aspect of the invention provides a receiving directions. The method includes sending a request of directions from an end user computer to a server where the request identifies a first point-of-interest (POI) and a second POI. It also includes receiving, from the server and in response to the request, directions between the first POI and second POI where the directions were determined by the server by: selecting a route from a plurality of routes stored in a database; each route comprising a route traveled by a mobile device; the selected route identifying a route between the first POI and the second POI, and; the directions corresponding with the selected route.
Still another aspect of the invention relates to a method of changing map information. In this aspect, a plurality of requests for map information are removed from a plurality of computers, each request identifying the location of the computer and where the location changes over time and the map information including information identifying streets. The map information is provided in response to the request, and the map information is changed if the locations received from the computers do not correspond with information identifying streets.
A further aspect of the invention relates to a method of selecting a route between a first point and a second point. It includes: receiving route information from a first plurality of mobile devices as the mobile devices travel along a first route, the route information identifying the route traveled by the devices; receiving route information from a second plurality of mobile devices as the mobile devices travel along a second route; a first point being the same on both the first and second route, a second point being the same on both the first and second route, but the first and second routes otherwise being different between the first and second route; receiving a request from a user for directions between the first point and second point; selecting the portion of the first route between the first and second points if the received route information identifies a larger number of mobile devices traveling the first route than the second route; selecting the portion of the second route between the first and second points if the received route information identifies a larger number of mobile devices traveling the second route than the first route; and transmitting the selected route to the user.
In one aspect, the system and method uses prior map-related requests to provide future directions. By way of example only, the system and method stores routes traveled by moving mobile devices. The routes may be received in connection with the device's request for maps. When the system and method receives a request for directions, it selects the route or routes, or portions thereof, that corresponds with the desired starting and ending point. The system and method may also provide the directions, where possible, relative to landmarks or other points of interest rather than street names. The system and method may further use the route information to update its map database.
As shown in
Memory 220 stores information accessible by processor 210, including instructions 240 that may be executed by the processor 210. It also includes data 230 that may be retrieved, manipulated or stored by the processor. The memory may be of any type capable of storing information accessible by the processor, such as a hard-drive, memory card, ROM, RAM, DVD, CD-ROM, write-capable, and read-only memories.
The processor may be any well-known processor, such as processors from Intel Corporation. Alternatively, the processor may be a dedicated controller such as an ASIC.
The instructions 240 may be any set of instructions to be executed directly (such as machine code) or indirectly (such as scripts) by the processor. In that regard, the terms “instructions,” “steps” and “programs” may be used interchangeably herein. The instructions also function as an algorithm allowing the processor to perform the purposes intended by the instructions. The instructions may be stored in object code form for direct processing by the processor, or in any other computer language including scripts or collections of independent source code modules that are interpreted on demand or compiled in advance. Functions, methods and routines of the instructions are explained in more detail below.
Data 230 may be retrieved, stored or modified by processor 210 in accordance with the instructions 240. For instance, although the invention is not limited by any particular data structure, the data may be stored in computer registers, in a relational database as a table having a plurality of different fields and records, XML documents, or flat files. The data may also be formatted in any computer-readable format such as, but not limited to, binary values, ASCII or Unicode. Moreover, the data may comprise any information sufficient to identify the relevant information, such as numbers, descriptive text, proprietary codes, pointers, references to data stored in other memories (including other network locations) or information which is used by a function to calculate the relevant data.
Although the processor and memory are functionally illustrated in
In one aspect, computer 110 is a server communicating with one or more client computers 150, 170. Each client computer may be configured similarly to the server 110, with a processor, memory and instructions. Each client computer 150, 171 may be a personal computer, intended for use by a person 190-191, having all the internal components normally found in a personal computer such as a central processing unit (CPU), display 160, CD-ROM, hard-drive, user input (for example, a mouse, keyboard, touch-screen or microphone), speakers, modem and/or network interface device (telephone, cable or otherwise) and all of the components used for connecting these elements to one another. Moreover, computers in accordance with the systems and methods described herein may comprise any device capable of processing instructions and transmitting data to and from humans and other computers including general purpose computers and network computers lacking local storage capability.
The server 110 and client computers 150, 171 are capable of direct and indirect communication, such as over a network 295. Although only a few computers are depicted in
Although certain advantages are obtained when information is transmitted or received as noted above, other aspects of the invention are not limited to any particular manner of transmission of information. For example, in some aspects, information may be sent via a medium such as a disk, tape or CD-ROM. In other aspects, the information may be transmitted in a non-electronic format and manually entered into the system. Yet further, although some functions are indicated as taking place on a server and others on a client, various aspects of the invention may be implemented by a single computer having a single processor.
Although the client computers 150 and 170 may comprise various devices as noted above and transmission of data may occur in many different ways, certain advantages are achieved when at least one of the devices is a mobile device capable of wirelessly exchanging data with a network such as the Internet. For example, mobile device 150 may comprise a wireless-enabled PDA such as a Blackberry, and mobile device 151 may comprise an Internet-capable cellular phone.
Mobile devices 150 and 170 may include a component, such as circuits, to determine the geographic location of the device. For example, mobile device 150 may include a GPS receiver 155. By way of further example, the component may include software for determining the position of the device based on signals received at a cell phone's antenna from one or more cell phone towers, particularly if the mobile device is cell phone.
In accordance with one aspect of the system and method, mobile device 150 includes a routine for periodically uploading its geographic location to server 110. Its instructions 153 may also include a routine for requesting and downloading maps and directions. Examples of such routines are explained in more detail below. Both routines may be present in a single application, such as Google Maps for Mobile. Alternatively, the routines may be provided in different applications. For example, the software for downloading and displaying a map and directions may comprise a generic Internet browser that downloads HTML containing maps. The software for uploading data, on the other hand, may comprise a separate dedicated application created for the sole purpose of uploading location information to the server.
Server 110 may include various instructions and databases to be used in connection with client devices 150, 170.
Map database 270 stores map-related information, at least a portion of which may be transmitted to a client device. For example, map database 270 may store map tiles 272, where each tile is an image of particular geographic area. Depending on the resolution (e.g., whether the map is zoomed in or out), a single tile may cover an entire state in relatively little detail or just a few streets in high detail.
The map database may also include points of interest (POI) 274. A point of interest may be any item that is both interesting to one or more users and associated with a geographical location. For example, a point of interest may be a landmark, stadium or building. A point of interest typically includes a name, such as “Civic Center”. POI may be added to the database by professional map providers, individual users or other entities.
Map database 270 also stores streets 276. In addition to the street images in the tiles 272, the street information 276 stores information regarding the location of a street relative to a geographic area and other streets. For example, it may store information indicating whether a driver may access one street directly from another street. Street information 276 further stores streets names where available, and potentially other information as well such as the distance between intersections and speed limits. All or some of the foregoing information is used by processor 210 to compute the optimal route between locations.
Route database 250 stores routes as explained in more detail below.
It will be understood that the foregoing information described as being contained in the map database 270 is by way of example only. It will be further understood databases 250 and 270 may actually comprise a single database or many different databases located in different servers in different locations.
In addition to the operations illustrated in
Route database 250 contains routes taken by users. In one aspect of the system and method, the route information is provided by mobile devices. One manner in which a mobile device 150 may provide its route information to the server is by periodically transmitting its geographic location. As noted above, this information may be provided by a dedicated program whose sole purpose is to upload its route to the route database 250.
However, advantages may be obtained when the information is transmitted as part of another application. For example, mobile device 150 may be a cell phone with a GPS receiver 155, and the instructions 153 may include mapping software such as Google Maps for Mobile.
For example, the user may want his or her cell phone to display a map that moves as the device moves. As the user travels the mapping software may periodically transmit the user's location, as detected by the GPS receiver 155, to server 110. A cell phone may also transmit the cell phone's current latitude and longitude by triangulating signals from cell phone towers.
When server 110 receives a request for map information associated with a particular geographic location, the server transmits information such as the map tile 272 that corresponds with the location. The server may also transmit surrounding tiles as well. Alternatively, the map information may include other information associated with a map as well (by way of example only, street locations, street names, turns, POI, etc.). The mapping software 153 renders the tiles on display 160 of the mobile device 150, thus allowing a user to view a map that moves as the device moves. When the mobile device changes location, the new location is uploaded and new tiles, if necessary, are downloaded and displayed.
The route information stored in database 250 may be compiled from mobile devices' requests for maps. By way of example only, the server 110 may store a set of all or a portion the locations sent by mobile device 150 when the device requested a map tile. The order in which the locations were requested would also be stored.
The first column stores the requested location, which is presumably the location of the mobile device. The second column stores the date and time that the request was received, which is presumably the date and time when the mobile device was at the requested location.
The third column stores information for the purpose of determining whether the location/time information came from the same or different mobile devices (this prevents the database from confusing a location received from one device with a location received from another device). This information may be a unique number, such as a GUID, that is associated with a particular mobile device or its copy of the mobile mapping software. It may also comprise a randomly assigned number that is assigned when the first request is received, or a unique session identifier. Preferably, the information is stored with the user's permission, anonymously and with the purpose of assisting other users with directions.
Although the system and method are not limited to any particular manner of receiving or storing the route information, each individual collection of data 410, 420, 430 and 450 shall be referred to as a route for ease of reference. Similarly, unless otherwise noted below, it will be assumed that each route 410, 420, 430 and 450 was provided by a different mobile device or by the same mobile device in non-overlapping time periods. It will be understood that the scale, quantity and location of actual data in accordance with the invention may be quite different than that shown in
Many of the sample routes shown in
Yet other routes may have beginning and ending points that do not start or terminate at or near POI, such as route 420 which does not start particularly near any POI stored in the database. Such a route may begin at a small private residence that is not associated with a landmark of interest to other users of the map database and, thus, never uploaded.
Some routes may begin and end at the same points (or at least near to one another), but take different paths along the way, such as routes 430 and 450 that start near POI 480 and end at POI 490. This may reflect two different users taking different streets in spite of the fact that they started and ended at the same locations.
In addition to a table data structure such as that shown in
When a user seeks directions, the route information may be used. For the purpose of illustration, it will be assumed that mobile device 170 is requesting directions from one location to another.
In one aspect, the system and method searches route database 250 for a pre-stored route having a beginning and ending point that correlates with the beginning and ending point provided by the user requesting the directions.
For example, mobile device 170 may request directions from POI 460 to POI 470 (
Routing between POI is particularly advantageous in rural areas lacking complete map data. In such areas, the map data 270 may not include the street numbers or street names of intended destinations; potentially the map data may not even be aware of the street, let alone its name. However, by allowing the user to route between POI, the system and method routes the user to a point where they need only determine the destination's location relative to the nearest landmark.
In one aspect of the invention, the turns are expressed where possible in terms of POI. For example, as shown in
Moreover, if the client device requesting the directions is a mobile device capable of transmitting its location, the turns may be displayed one at a time as the user approaches them. A screen shot of such a system and method is shown in
If the map database 270 stores street names and addresses for the relevant area, the starting and ending points may be defined by street name and address as well.
Requests for directions, and the directions provided in response, may also be expressed in combinations of street names and POI. For example, the system and method may also determine, either when the route was uploaded or after the request for the directions, whether route 410 corresponds with known streets. If so, the directions may be provided in terms of street names and turns on streets.
In certain circumstances, there may be no street or POI associated with a portion of the route. In that regard, the system and method may transmit instructions to the mobile device 170 with generic instructions without regard to street names or POI, such as “bear Right in 100 feet”.
Preferably, the system and method aggregates the route information that is uploaded from mobile devices in order to select the optimum route in response to a request for directions. For example, when a user requests directions, there may be more than one possible route between the desired starting and ending points. As shown in
One method of optimizing route selection is to select the route that is the fastest. For example, if route 430 was traversed faster than route 450, route 430 would be selected.
Another method of optimizing the route selection is to select the most popular route. For example, assume 100 people have uploaded a route that is identical to or nearly identical to route 430. Further assume that 1,000 people have uploaded a route that is identical to or nearly identical to route 450. In that case, the system and method may select route 450 over route 430 even if route 430 is faster.
A route may be faster yet unpopular for many reasons. For example, it may be easy to get lost when traveling on the route, it may contain small alleys that are difficult for middle to large sized cars to navigate, or it may traverse one or more high crime areas. Therefore, even if the route is faster, it may be less appealing to most travelers.
Popularity may also be chosen so as to filter particular routes. For example, if route 430 was only taken by two travelers between POI 480 and POI 490, it may not be popular enough to recommend to other users. However, once a sufficient number of mobile devices upload route 430, it may be added to the list of recommendable routes.
The foregoing factors for selecting optimal directions are not mutually exclusive. For example, the route that provides the best balance between popularity and speed may be selected over both unpopular fast routes and slow popular routes.
The foregoing factors may be used in combination with additional factors as well. For example, rather than picking the fastest route, the system and method may select the route that is the fastest for that particular time of day. Route 430 may be faster than route 450 except during the morning rush hour. In that regard, the time of the request may also be used to select the route, i.e., if the uploaded information indicates that route 450 is slower than route 430 except in the morning, then route 430 will be selected over route 450 unless the request comes in the morning.
In another aspect of the system and method, the user is presented with choices that may affect the selected route. For example, the user may transmit (in response to a prompt or otherwise) that it prefers speed over popularity. The selected routes would then be chosen with the user's preference in mind.
In yet another aspect of the system and method, routes will be joined together to determine the best directions to be provided to the user. For example, one user may have uploaded a route from POI 480 to POI 485, and another user may have uploaded a route from POI 485 to POI 490, but no user may have uploaded a route from POI 480 to POI 490. In that regard, when the system has insufficient route data to route from one POI to another, the system may search for routes that may be strung together and transparently present the two (or more) routes as a single route to the user.
Similarly, the system may select and present less than a complete uploaded route to the user. For example, if a user uploaded route 430 from POI 480 to POI 490 that passed through POI 485, and another user is seeking directions from POI 480 to POI 485, the system and method may select and transmit only that portion of route 430 that corresponds with route 430 between POI 480 and 485.
A further aspect of the system and method provides for determining and modifying map data based on the uploaded routes. For example,
Alternatively, server 110 may generate a report indicating that a street 650 may be present. The potential street's existence could then be investigated and verified by a person before its inclusion in the map database. Indeed, such reports may be automatically generated whenever uploaded route data contradicts the information in the map database.
Similarly, the uploaded route data may be used to remove streets from recommended directions if uploaded route information indicates that travelers seem to avoid the street. As shown in
The uploaded data may also be used to update the characteristics of streets. As shown in
The system and method may also be used in connection with transportation systems other than cars. For example, it may be used to upload and suggest routes including trains, particularly when a route uses a combination of automobiles and trains (such as a user parking their car at a train station). Preferably, the system would check uploaded routes against known train tracks, and indicate whether an uploaded route likely comprised, at least partially comprised, travel on a train.
Most of the foregoing alternative embodiments are not mutually exclusive, but may be implemented in various combinations to achieve unique advantages. As these and other variations and combinations of the features discussed above can be utilized without departing from the invention as defined by the claims, the foregoing description of the embodiments should be taken by way of illustration rather than by way of limitation of the invention as defined by the claims. It will further be understood that many of the foregoing references to businesses and locations are fictional and for illustration purposes only.
The present application is a continuation of U.S. patent application Ser. No. 16/274,667 filed on Feb. 13, 2019, which is a continuation of U.S. patent application Ser. No. 15/438,829 filed on Feb. 22, 2017 which is a continuation of U.S. patent application Ser. No. 14/271,831 filed on May 7, 2014, now U.S. Pat. No. 9,612,125, which is a continuation of U.S. patent application Ser. No. 13/861,558 filed on Apr. 12, 2013, now U.S. Pat. No. 8,762,058, which is a continuation of U.S. patent application Ser. No. 13/479,443, filed on May 24, 2012, now U.S. Pat. No. 8,433,513, which is a continuation of U.S. patent application Ser. No. 12/291,852, filed on Nov. 14, 2008, now U.S. Pat. No. 8,219,316, the disclosures of which are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
4926336 | Yamada | May 1990 | A |
4937753 | Yamada | Jun 1990 | A |
5031104 | Ikeda | Jul 1991 | A |
5220507 | Kirson | Jun 1993 | A |
5467276 | Tsuyuki | Nov 1995 | A |
5475598 | Fushimi | Dec 1995 | A |
5521826 | Matsumoto | May 1996 | A |
5675492 | Tsuyuki | Oct 1997 | A |
5739772 | Nanba et al. | Apr 1998 | A |
5748109 | Kosaka | May 1998 | A |
5774073 | Maekawa | Jun 1998 | A |
5845228 | Uekawa | Dec 1998 | A |
5878368 | DeGraaf | Mar 1999 | A |
5931888 | Hiyokawa | Aug 1999 | A |
5933100 | Golding | Aug 1999 | A |
5938720 | Tamai | Aug 1999 | A |
5948040 | DeLorme | Sep 1999 | A |
5982298 | Lappenbusch | Nov 1999 | A |
6014607 | Yagyu | Jan 2000 | A |
6038509 | Poppen et al. | Mar 2000 | A |
6073075 | Kondou et al. | Jun 2000 | A |
6119095 | Morita | Sep 2000 | A |
6150961 | Alewine et al. | Nov 2000 | A |
6208934 | Bechtolsheim et al. | Mar 2001 | B1 |
6212473 | Stefan | Apr 2001 | B1 |
6216086 | Seymour | Apr 2001 | B1 |
6236933 | Lang | May 2001 | B1 |
6249742 | Friederich et al. | Jun 2001 | B1 |
6266615 | Jin | Jul 2001 | B1 |
6317685 | Kozak | Nov 2001 | B1 |
6321158 | DeLorme | Nov 2001 | B1 |
6353795 | Ranjan | Mar 2002 | B1 |
6381539 | Shimazu | Apr 2002 | B1 |
6385535 | Ohishi | May 2002 | B2 |
6415224 | Wako et al. | Jul 2002 | B1 |
6434482 | Oshida et al. | Aug 2002 | B1 |
6480783 | Myr | Nov 2002 | B1 |
6505118 | Chowanic | Jan 2003 | B2 |
6529143 | Mikkola et al. | Mar 2003 | B2 |
6553308 | Uhlmann | Apr 2003 | B1 |
6567743 | Mueller | May 2003 | B1 |
6587782 | Nocek | Jul 2003 | B1 |
6611750 | MacPhail et al. | Aug 2003 | B2 |
6629034 | Kozak | Sep 2003 | B1 |
6691128 | Natesan et al. | Feb 2004 | B2 |
6721651 | Minelli | Apr 2004 | B1 |
6766174 | Kenyon | Jul 2004 | B1 |
6795769 | Kaji | Sep 2004 | B2 |
6804603 | Ukita | Oct 2004 | B2 |
6807483 | Chao | Oct 2004 | B1 |
6816778 | Diaz | Nov 2004 | B2 |
6859723 | Yokota | Feb 2005 | B2 |
6862524 | Nagda | Mar 2005 | B1 |
7082365 | Sheha | Jul 2006 | B2 |
7127350 | Oikubo | Oct 2006 | B2 |
7233861 | Van Buer et al. | Jun 2007 | B2 |
7257484 | Park | Aug 2007 | B2 |
7321826 | Sheha | Jan 2008 | B2 |
7383126 | Takahashi | Jun 2008 | B2 |
7389285 | Barry | Jun 2008 | B2 |
7400973 | Okochi | Jul 2008 | B2 |
7480567 | Suomela | Jan 2009 | B2 |
7502685 | Nakamura | Mar 2009 | B2 |
7525416 | Mader | Apr 2009 | B2 |
7546205 | Sumizawa | Jun 2009 | B2 |
7565155 | Sheha et al. | Jul 2009 | B2 |
7693652 | Cheung | Apr 2010 | B2 |
7698061 | Singh | Apr 2010 | B2 |
7711478 | Gluck | May 2010 | B2 |
7805241 | Sato | Sep 2010 | B2 |
7817085 | Harris | Oct 2010 | B2 |
7826965 | Sadri | Nov 2010 | B2 |
7865298 | Macneille | Jan 2011 | B2 |
7869946 | Couckuyt et al. | Jan 2011 | B2 |
7881864 | Smith | Feb 2011 | B2 |
7945383 | Tu et al. | May 2011 | B2 |
7957895 | Haase | Jun 2011 | B2 |
8010285 | Denise | Aug 2011 | B1 |
8019581 | Sheha et al. | Sep 2011 | B2 |
8073621 | Kim | Dec 2011 | B2 |
8090534 | Sheha et al. | Jan 2012 | B2 |
8108141 | Ehrlacher | Jan 2012 | B2 |
8175802 | Forstall | May 2012 | B2 |
8346465 | Panganiban | Jan 2013 | B2 |
8606511 | Johnson | Dec 2013 | B2 |
8620532 | Curtis et al. | Dec 2013 | B2 |
8718910 | Gueziec | May 2014 | B2 |
9026353 | Tashiro | May 2015 | B2 |
9250094 | Victor | Feb 2016 | B2 |
9612125 | Goel | Apr 2017 | B2 |
9869563 | Broadbent | Jan 2018 | B2 |
11361361 | Malewicz | Jun 2022 | B2 |
20010029425 | Myr | Oct 2001 | A1 |
20010037174 | Dickerson | Nov 2001 | A1 |
20020047787 | Mikkola et al. | Apr 2002 | A1 |
20020067379 | Kenyon et al. | Jun 2002 | A1 |
20020120396 | Boies et al. | Aug 2002 | A1 |
20020128766 | Petzold et al. | Sep 2002 | A1 |
20020128773 | Chowanic | Sep 2002 | A1 |
20020156572 | Bullock | Oct 2002 | A1 |
20020161517 | Yano | Oct 2002 | A1 |
20030036848 | Sheha | Feb 2003 | A1 |
20030060976 | Sato | Mar 2003 | A1 |
20030182052 | DeLorme et al. | Sep 2003 | A1 |
20040008225 | Campbell | Jan 2004 | A1 |
20040128066 | Kudo | Jul 2004 | A1 |
20040204833 | Yokota | Oct 2004 | A1 |
20040220726 | Jin | Nov 2004 | A1 |
20040225436 | Yoshihashi | Nov 2004 | A1 |
20050027447 | Hirose et al. | Feb 2005 | A1 |
20050027448 | Takenaga | Feb 2005 | A1 |
20050075119 | Sheha | Apr 2005 | A1 |
20050125148 | Van Buer | Jun 2005 | A1 |
20050140524 | Kato | Jun 2005 | A1 |
20050165832 | Adam Barry | Jul 2005 | A1 |
20050261825 | Nix | Nov 2005 | A1 |
20050261830 | Furukawa | Nov 2005 | A1 |
20050273252 | Nix | Dec 2005 | A1 |
20060021815 | Ohtaka | Feb 2006 | A1 |
20060105795 | Cermak et al. | May 2006 | A1 |
20060184314 | Couckuyt et al. | Aug 2006 | A1 |
20060241854 | Tu | Oct 2006 | A1 |
20070016368 | Chapin | Jan 2007 | A1 |
20070208492 | Downs | Sep 2007 | A1 |
20070219706 | Sheynblat | Sep 2007 | A1 |
20070233384 | Lee | Oct 2007 | A1 |
20070239348 | Cheung | Oct 2007 | A1 |
20070239349 | Ohnishi | Oct 2007 | A1 |
20080048856 | Culpepper et al. | Feb 2008 | A1 |
20080059055 | Geelen | Mar 2008 | A1 |
20080275644 | Macneille | Nov 2008 | A1 |
20090005965 | Forstall | Jan 2009 | A1 |
20090112462 | Lo | Apr 2009 | A1 |
20090222200 | Link, II | Sep 2009 | A1 |
20090292463 | Chase | Nov 2009 | A1 |
20100057336 | Levine | Mar 2010 | A1 |
20110037619 | Ginsberg | Feb 2011 | A1 |
20110153193 | Fox et al. | Jun 2011 | A1 |
20130096829 | Kato | Apr 2013 | A1 |
20130166205 | Ikeda | Jun 2013 | A1 |
20160341562 | Samsonov | Nov 2016 | A1 |
20170176201 | Goel | Jun 2017 | A1 |
Number | Date | Country |
---|---|---|
2003315075 | Nov 2003 | JP |
3965071 | Aug 2007 | JP |
2006073997 | Jul 2006 | WO |
2007008809 | Jan 2007 | WO |
Entry |
---|
Translated copy of JP 2003315075 of Takenaka T, Nov. 6, 2003. |
Translated copy of JP 3965071 B2 of Takenaka T, Aug. 22, 2003. |
Lorraine McGinty and Barry Smyth, “Personalised Route Planning: a Case-Based Approach”, E. Blanzieri and L. Portinale (Eds.): EWCBR 2000, LNAI 1898, pp. 431-443, 2000. |
Routeguru, “Routeguru.com; How it works and what it offers?”, <http://themarketingblog.wordpress.com/2007/05/28/routegurucom/>, 2007, 8 pages. |
“Driving directions launched by Yahoo—an analysis”, <http://silicontryst.wordpress.com/2007/10/27/driving-direction-launch-by-yahoo-an-analysis/>, Printed on Sep. 24, 2009, 5 pages. |
Travelogue, “Indian Maps with Driving Directions”, <http://travelogue.blogsailor.com/indian-maps-with-driving-directions/>, Posted on Oct. 29, 2007, 6 pages. |
Jon Froehlich, John Krumm, Route Prediction From Trip Observations, 2008 SAE International, 2008. |
Julia Letchner, John Krumm, Eric Horvitz, Trip Router With Individualized Preferences (TRIP) Incorporating Personalization into Route Planning, 2006. |
Stefan Schroedl, Kiri Wagstafff, Seth Rogers, Pat Langley, Christopher Wilson, Mining GPS for Map Refinement, 2004. |
Humbad, “Suitability of Distributed Mobile Wireless Networking for Urban Traffic Congestion Mitigation”, Masters' Thesis, Massachusetts Institute of Technology, Published Jun. 2001. |
PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for PCT/US 09/64311, Jan. 13, 2010, 9 pages. |
First Examination Report for Indian Patent Application No. 3981/CHENP/2011, dated Jul. 13, 2017. 4 pages. |
Hearing Notice for Indian Patent Application No. 3981/CHENP/2011 dated Feb. 24, 2020. 4 pages. |
Number | Date | Country | |
---|---|---|---|
20220155084 A1 | May 2022 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16274667 | Feb 2019 | US |
Child | 17590261 | US | |
Parent | 15438829 | Feb 2017 | US |
Child | 16274667 | US | |
Parent | 14271831 | May 2014 | US |
Child | 15438829 | US | |
Parent | 13861558 | Apr 2013 | US |
Child | 14271831 | US | |
Parent | 13479443 | May 2012 | US |
Child | 13861558 | US | |
Parent | 12291852 | Nov 2008 | US |
Child | 13479443 | US |