Apparatus and methods for providing journey information

- INRIX HOLDINGS LIMITED

A method of providing at least one journey option computation to user and a journey information computer system is provided. The journey information computer system comprising: a client interface configured to receive a calendar email invitation comprising appointment details and user identity information; a decode module operable to identify and extract the user identity information and the appointment details from the email; a travel information processor configured to compute at least one journey option based on the appointment details together with data received from a least one travel information source; and a communication module configured to send the at least one computed journey option to a user device.

Skip to: Description  ·  Claims  ·  References Cited  · Patent History  ·  Patent History
Description
RELATED APPLICATIONS

This application is the U.S. National Phase under 35 U.S.C. §371 of International Application No. PCT/GB2010/000158, filed on Jan. 29, 2010, which in turn claims the benefit of British Application No. 0901588.4, filed on Feb. 2, 2009, the disclosures of which Applications are incorporated by reference herein.

TECHNICAL FIELD

This invention relates generally to apparatus and methods for providing journey information, and in particular to systems and methods for responding to user requests for journey information via an email application.

BACKGROUND

Traffic and travel information is important in calculating journey times and routes, as well as avoiding traffic congestion that can potentially delay route completion.

There are many different sources of traffic and travel information. Various online applications, for example Multimap.com and Google Maps, offer street-level maps and door-to-door travel directions, as well as aerial photographs and local information. Many public transport operators also provide journey scheduling information. Transport for London (TfL), for instance, offers an online journey planner which enables users to plan journeys by multiple modes of transport in and around London. There are also numerous sources of real-time traffic information which aim to keep travelers updated as to the current traffic situation.

However, these traffic information sources usually require a user to manually enter details about their journey. No currently known technology provides systems and methods suitable for automatically generating one or more journey options from a plurality of traffic information sources using appointment details extracted from an email.

SUMMARY OF THE INVENTION

According to one embodiment a journey information computer system is provided. The journey information computer system comprising: a client interface configured to receive a calendar email invitation comprising appointment details and user identity information; a decode module operable to identify and extract the user identity information and the appointment details from the email; a travel information processor configured to compute at least one journey option based on the appointment details together with data received from a least one travel information source; and a communication module configured to send the at least one computed journey option to a user device.

According to another embodiment the decode module is configured to process the appointment details to generate a travel information data packet comprising at least a starting point and finishing point for a journey, and the user identity information.

According to another embodiment the travel information processor receives the travel information data packet and uses it to compute the at least one journey.

According to another embodiment the system further comprises a library of user profiles, each user profile comprising an address, and wherein the decode module is configured to use the user identity information to look up said address from the user profile and define the journey starting point in the travel information data packet as said address.

According to another embodiment the address is one or more of a home address and a work address.

According to another embodiment the user is prompted to select between the home and work address.

According to another embodiment the appointment details comprise: date, time, duration and location.

According to another embodiment the decode module is configured to define the location from the appointment details as the finishing point for the journey.

According to another embodiment the decode module is configured to use the duration from the appointment details to calculate a return journey.

According to another embodiment the system further comprises a library of e-mail client templates, wherein each template describes the structure of appointment details in e-mails, and wherein the decode module uses the templates to selectively, in dependence upon the source of the calendar email invitation, identify and extract the appointment details from the e-mail.

According to another embodiment each user profile comprises more than one address and the user is prompted with a message to confirm the starting and/or ending point of the journey.

According to another embodiment each user profile further comprises preference information used by the travel information processor for journey computations.

According to another embodiment the preference information includes one or more of: preferred method of transport, cost preferences, environmental preferences.

According to another embodiment the user identifier is an e-mail address.

According to another embodiment the system further comprises an e-mailer module for creating an email message comprising details of the computed journey and sending it to the user device.

According to another embodiment the system further comprises a messenger module for creating a SMS/MMS message comprising details of the computed journey and sending it to the user device.

According to another embodiment the message comprises updates and/or reminders regarding the journey.

According to another embodiment the user device is one or more of: a desktop computer; a mobile phone; a smart-phone; a PDA.

According to another embodiment the at least one travel information source includes one or more of: real-time traffic information; rail information; flight information; coach information; local taxi companies; public transport schedules.

According to another embodiment travel information is sent as regular updates to the user by the e-mailer module and/or messenger module before and/or during the journey.

According to another embodiment the travel information processor takes into consideration economic factors and outputs the most cost-effective journey to the user.

According to another embodiment the travel information processor takes into consideration environmental factors and outputs the most environmentally friendly journey to the user.

According to another embodiment the calculated journey option allows a predetermined amount of time for parking.

According to another embodiment the system further comprises an interface to at least one data store having records indicating parking availability in the vicinity of the end point, and presenting it as part of the journey option.

According to another embodiment the decode module sends an instruction to the e-mailer and/or messenger module to send a registration link back to the user, and the user completes profile information which is used to create/populate a user profile.

According to one embodiment a method of providing at least one journey option computation to user is provided. The method comprising: receiving an email at a decode module; extracting user identity information and appointment details from the email; receiving travel information from at least one travel information source; computing at least one journey option based on the appointment details and travel information using a travel information processor; sending the at least one computed journey to a user device.

According to another embodiment the method further comprises using the appointment details to generate a travel information data packet comprising at least a starting point and finishing point for a journey, and the user identity information.

According to another embodiment the method further comprises receiving the travel information data packet and using it in the computation of the at least one journey.

According to another embodiment the method further comprises using the user identity information to look up an address from a library of user profiles, each user profile comprising an address, and defining the journey starting point in the travel information data packet as said address.

According to another embodiment the appointment details comprise: date, time, duration and location.

According to another embodiment the method further comprises using the location as the finishing point for that journey.

According to another embodiment the method further comprises extracting the duration from the appointment details to calculate a return journey start time and calculating a return journey based on reversing the starting and finishing points.

According to another embodiment the method further comprises referencing a library of e-mail client templates, wherein each template describes where an e-mail client application places appointment details in e-mails, and using the templates to identify and extract the appointment details from the e-mail.

According to another embodiment each user profile comprises more than one address and the user is prompted with a message to confirm the starting and/or ending point of the journey.

According to another embodiment user profiles further comprise preference information used by the travel information processor for journey computations.

According to another embodiment preference information includes one or more of: preferred method of transport, cost preferences, environmental preferences.

According to another embodiment the user identifier is an e-mail address.

According to another embodiment the method further comprises creating an email message comprising the journey and sending it to the user device.

According to another embodiment the method further comprises creating a SMS/MMS message comprising the journey and sending it to the user device.

According to another embodiment the message comprises updates and/or reminders regarding the journey.

According to another embodiment the user device is one or more of: a desktop computer; a mobile phone, a smartphone, a PDA.

According to another embodiment at least one travel information source includes one or more of: real-time traffic information, rail information, flight information, coach information, local taxi companies, public transport schedules.

According to another embodiment the method further comprises sending regular traffic information updates to the user before and during the journey.

According to another embodiment the travel information processor takes into consideration economic factors and outputs the most cost-effective journey to the user.

According to another embodiment the travel information processor takes into consideration environmental factors and outputs the most environmentally friendly journey to the user.

According to another embodiment the calculated journey allows a predetermined amount of time for parking.

According to another embodiment the decode module sends an instruction to the e-mailer and/or messenger module to send a registration link back to the user, and the user completes profile information which is used to create/populate a user profile.

According to one embodiment a computer-readable medium encoded with a data structure configured to perform the above methods is provided.

Additional objects, advantages, and novel features of the invention will be set forth in part in the description that follows, and in part will become apparent to those skilled in the art upon examination of the following and the accompanying drawings, or may be learned by practice of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

For a better understanding of the present invention, and to show how the same may be carried into effect, reference will now be made, by way of example only, to the accompanying drawings, in which:

FIG. 1 illustrates a journey information computer system according to an embodiment of the present invention; and

FIG. 2 illustrates a typical process carried out by the journey information server according to an embodiment of the present invention.

DETAILED DESCRIPTION

FIG. 1 shows a journey information computer system according to an embodiment of the present invention. The system comprises: a journey information server 10 with an interface to at least one travel information source 30, and one or more desktop computers 40 and/or mobile devices 50 in communication with server 10 via network 60.

The journey information server 10 comprises: a client interface 101, a decode module 103, a travel information processor 105, a travel information source interface 107 operable to connect to at the least one travel information source 30, an E-mailer module 109, a messenger module 111, and a database 113 comprising an archive of e-mail client templates 115 and an archive of user profiles 117.

Generally, an e-mail message sent from a desktop or mobile email client application (“email client”) has a message body and a header which may include at least some of the following: the e-mail address/name of the sender; the e-mail address[es]/name[s] of the message recipient[s]; subject; date etc. Many e-mail clients have calendar/appointment functionality which enable the user to fill in appointment details—such as date, time and place—and send it to one are more recipients, whose own e-mail client may automatically add the appointment into its calendar when the user accepts the appointment, or who may manually enter information into their own calendar.

Popular e-mail client applications supported by the embodiments of the present invention include, for example, POP3 and IMAP4 clients such as Eudora, Lotus Notes, Apple Mail, Microsoft Office Outlook, Microsoft Outlook Express, Mozilla Thunderbird, Opera Mail and Pegasus Mail. Some embodiments also support e-mails composed in HTTP (webmail) applications such as Gmail, Hotmail, AOL and Yahoo. However, these examples are not to be construed as limiting and other email clients not mentioned may also be used.

In the context of the present invention, the term “e-mail” is used generically to describe an e-mail message comprising at least some appointment information, which may be contained within the header or body of the e-mail, or partly in each.

The client interface 101 is configured to receive e-mails from user email clients. Most typically, the email clients are operated remotely from a desktop computer 40, however, other electronic devices suitable for sending e-mails and scheduling may also be used, e.g. phones, smartphones, Blackberry's, PDAs etc.

According to embodiments of the present invention, the user enters the “server e-mail address” into the “to” or “cc” field when composing an e-mail to set up an appointment, or when composing a reply message accepting an invitation to attend a meeting. The “server e-mail address” is an additional recipient address which ensures that the e-mail is delivered to the interface 101 of the traffic information server 10 once it has been sent by the user's e-mail client.

The user profile archive 117 is a library of user profiles. An individual user can register an account and create a user profile in any suitable way, e.g. by visiting a registration website and filling in a registration form. A typical user profile comprises at least: a user identifier (such as name and e-mail address) and at least one address (e.g. home and/or office address). Optionally, user profiles include preference information (such as preferred methods of transport, cost preferences, environmental preferences etc.) and any other travel related information.

The decode module 103 is operable to receive e-mails from users via interface 101 and extract (a) user identity information (e.g. name, email address etc.) and (b) appointment details (e.g. date of appointment, time of appointment, appointment venue address etc.). The decode module 103 cross-references the user identity information extracted from the e-mail with user identifier(s) stored in user profiles in profile archive 117. Once the decode module finds the correct user profile, it uses the address defined in the profile or an alternative address defined in the e-mail, and the appointment details to generate a travel information data packet. Examples of appointment details used for travel information include attributes such as date, time, duration and location.

The travel information processor 105 receives appointment details and profile information from the decode module 103 in the form of a travel information data packet, and uses it to compute one or more journey options for the user. The user's address (home or office) looked up from the user profile is typically used as a starting point for a journey, unless an alternative is provided, and the location of the meeting extracted from the appointment details of the e-mail is typically used as the finishing point for that journey. According to one embodiment, the user is prompted to confirm the starting and finishing point of a journey, which may include indicating whether a journey starts from the home or office address. The travel information processor 105 then uses the starting point and finishing point to source information from one or more travel information sources 30 via interface 107.

According to one embodiment, the duration of the meeting may be used to calculate a return journey, in other words, a journey that starts after the end of the meeting and reverses the starting and finishing points of the outbound journey.

Travel information sources may include, but are not limited to, one or more of the following: real-time traffic reports, rail operator information, flight operator information, coach operator information, local taxi companies, public transport services such as buses and underground trains, and map information for walking routes.

According to one embodiment, at least one travel information source is one or more of: International Patent Publication No. WO04/021305 “APPARATUS AND METHOD FOR PROVIDING TRAFFIC INFORMATION”; U.S. Pat. No. 6,587,781 “METHOD AND SYSTEM FOR MODELING AND PROCESSING VEHICULAR TRAFFIC DATA AND INFORMATION AND APPLYING THEREOF”; International Patent Publication No. WO2006/005906 “METHOD & SYSTEM FOR MONITORING TRAFFIC”; and European Patent Publication No. EP1576561 “INSTANTANEOUS TRAFFIC MONITORING SYSTEM”, the disclosures of which are incorporated herein by reference. If a user opts to travel by car, for example, this travel information source provides not only accurate journey planning information but up-to-date traffic reports, which can be sent as updates to the user by e-mailer 109 and/or messenger module 111 before and during the journey.

According to one embodiment, the travel information processor 105 takes into consideration economic factors and outputs the most cost-effective journey to the user. According to one embodiment, the travel information processor 105 takes into consideration environmental factors and outputs the most environmentally friendly journey to the user. According to one embodiment, when the journey is by car, calculated journey time may allow for a predetermined amount of time for parking. According to one embodiment, the server 10 further comprises an interface to at least one datastore having records indicating parking availability in the vicinity of the end point, e.g. records showing a list of nearby car parks, for example multi-storey car parks, or other information.

According to one embodiment, if the decode module 103 is not able to determine a match between user identity information contained in the e-mail and a user identifier stored in the user profile archive 117, an instruction is sent to the e-mailer module 109 and/or messenger module 111 to send a registration link back to the user. The user is then requested to complete profile information which is received by server 10 and a user profile is created/populated according.

The template archive 115 is a library of templates, each of which describe how an e-mail client application constructs appointment e-mails, and they can be generated for any e-mail client application, including any of the ones listed above. For instance, the template representing the Lotus Notes application describes in which fields of the e-mail Lotus Notes places the time, the date, the duration and the location. Thus, the decode module 103 is able to use information stored in the templates to identify and extract relevant appointment information from incoming e-mails. According to one embodiment, the decode module 103 may have code which automatically detects appointment details from the body of an email. Examples of techniques to identify and extract information from emails in this manner will be known to the skilled person.

The e-mailer module 109 is operable to package journey information into an e-mail format that can be sent back to the user. In practice, it may be a server side e-mail client application configured to receive data from the travel information processor 105, appropriately package the data into a readable format, for instance HTML, and send it to the user's e-mail address. The messenger module 111 performs a similar function to the e-mailer module 109, however, journey information is packaged into a format suitable for sending to a mobile device, for example, into SMS/MMS format.

FIG. 2 illustrates a typical process carried out by the traffic information server 10 according to an embodiment of the present invention. The process starts with a user entering 201 appointment information, for example, in an e-mail client running on a desktop computer or mobile device. Typically this information will comprise at least: time, date, place, duration and participants, along with any other information. The user enters 202 at least the server e-mail address as a recipient before sending out the appointment invitation or acceptance e-mail. The server e-mail address ensures that the e-mail is delivered 203 to the interface 101 of the traffic information server 10. The e-mail is then passed 204 to the decode module 103. From the e-mail, the decode module 103 is able to automatically detect 205 the application from which the e-mail was sent. The decode module 103 then accesses the database 113 and calls 206 up the relevant template for the application from which the message was sent. As described above, templates describes at least how appointment information is structured within the e-mail message and thus the decode module 103 is able to use this structure to identify and extract 207 travel information from the e-mail. According to one embodiment, the decode module 103 does not automatically detect the application from which the e-mail was sent but instead cross-references the e-mail with templates in template archive 117 until a format match is found.

At the same time, the decode module 103 extracts 207 user identity information (user ID) from the e-mail message. The decode module 103 then accesses the database 113 and calls up the relevant user profile corresponding to the detected user ID. Relevant profile data is then accessed 208 by the decode module 103. Relevant profile data means anything which can be used by the travel information processor to provide useful traffic and/or travel data back to the user. Most typically, relevant profile data includes a starting address, for instance, a home or office address. It may also include information such as: preferred method of transport, cost preferences, environmental preferences or any other information which can be taken into account by the travel information processor 105, in order to produce the most relevant data back to the user.

According to one embodiment, the decode module 103 is able to recognize multiple user IDs from a single message, i.e. where there are multiple recipients, and process different journeys for each recipient based on each recipient's user profile.

The travel information extracted from the e-mail message by the decode module 103 and any relevant user profile information is then passed 209 to the travel information processor 105 for processing. The travel information processor 105 computes 210 a journey based on the information provided to it by the decode module 103. This journey computation involves the travel information processor 105 sending the travel information from the decode module 103 to one or more travel information sources 30 via interface 107. The travel information processor 105 then receives relevant data from the one or more travel information sources 30 and uses this data to compute at least one viable journey. Thus, the at least one computed journey may be a result of the data received from any travel information source 30, and may be a conglomeration of several sources of data.

According to one embodiment, the travel information processor 105 calculates the quickest and/or shortest journey. According to one embodiment, the travel information processor 105 calculates several alternative journeys. According to one embodiment, the travel information processor 105 calculates the most economic journey.

The computed journey, or multiple journeys, is then passed 211 to E-mailer 109. Optionally, it may also be passed 212 to messenger module 111. In both cases, journey information is sent 213 back to the user through network 60 via interface 101. According to one embodiment, the user can specify to what device journey information is delivered, e.g. whether it is back to the e-mail account or to a mobile device. This type of preference information may be stored in the user's profile in user profile archive 117.

According to one embodiment, the travel information processor 105 continues to recalculate journey information until the user has completed the journey. For example, the travel information processor 105 may receive constant travel information updates from any of the travel information sources 30, e.g. traffic data, train/underground delays, flight delays etc., and relay these back to the user via network 60, i.e. to the user's desktop computer 40 and/or mobile device 50, in order to provide the user with the most up-to-date journey information.

The various apparatus modules described herein may be implemented using general purpose or application specific computer apparatus. The hardware and software configurations indicated for the purpose of explaining the preferred embodiment should not be limiting. Similarly, the software processes running on them may be arranged, configured, or distributed in any manner suitable for performing the invention as defined in the claims.

A skilled reader will appreciate that, while the foregoing has described what is considered to be the best mode, and where appropriate, other modes of performing the invention, the invention should not be limited to the specific apparatus configurations or method steps disclosed in this description of the preferred embodiment. Those skilled in the art will also recognize that the invention has a broad range of applications, and the embodiments admit of a wide range of modifications without departing from the inventive concepts.

Claims

1. A journey information computer system comprising:

a non-transitory computer-readable medium comprising instructions;
an interface configured to receive a calendar email invitation comprising appointment details, identity information of a recipient of the calendar email invitation and second identity information of a second recipient of the calendar email invitation;
a decode module operable to receive the calendar email invitation, cross-reference the calendar email invitation with templates in a template archive to identify a first template with a matching format, and decode the calendar email invitation by extracting the identity information and the appointment details from the calendar email invitation based upon the first template;
a library of user profiles, each user profile comprising an address, wherein the decode module is configured to use the identity information to look up a first address from a first user profile of a user and define a starting point as the first address and use the second identity information to look up a second address from a second user profile of a second user and define a second starting point as the second address;
a travel information processor configured to execute the instructions to compute: a journey with the starting point based on the appointment details together with data received from at least one travel information source; a return journey based on a duration extracted from the appointment details, wherein the return journey starts from a finishing point of the journey and ends at the starting point; a second journey with the second starting point based on the appointment details together with data received from at least one travel information source; and a second return journey based on the duration extracted from the appointment details, wherein the second return journey starts from a second finishing point of the second journey and ends at the second starting point, wherein the travel information processor takes into consideration economic factors and outputs the most cost-effective journey; and
a communication module configured to: send the journey and the return journey to a device identified as being a preferred device for delivery from amongst two or more devices of the user in the user profile; and send the second journey and the second return journey to a second device identified as being a preferred device for delivery from amongst two or more devices of the second user in the second user profile.

2. The system according to claim 1 wherein the decode module is configured to process the appointment details to generate a travel information data packet comprising at least a starting point and finishing point for one or more journeys, and the identity information.

3. The system according to claim 2 wherein the travel information processor receives the travel information data packet and uses it to compute the journey.

4. The system according to claim 1 wherein the first address is one or more of a home address or a work address.

5. The system according to claim 4 wherein the recipient is prompted to select between the home and work address.

6. The system according to claim 1 wherein the appointment details comprise: date, time, and location.

7. The system according to claim 6 wherein the decode module is configured to define the location from the appointment details as the finishing point.

8. The system according to claim 1 wherein the decode module is configured to extract the duration from the appointment details.

9. The system according to claim 1 wherein each template in the template archive describes a structure of appointment details in e-mails.

10. The system of claim 1 wherein each user profile comprises more than one address and a sender is prompted with a message to confirm at least one of the starting point or the finishing point.

11. The system of claim 1 wherein each user profile comprises preference information used by the travel information processor for journey computations.

12. The system according to claim 11 wherein the preference information comprises one or more of: preferred method of transport, cost preferences, or environmental preferences.

13. The system according to claim 1 wherein the identity information comprises an e-mail address.

14. The system according to claim 1 comprising an e-mailer module for creating an email message comprising details of the journey and sending it to the device.

15. The system according to claim 14 wherein the email message comprises at least one of updates or reminders regarding the journey.

16. The system according to claim 1 comprising a messenger module for creating a SMS/MMS message comprising details of the journey and sending it to the device.

17. The system according to claim 1 wherein the device is one or more of: a desktop computer, a mobile phone, a smart-phone, or a PDA.

18. The system according to claim 1 wherein the at least one travel information source used to compute the journey comprises one or more of: real-time traffic information; rail information; flight information; coach information; local taxi companies; or public transport schedules.

19. The system according to claim 1 wherein travel information is sent as regular updates to the recipient by at least one of an e-mailer module or a messenger module, and wherein the travel information is sent at least one of before or during the journey.

20. The system according to claim 1 wherein the at least one travel information source used to compute the second journey comprises one or more of: real-time traffic information; rail information; flight information; coach information; local taxi companies; or public transport schedules.

21. The system according to claim 1 wherein the travel information processor takes into consideration environmental factors and outputs the most environmentally friendly journey.

22. The system according to claim 1 wherein the journey allows a predetermined amount of time for parking.

23. The system according to claim 1 comprising an interface configured to present parking availability in the vicinity of the finishing point.

24. The system according to claim 1 wherein the decode module sends an instruction to a module to send a registration link to a third user, and the third user completes profile information which is used to create a third user profile.

25. A method, comprising:

receiving a calendar email invitation comprising appointment details, identity information of a recipient of the calendar email invitation and second identity information of a second recipient of the calendar email invitation;
cross-referencing the calendar email invitation with templates in a template archive to identify a first template with a matching format;
extracting the identity information and the appointment details from the calendar email invitation based upon the first template;
using the identity information to look up a first address from a first user profile of a user in a library of user profiles and defining a starting point as the first address;
using the second identity information to look up a second address from a second user profile of a second user in the library of user profiles and defining a second starting point as the second address;
receiving travel information from at least one travel information source;
computing at journey with the starting point based on the appointment details and the travel information using a travel information processor;
computing a return journey based on a duration extracted from the appointment details, wherein the return journey starts from a finishing point of the journey and ends at the starting point;
computing a second journey with the second starting point based on the appointment details and the travel information using the travel information processor;
computing a second return journey based on the duration extracted from the appointment details, wherein the second return journey starts from a second finishing point of the second journey and ends at the second starting point,
wherein the travel information processor takes into consideration one or more factors including zero or more economic information and outputs the most cost-effective journey;
sending the journey and the return journey to a device identified as being a preferred device for delivery from amongst two or more devices of the user in the user profile; and
sending the second journey and the second return journey to a second device identified as being a preferred device for delivery from amongst two or more devices of the second user in the second user profile.

26. The method according to claim 25 comprising using the appointment details to generate a travel information data packet comprising at least a starting point and finishing point for one or more journeys, and the identity information.

27. The method according to claim 26 comprising receiving the travel information data packet and using it in the computation of the journey.

28. The method according to claim 25 wherein the appointment details comprise: date, time, direction and location.

29. The method according to claim 28 comprising using the location as the finishing point for the journey.

30. The method according to claim 25 comprising extracting the duration from the appointment details.

31. The method according to claim 25 wherein each template in the template archive describes where an e-mail client application places appointment details in e-mails.

32. The method according to claim 25 wherein each user profile comprises more than one address and a sender is prompted with a message to confirm at least one of the starting point or the finishing point.

33. The method according to claim 25 wherein user profiles comprise preference information used by the travel information processor for journey computations.

34. The method according to claim 33 wherein the preference information comprises one or more of: preferred method of transport, cost preferences, or environmental preferences.

35. The method according to claim 25 wherein the identity information comprises an e-mail address.

36. The method according to claim 25 comprising creating an email message comprising the journey and sending it to the device.

37. The method according to claim 36 wherein the email message comprises at least one of updates or reminders regarding the journey.

38. The method according to claim 25 comprising creating a SMS/MMS message comprising the journey and sending it to the device.

39. The method according to claim 25 wherein the device is one or more of: a desktop computer, a mobile phone, a smartphone, or a PDA.

40. The method according to claim 25 wherein the at least one travel information source comprises one or more of: real-time traffic information, rail information, flight information, coach information, local taxi companies, or public transport schedules.

41. The method according to claim 25 comprising sending regular traffic information updates to the recipient before and during the journey.

42. The method according to claim 25 wherein the second device is one or more of: a desktop computer, a mobile phone, a smartphone, or a PDA.

43. The method according to claim 25 wherein the travel information processor takes into consideration environmental factors and outputs the most environmentally friendly journey.

44. The method according to claim 25 wherein the journey allows a predetermined amount of time for parking.

45. The method according to claim 25 comprising sending a registration link to a third user.

46. A non-transitory computer-readable medium comprising instructions that, when executed by a processor, cause the processor to:

receive a calendar email invitation comprising appointment details, identity information of a recipient of the calendar email invitation and second identity information of a second recipient of the calendar email invitation;
cross-reference the calendar email invitation with templates in a template archive to identify a first template with a matching format;
extract the identity information and the appointment details from the calendar email invitation based upon the first template;
use the identity information to look up a first address from a first user profile of a user in a library of user profiles and define a starting point as the first address;
use the second identity information to look up a second address from a second user profile of a second user in the library of user profiles and define a second starting point as the second address;
compute at journey with the starting point based on the appointment details together with data received from at least one travel information source, wherein the computing takes into consideration economic factors and outputs the most cost-effective journey;
compute a return journey based on a duration extracted from the appointment details, wherein the return journey starts from a finishing point of the journey and ends at the starting point;
compute a second journey with the second starting point based on the appointment details together with data received from at least one travel information source;
compute a second return journey based on the duration extracted from the appointment details, wherein the second return journey starts from a second finishing point of the second journey and ends at the second starting point;
send at least one of the journey or the return journey to a device identified as being a preferred device of the user in the user profile; and
send at least one of the second journey or the second return journey to a second device identified as being a preferred device of the second user in the second user profile.
Referenced Cited
U.S. Patent Documents
4361202 November 30, 1982 Minovitch
4985705 January 15, 1991 Stammler
5122959 June 16, 1992 Nathanson et al.
5131020 July 14, 1992 Liebesny et al.
5182555 January 26, 1993 Sumner
5187810 February 16, 1993 Yoneyama et al.
5272638 December 21, 1993 Martin et al.
5327144 July 5, 1994 Stilp et al.
5343906 September 6, 1994 Tibbals, III
5428545 June 27, 1995 Maegawa et al.
5432842 July 11, 1995 Kinoshita et al.
5438517 August 1, 1995 Sennott
5465088 November 7, 1995 Braegas
5465289 November 7, 1995 Kennedy, Jr.
5523950 June 4, 1996 Peterson
5539645 July 23, 1996 Mandhyan et al.
5543789 August 6, 1996 Behr et al.
5543802 August 6, 1996 Villevieille et al.
5559864 September 24, 1996 Kennedy, Jr.
5613205 March 18, 1997 Dufour
5689252 November 18, 1997 Ayanoglu et al.
5724243 March 3, 1998 Westerlage
5732383 March 24, 1998 Foladare et al.
5740166 April 14, 1998 Ekemark et al.
5745865 April 28, 1998 Rostoker et al.
5751245 May 12, 1998 Janky et al.
5774827 June 30, 1998 Smith et al.
5801943 September 1, 1998 Nasburg
5839086 November 17, 1998 Hirano
5845227 December 1, 1998 Peterson
5880958 March 9, 1999 Helms et al.
5933100 August 3, 1999 Golding
5948042 September 7, 1999 Heimann et al.
5959568 September 28, 1999 Woolley
6012012 January 4, 2000 Fleck et al.
6038444 March 14, 2000 Schipper et al.
6098016 August 1, 2000 Ishihara
6128571 October 3, 2000 Ito et al.
6161071 December 12, 2000 Shuman et al.
6178374 January 23, 2001 Mohlenkamp et al.
6219793 April 17, 2001 Li et al.
6230011 May 8, 2001 Guenther et al.
6236932 May 22, 2001 Fastenrath
6236933 May 22, 2001 Lang
6240364 May 29, 2001 Kerner et al.
6256577 July 3, 2001 Graunke
6263205 July 17, 2001 Yamaura et al.
6288676 September 11, 2001 Maloney
6314360 November 6, 2001 Becker
6317686 November 13, 2001 Ran
6341255 January 22, 2002 Lapidot
6401027 June 4, 2002 Xu et al.
6401037 June 4, 2002 Muller et al.
6411895 June 25, 2002 Lau et al.
6411897 June 25, 2002 Gaspard, II
6424838 July 23, 2002 Stobbe et al.
6430496 August 6, 2002 Smith et al.
6438561 August 20, 2002 Israni et al.
6466862 October 15, 2002 DeKock et al.
6480783 November 12, 2002 Myr
6490519 December 3, 2002 Lapidot et al.
6532414 March 11, 2003 Mintz
6545637 April 8, 2003 Krull
6587781 July 1, 2003 Feldman et al.
6594577 July 15, 2003 Nakajima et al.
6606494 August 12, 2003 Arpee et al.
6618650 September 9, 2003 Nakai et al.
6708036 March 16, 2004 Proctor et al.
6711404 March 23, 2004 Arpee et al.
6718425 April 6, 2004 Pajakowski et al.
6792263 September 14, 2004 Kite
6799046 September 28, 2004 Tang
6842620 January 11, 2005 Smith et al.
6882930 April 19, 2005 Trayford et al.
6911918 June 28, 2005 Chen
6922629 July 26, 2005 Yoshikawa et al.
6931309 August 16, 2005 Phelan et al.
6947833 September 20, 2005 Kita et al.
6952643 October 4, 2005 Matsuoka et al.
6989765 January 24, 2006 Gueziec
7027819 April 11, 2006 Ozturk et al.
7031983 April 18, 2006 Israni et al.
7046691 May 16, 2006 Kadyk et al.
7062379 June 13, 2006 Videtich
7085649 August 1, 2006 Baur et al.
7107038 September 12, 2006 Fitch et al.
7155376 December 26, 2006 Yang et al.
7243134 July 10, 2007 Bruner et al.
7246007 July 17, 2007 Ferman et al.
7343242 March 11, 2008 Breitenberger et al.
7383438 June 3, 2008 Fahrny et al.
7444237 October 28, 2008 Dale
7620402 November 17, 2009 Feldman et al.
7986954 July 26, 2011 Steer
8024111 September 20, 2011 Meadows et al.
8423577 April 16, 2013 Lee et al.
20010018628 August 30, 2001 Jenkins et al.
20010029425 October 11, 2001 Myr
20010034577 October 25, 2001 Grounds et al.
20010037174 November 1, 2001 Dickerson
20010049637 December 6, 2001 Tso
20020009184 January 24, 2002 Shnier
20020026278 February 28, 2002 Feldman et al.
20020030698 March 14, 2002 Baur et al.
20020049630 April 25, 2002 Furuta et al.
20020055818 May 9, 2002 Gaspard
20020120390 August 29, 2002 Bullock
20020131565 September 19, 2002 Scheuring et al.
20020198694 December 26, 2002 Yang et al.
20030003918 January 2, 2003 Proctor et al.
20030040944 February 27, 2003 Hileman
20030069683 April 10, 2003 Lapidot et al.
20030096620 May 22, 2003 Ozturk et al.
20030135304 July 17, 2003 Sroub et al.
20030219024 November 27, 2003 Purnadi et al.
20030236818 December 25, 2003 Bruner et al.
20040076279 April 22, 2004 Taschereau
20040082312 April 29, 2004 O'Neill et al.
20040088362 May 6, 2004 Curbow et al.
20040111214 June 10, 2004 Buecher et al.
20040230636 November 18, 2004 Masuoka et al.
20040243285 December 2, 2004 Gounder
20050026619 February 3, 2005 Jha
20050065682 March 24, 2005 Kapadia et al.
20050192031 September 1, 2005 Vare
20060009885 January 12, 2006 Raines et al.
20060025158 February 2, 2006 Leblanc et al.
20060041518 February 23, 2006 Blair
20070016646 January 18, 2007 Tendjoukian et al.
20070060108 March 15, 2007 East et al.
20070106465 May 10, 2007 Adam et al.
20070220063 September 20, 2007 O'Farrell
20080004794 January 3, 2008 Horvitz
20080086455 April 10, 2008 Meisels et al.
20080208451 August 28, 2008 Minami
20080214192 September 4, 2008 Soliman
20080281665 November 13, 2008 Opaluch
20090036148 February 5, 2009 Yach
20090177484 July 9, 2009 Davis et al.
20090216633 August 27, 2009 Whitsett
20100010739 January 14, 2010 Tsushima
20100106627 April 29, 2010 O'Sullivan
20100125478 May 20, 2010 Bisht
20100280748 November 4, 2010 Mundinger et al.
20110125545 May 26, 2011 Lehmann et al.
20120166565 June 28, 2012 Hardy
Foreign Patent Documents
2 434 707 March 2004 CA
33 46 548 July 1985 DE
40 05 803 August 1990 DE
42 41 408 June 1994 DE
195 25 291 December 1996 DE
196 38 798 March 1998 DE
196 51 146 June 1998 DE
197 55 875 June 1998 DE
199 17 154 October 2000 DE
199 33 639 January 2001 DE
199 48 416 April 2001 DE
100 63 588 July 2001 DE
100 37 827 February 2002 DE
102005009604 September 2006 DE
102006033744 January 2008 DE
0 365 097 April 1990 EP
0 372 840 June 1990 EP
0 715 285 June 1996 EP
0 715 286 June 1996 EP
0 715 288 June 1996 EP
0 715 291 June 1996 EP
0 763 807 March 1997 EP
0 834 840 April 1998 EP
0 838 663 April 1998 EP
0 838 797 April 1998 EP
0879459 November 1998 EP
0879460 November 1998 EP
0 921 509 June 1999 EP
0 936 590 August 1999 EP
0951187 October 1999 EP
1109121 June 2001 EP
1 162 560 December 2001 EP
1 320 075 June 2003 EP
1 387 333 February 2004 EP
1 515 122 March 2005 EP
1550842 July 2005 EP
1576561 September 2005 EP
1591980 November 2005 EP
1600735 November 2005 EP
1900588 March 2008 EP
2431261 April 2007 GB
1-137778 May 1989 JP
4-290098 October 1992 JP
5-46086 February 1993 JP
5-233996 September 1993 JP
6-12593 January 1994 JP
7-83685 March 1995 JP
8-129697 May 1996 JP
9-14986 January 1997 JP
H0914986 January 1997 JP
H09113290 May 1997 JP
2653282 September 1997 JP
H10300495 November 1998 JP
11-25389 January 1999 JP
2927277 July 1999 JP
H11328571 November 1999 JP
3052405 June 2000 JP
2001-124569 May 2001 JP
3171031 May 2001 JP
2001124569 May 2001 JP
2002122437 April 2002 JP
2002-206395 July 2002 JP
3353656 December 2002 JP
3566503 September 2004 JP
WO 94/11839 May 1994 WO
9502307 January 1995 WO
WO 95/14292 May 1995 WO
WO 96/10807 April 1996 WO
WO 96/25830 August 1996 WO
WO 96/29688 September 1996 WO
9642179 December 1996 WO
9729470 August 1997 WO
9729471 August 1997 WO
WO 97/29470 August 1997 WO
WO 97/29471 August 1997 WO
WO 97/31241 August 1997 WO
9737318 October 1997 WO
WO 97/36148 October 1997 WO
WO 97/40606 October 1997 WO
WO 98/15149 April 1998 WO
WO 98/15935 April 1998 WO
WO 98/23115 May 1998 WO
WO 98/26395 June 1998 WO
WO 98/29758 July 1998 WO
WO 98/36397 August 1998 WO
WO 98/42179 October 1998 WO
WO 98/54682 December 1998 WO
WO 99/63499 December 1999 WO
WO 01/01367 January 2001 WO
WO 01/23835 April 2001 WO
WO 01/35370 May 2001 WO
WO 01/48725 July 2001 WO
WO 02/01158 January 2002 WO
WO 02/01532 January 2002 WO
WO 02/03350 January 2002 WO
WO 02/43026 May 2002 WO
WO 02/46868 June 2002 WO
WO 03/041030 May 2003 WO
WO 03/073048 September 2003 WO
2004021305 March 2004 WO
WO 2004/086799 October 2004 WO
2005098780 October 2005 WO
2006000208 January 2006 WO
2006005906 January 2006 WO
2006025728 March 2006 WO
2006073997 July 2006 WO
2007103180 September 2007 WO
2007149703 December 2007 WO
WO 2008/114369 September 2008 WO
2008136576 November 2008 WO
Other references
  • R. Sankar et al., “Intelligent Traffic Monitoring System Using Wireless Cellular Communications,” © 1997 IEEE.
  • K. Abe et al., “A Planning Method Combining Rule-Bases and Optimization Algorithms for Transportation Network,” © 1992 IEEE.
  • “Data Fusion for Dynamic Route Guidance Systems,” International Federation of Automatic Control (IFAC), 2361 Laxenburg, Schlossplatz 12, 1997.
  • N. Shamanesh, “Getting Drivers Out of a Jam,” Automotive Engineer, Oct. 1999.
  • Wang et al., “An Unified Vehicle Supervising and Traffic Information System,” © 1996 IEEE.
  • Fastenrath, Floating Car Data on a Larger Scale, Oct. 24, 1997.
  • J.J. Caffery et al., “Overview of Radiolocation in CDMA Cellular Systems,” published 1998; See Chapter “Accuracy Requirement” pp. 7-8, <http://sss-mag.com/pdf/radioloc.pdf>.
  • International Search Report issued in International Patent Application No. PCT/GB2005/002637 dated Sep. 21, 2005.
  • Written Opinion of the International Searching Authority issued in International Patent Application No. PCT/GB2005/002637.
  • M. Westerman et al., “Integration of Probe Vehicle and Induction Loop Data—Estimation of Travel Times and Automatic Incident Detection,” California PATH Research Report, Institute of Transportation Studies, Jan. 1, 1996.
  • “Grubbs Test for Outliers,” Engineering Statistics Handbook, 2000.
  • Office Action issued in U.S. Appl. No. 11/269,908 dated Jan. 4, 2013.
  • Office Action issued in U.S. Appl. No. 11/269,908 dated Jun. 22, 2012.
  • Office Action issued in U.S. Appl. No. 10/999,994 dated Apr. 15, 2010.
  • Office Action issued in U.S. Appl. No. 10/999,994 dated Sep. 9, 2010.
  • Office Action issued in U.S. Appl. No. 11/280,833 dated Dec. 3, 2010.
  • Office Action issued in U.S. Appl. No. 11/269,908 dated Jul. 12, 2010.
  • Office Action issued in U.S. Appl. No. 11/280,833 dated Feb. 16, 2011.
  • Office Action issued in U.S. Appl. No. 11/269,908 dated Dec. 27, 2010.
  • Office Action issued in U.S. Appl. No. 11/269,908 dated Jun. 9, 2011.
  • Office Action issued in U.S. Appl. No. 10/999,994 dated Dec. 7, 2011.
  • Office Action issued in U.S. Appl. No. 10/999,994 dated Mar. 21, 2011.
Patent History
Patent number: 9798985
Type: Grant
Filed: Jan 29, 2010
Date of Patent: Oct 24, 2017
Patent Publication Number: 20120036183
Assignee: INRIX HOLDINGS LIMITED (Altrincham)
Inventors: Jonathan Charles Burr (Cheshire), Gary Gates (Wirral), Alan George Slater (Bolton)
Primary Examiner: James Conaway
Application Number: 13/147,540
Classifications
Current U.S. Class: Based On User Input Preference (701/425)
International Classification: G06F 15/16 (20060101); G06Q 10/04 (20120101); G01C 21/26 (20060101); G01C 21/34 (20060101); G06Q 10/10 (20120101);