Traffic information adaptive to a user's travel

(54) Title: TRAFFIC INFORMATION (57) Summary:

ADAPTIVE TO A USER'S DISPLACEMENT (30) Unionist Priority: 28/02/2007 us 11 / 680,368 (73) Owner (s): Microsoft Corporation (72) Inventor (s): Matthew Cheung (74) Attorney (s): DANNEMANN , SIEMSEN,

BIGLER & IPANEMA MOREIRA (86) International Order: pct US2OO8O515O3 de

18/01/2008 (87) International Publication: wo 2008 / i06250de

04/09/2008

<img file="BRPI0807136A2_D0001.tif" />

“TRAFFIC INFORMATION ADAPTIVE TO THE DISPLACEMENT OF A USER”

Background of the Invention

Traffic information services allow users to make travel decisions based on current travel conditions. For example, traffic information services may display maps with color-coded road segments that represent the most recently identified traffic condition for each displayed road segment. Traffic information services can also provide a user with estimated travel times based on recent travel conditions, as well as providing a user with the latest traffic events, such as traffic incidents, construction and the like. Although such services provide users with the most recently available traffic information, they do not provide traffic forecast information.

Nowadays, due to the desire for traffic forecast information, more advanced traffic information services are being developed to incorporate traffic forecasts. Traffic forecasts provide the user with traffic information for a specific future instance. However, existing traffic forecasting information services simply forecast traffic based on a specific time. For example, a user who requests traffic forecast information for 8:00 am may receive a map that displays expected traffic conditions at 8:00 am for all road segments.

However, static forecast information, for an instant of time, may not be valid for the entire travel route and, thus, may prevent users from making an informed travel decision. For example, a user can use a traffic prediction information service, before departure, to determine the traffic forecast at time A. As the user begins to move, at time A, from the origin to the destination, the forecast information for the start of the route may be correct, but in the meantime, the rest of the route may become invalid due to the time of the travel from the user (for example, at time B, the user approaches a bottled motorway that was displayed with a normal traffic flow at time A). Due to the non-adaptive traffic information, the user can plan a travel route based on a normal traffic flow expected for a motorway at time A, but at time B, when the user approached the motorway , the traffic was no longer moving.

In existing traffic forecast information services, for a user to receive traffic forecast information that adapts to a user's travel and is valid for the entire route, the user must estimate the time of arrival at multiple locations along the route. route and retrieve traffic information in relation to the identified locations and cor2 respondents estimated arrival times. Such estimates are prone to error and can provide the user with inaccurate information. Additionally, estimating arrival times for multiple locations and retrieving corresponding traffic information can be tedious and time-consuming. Consequently, users of traffic information services are not provided with accurate traffic information that is obtained in a simple way.

Summary of the Invention

This Summary is provided to introduce a selection of concepts in a simplified way that is described with particularities below in the Detailed Description. This Summary is not intended to identify key resources or essential resources of the subject in question claimed, nor is it intended to be used as an aid in determining the scope of the subject in question claimed.

Modalities described below are directed to providing a traffic information service user with traffic information adaptive to the user's displacement. The user's source information, such as departure location and departure time, is identified. By identifying the user's source information, the user's expected arrival times for a plurality of distance segment purposes are determined. Traffic information adaptive to the user's travel is transmitted. Traffic information can refer to the time of travel, traffic flow, traffic events and the like. The user can receive traffic information through a plurality of communication devices, such as a personal computer, a portable navigation system, a telephone or the like.

Brief Description of Drawings

Modalities are described below in detail in relation to the attached drawings, in which:

figure 1 is a block diagram of a computing system environment for use in implementing a modality;

figure 2 is a block diagram of a network environment for use in implementing a modality;

figure 3 illustrates an exemplary system for adapting traffic information according to the displacement of a user, according to a modality;

figure 4 is a flow chart illustrating an exemplary method for providing traffic information to a user of traffic information services, according to an embodiment;

figure 5 is a table showing an exemplary data store according to an embodiment; and figure 6 is an exemplary display of traffic information according to an embodiment.

Detailed Description of the Invention

The subject in question described here is presented with specificity to satisfy statutory requirements. However, it is not intended that the description shown here limit the scope of this patent. Instead, it is realized that the subject in question can also be incorporated in other ways to include different stages or combinations of stages similar to those described in this document in conjunction with other current or future technologies. Furthermore, although the terms "step" and / or "block" can be used here to connote different elements of the methods employed, the terms should not be interpreted implying any particular order between or between the various steps disclosed here, unless and except when the order of the individual steps is explicitly described.

Modalities of the present invention provide techniques for providing traffic information to users. In general, modalities described here concern computer-readable systems, methods and media to provide users with traffic information that is adaptive to a user's time of travel.

Thus, in one example, one modality relates to adaptive traffic information systems to calculate an estimated travel completion time for one distance segment and the next distance segment. A traffic information system can include a first identification component configured to identify a distance segment; a second identification component configured to identify a start time to start the distance segment; a first determination component configured to determine an estimated end time to complete the distance segment, where the estimated end time to complete the distance segment comprises using existing traffic information at the start time to start the distance segment ; a third identification component configured to identify a next distance segment, the next distance segment starting at the end of the distance segment and with a start time to start the next distance segment equal to the estimated end time to complete the distance segment distance; and a second determination component configured to determine an estimated end time to complete the next distance segment, where the estimated end time to complete the next distance segment comprises using existing traffic information at the start time to start the next segment away.

In another example, a modality concerns a method for calculating the estimated time of completion of the shift for first and second distance segments. One method may include identifying a first distance segment; identify a departure time to start the first distance segment; determining an estimated end time to complete the first distance segment, where the estimated end time to complete the first distance segment comprises using existing traffic information at the time of departure to start the first distance segment in relation to the first distance segment; identify a second distance segment, the second distance segment starting at the end of the first distance segment and with a departure time to start the second distance segment equal to the estimated end time to complete the first distance segment; and determining an estimated end time to complete the second distance segment, where the estimated end time to complete the second distance segment comprises using existing traffic information at the time of departure to start the second distance segment in relation to the second distance segment.

In yet another modality, the modalities are directed to one or more computer-readable media with instructions executable by computer incorporated in them. One or more computer-readable media may include identifying a distance segment; identify a departure time to start the distance segment; determine an estimated end time to complete the distance segment, where the estimated end time to complete the distance segment comprises accessing a database with traffic information in relation to the departure time to start the distance segment and in relation to traffic in the distance segment; identify a next distance segment, the next distance segment starting at the end of the distance segment and with a departure time to start the next distance segment equal to the estimated end time to complete the distance segment; and determine an estimated end time to complete the next distance segment, where the estimated end time to complete the next distance segment comprises accessing a database with existing traffic information at the time of departure to start the next segment away and in relation to traffic in the next distance segment.

Having briefly described an overview of the modalities, an exemplary operating environment suitable for use in the modalities being implemented is described below.

Initially, in relation to figure 1, an exemplary operating environment for implementing the present invention is shown and designated, in general, as computing device 100. Computing device 100 is only an example of a suitable computing environment, and is not intended it is suggested that there is no limitation on the scope of use or functionality of the invention. Nor should computing device 100 be interpreted with any dependency or requirement on any of the components or combinations of components illustrated. In one embodiment, computing device 100 is a personal computer. But, in other embodiments, computing device 100 can be a cell phone, digital phone, personal digital assistant ("PDA"), portable navigation system, or other device that can execute computer instructions.

Modalities can be described in the general context of computer code or instructions used by the machine, including instructions executable by computer, such as program modules, which are executed by a computer or other machine, such as a personal digital assistant, navigation system laptop or other handheld device. In general, program modules, including routines, programs, objects, components, data structures and the like, relate to code that performs tasks in particular or implements particular types of abstract data. Modalities can be practiced in a variety of system configurations, including handheld devices, consumer electronic devices, general purpose computers, more specialized computing devices, etc. Modalities can also be practiced in distributed computing environments, in which tasks are performed by remote processing devices that are connected through a communications network.

In relation to Figure 1, computing device 100 includes a bus 110 that directly or indirectly couples the following devices: memory 112, one or more processors 114, one or more display components 116, input / output ports 118, components input / output 120, and an illustrative power supply 122. Bus 110 represents what can be one or more buses (such as an address bus, data bus, or combination thereof). Although the various blocks in Figure 1 are shown with lines, for the sake of objectivity, in reality, the outline of the various components is not so clear and, metaphorically, the lines would be, more precisely, gray and confusing. For example, a presentation component, such as a display device, can be considered as an I / O component. Also, processors have memory. It is realized that such is the nature of the technology, and it is reiterated that the diagram in Figure 1 is merely illustrative of an exemplary computing device that can be used in conjunction with one or more modalities of the present invention. No distinction is made between such categories as “workstation”, “server”, “portable computer”, “handheld device”, etc., since all are covered in the scope of figure 1 and refer to the “computing device ”.

Typically, computing device 100 includes a variety of computer-readable media. As an example, and without limitations, computer-readable media can comprise Random Access Memory (RAM); Exclusive Reading Memory (ROM); Exclusive Electronically Erasable Programmable Reading Memory (EEPROM); flash memory or other memory technologies; CDROM, digital versatile discs (DVD) or other optical or holographic media; magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices; carrier wave or any other medium that can be used to encode desired information and be accessed by computing device 100.

Memory 112 includes computer storage media in the form of volatile and / or non-volatile memory. The memory can be removable, non-removable, or a combination of these. Exemplary hardware devices include solid-state memory, hard drives, optical disc drives, etc. Computing device 100 includes one or more processors that read data from various entities, such as memory 112 or I / O components 120. Presentation component (s) 116 presents data indications to a user or other device. Exemplary presentation components include a display device, speaker, printing component, vibrating component, etc.

I / O ports 118 allow computing device 100 to be logically coupled to other devices, including I / O components 120, some of which can be embedded. Illustrative components include a microphone, lever, game controller, satellite dish, scanner, printer, wireless device, etc.

Figure 2 illustrates a block diagram of a network architecture for use in implementing a modality. In general, the network architecture, referred to by the number 200, comprises client computing device 202, server 201 and a database 208, which communicate through a network 206. Experienced in the art, they realize that the network architecture 200 is merely an example of a suitable network environment, and is not intended to suggest any limitations on the scope of use or functionality of the modalities. Nor should network architecture 200 be interpreted with any dependency or requirement on a single component or combination of components illustrated herein.

The client computing device 202 may be any type of computing device, such as the device 100 described above with respect to figure 1. By way of example only, and without limitation, the client computing device 202 may be a personal computer, desktop computer, laptop, handheld device, cell phone, digital phone, PDA, portable navigation system or the like. It is understood that modalities are not limited to implementations on such computing devices, but can be implemented on any of a variety of different types of computing devices.

The network 206 can include any computer network or combination thereof. Examples of configurable computer networks to operate as the 206 network include, without limitation, a wireless network, fixed line network, cable line, fiber optic line, LAN, WAM or the like. However, network 206 is not limited to connections that couple separate computer units. Instead, network 206 may also comprise subsystems that transfer data between servers or computing devices. For example, network 206 may also include a point-to-point connection, an internal system Ethernet, a motherboard bus, an electrical bus, a neural network, or other internal system. In an embodiment in which network 206 comprises a LAN network environment, components are connected to the LAN via a network interface or adapter. In an embodiment where network 206 comprises a WAN network environment, components use a modem or other device to establish communications over the WAN to communicate. In modalities where the 206 network comprises a MAN network environment, components are connected to MAN using wireless interfaces or fiber optic connections. Such network environments are commonplace in offices, corporate computer networks, intranets and the Internet. It is realized that the network connections shown are exemplary and that other devices for establishing a communications link between computers can also be used.

Server 204 can include any type of application server, database server or configurable file server to perform the methods described herein. Furthermore, server 204 can be a dedicated or shared server. An example, without limitations, of a server that is configurable to operate as server 204 is a structured query language (“SQL”) server that runs server software, such as SQL Server 2005, which was developed by Microsoft Corporation, with headquarters in Redmond, Washington.

Server components 204 (not shown for objectivity) may include, without limitation, a processing unit, internal system memory, and a system bus suitable for coupling various system components, including one or more databases to store information ( for example, files and metadata associated with them). Typically, each server includes a variety of computer-readable media or has access to it. As an example, and without limitation, computer-readable media may include computer storage media and communication media. In general, communication media enables each server to exchange data over the 206 network. More specifically, communication media can incorporate computer-readable instructions, data structures, program modules or other data into a modulated data signal, such as a carrier wave or other transport mechanism, and can include any information distribution media . As used herein, the term "modulated data signal" refers to a signal that has one or more of its attributes adjusted or changed in such a way as to encode information in the signal. For example, and without limitation, communication media includes wired media, such as wired network or direct wired connection, and wireless media, such as acoustics, RF, infrared, and other wireless media. Combinations of all exposed items can also be included in the scope of computer-readable media.

Those skilled in the art understand that network architecture 200 is merely exemplary. Although server 204 is illustrated as a single box, those skilled in the art realize that server 204 is scalable. For example, server 204 may actually include 100 communicating servers. Furthermore, database 208 can be included on server 204 or client computing device 202 or as a storage medium on the computer. Single unit representations are given for objectivity, and do not limit the scope of the modalities in any way.

In operation, a user interacts with the client computing device 202 through a graphical user interface. In one embodiment, the graphical user interface uses an Internet browser to access a map service running on server 204. Exemplary map services include Microsoft Windows Live ™ Maps and Traffic.com®. In alternative modalities, the graphical user interface accesses the map service through an application running on the 202 client computing device. For example, the map service can be incorporated into an application, such as Microsft® Streets and Trips 2007 .

In one embodiment, the map service is an Internet service configured to support interoperable machine-to-machine communication between client computing device 202 and server 204. In an alternative embodiment, the map service includes an application programming interface ( “API”) configurable to access the 208 database. Examples of such APIs include, without limitation, active data objects (“ADO”), remote data objects (“RDO”) and the like.

Figure 3 illustrates an exemplary system for providing adaptive traffic forecast information to one or more users. A user can be a single traveler or multiple aggregate travelers around an identified time and place. For example, a user may be multiple travelers driving near exit 22 around 8:15 am on January 28, 2007.

As shown in Figure 3, an exemplary computer system 300 includes an identification component 302, a determination component 312, a calculation component 318, and a transmission component 320. Computer system 300 may reside on a server 204, on a client computing device 202 or a combination thereof.

Identification component 302 is a component that identifies source information, including a user's expected departure time and a user's expected departure location, and destination information, if applicable and desired. In one embodiment, identification component 302 comprises time component 304, starting component 306, destination component 308 and desired transmission component 310. Although the time component 304, the starting component 306, the target component

308 and the desired transmission component 310 are illustrated as four separate components in figure 3, skilled in the art realize that the components are scalable and can actually be combined into a single component or a plurality of components.

Time component 304 identifies a user's expected departure time. A user's expected departure time can be identified based on a user's input, a standard measurement, a user's access history, or another departure time identification mechanism, such as, for example, a device configured to identify the vehicle's ignition start time. An expected departure time based on a user's input may include a time selected by a user or entered using a keyboard or voice. An expected departure time based on a standard measurement can include the current time, the time the user accesses the traffic information system, or a specific time that follows the user's request for traffic information or initial access to the system ( for example, five minutes after connecting to the traffic information system). The specific time that follows the user's request for traffic information or initial access to the system can be based on user input, input from a system vendor, or an algorithm. An expected departure time based on the user's access history can be determined by the most recent accesses to the system or by an algorithm configured to include user details, such as, for example, user connection time, user disconnection time , the user’s current location, and the user’s destination.

Starting component 306 identifies a user's expected starting location. A user's expected starting location can be identified based on a user's input, a standard measurement, a user's access history, network infrastructure, such as an IP address, or other user identification mechanism. departure time, such as, for example, a device configured to identify the location of a user or a vehicle (for example, portable navigation system). Similar to time component 304, an expected starting location based on a user's input may include a location selected by a user (such as using a drop-down menu or selecting a location on a map) or entering via of a keyboard or voice in relation to an address, coordinate, intersection or the like. An expected departure location based on a standard measurement may include a standard location for the device using the traffic information system, such as a home location, an office location, a vehicle location, or a location of a user. An expected starting location based on a user's access history can be determined by the most recent access locations to the system or by an algorithm configured to include user details, such as, for example, the user's current location and the user's destination .

Target component 308 identifies a user's expected target location. For example, the expected destination location is the final location where the user wants to end the journey. A user's expected destination location can be identified based on a user's input, a standard measurement, or a user's access history. An expected destination location based on a user's input can include a destination location selected by a user (such as using a drop-down menu or selecting a location on a map) or entering via a keyboard or voice in relation to an address, coordinates, intersection or the like. An expected destination location based on a standard measurement may include a standard for the location of the user's work address, home address or other frequented location. An expected destination location based on a user's access history can be determined by the most recently identified destinations or by an algorithm.

The desired transmission component 310 identifies one or more desired transmissions. The desired transmissions may include transmission in relation to the traffic flow, a traffic event, a travel time, or a combination of these. Transmission in relation to traffic flow concerns how fast the traffic is moving and can be based, at least in part, on speed limits, traveler speed rates, weather, traffic events, historical data, etc. Transmission in relation to traffic events can be based on traffic incidents, construction, community activities, historical events, etc. Information regarding a user's travel time can also be transmitted. Travel time is the amount of time it takes a user to travel from one distance segment to another distance segment, the amount of time it takes a user to travel multiple distance segments, or the amount of estimated time a user takes to travel an entire route. Desired transmission in relation to the traffic flow, a traffic event or a travel time may additionally concern one or more distance segments, one or more roads, a metropolitan area, a state or the like. A distance segment can be a predefined distance, such as a road distance or radial distance, a predefined road, a predefined road segment or the like. In one embodiment, all information regarding traffic flow, traffic events and travel time may be desirable.

The desired transmission can be selected or entered by the user or it can be a standard based on the user's wishes. Alternatively, the desired transmission can be selected or entered by the service provider, or it can be a default based on the service provider. In some embodiments, the desired transmission component 310 is not required.

Determination component 312 is a component that determines one or more routes and that determines relevant distance segments. In one embodiment, the determining component 312 comprises route component 314 and distance segment component 316. Although route component 314 and distance segment component 316 are illustrated as two separate components in figure 3, skilled in the art realize that the components are scalable and can actually be combined into a single component or a plurality of components.

Route component 314 determines one or more routes. A route includes one or more distance segments. A distance segment can be a predefined distance, such as a road distance or radial distance, a predefined road, a predefined road segment or the like. In some examples, one or more routes may be determined based on an identified starting location and an identified destination location or based on an identified starting location and an identified desired transmission over one or more distance segments or to one or more specific roads. Multiple routes, such as the route with the shortest distance, the route with the shortest time, the user's preferred route and the like, can exist for each specific destination location, distance segment or road. Alternatively, there may be a user or service provider adjustment pattern, such that a defined number of routes, such as one, exist for each specific destination location, distance segment or road.

In other examples, one or more routes can be determined based on an identified starting location and a desired transmission identified in relation to a metropolitan area or the like. In a case like this, a destination location does not need to be identified and traffic information for all major roads, or even all distance segments, can be displayed. Although traffic information is desired in relation to a neighborhood, the system determines a plurality of routes to provide a user with traffic information adaptive to the user's displacement.

In one mode, routes can be determined based on the shortest distance to each distance segment or the shortest time to each distance segment. For example, in relation to figure 6, consider that a user's place of origin is point O. To determine routes to provide traffic information relevant to the metropolitan area, the system can assume that the user will travel in distance segment A until you reach the end of distance segment A. At the end of distance segment A, the system will additionally consider that the user will travel in distance segment B until reaching the end of distance segment B, instead of traveling in distance segments D, E and F to arrive at the same distance segment Score. At the end of distance segment B, the system will assume that the user will move on distance segment C until reaching the end of distance segment C, instead of moving on distance segments B, D, E, F and C to get to the same point. Similarly, at the end of distance segment B, the system will also assume that the user will travel on distance segment F until reaching the end of distance segment F, instead of traveling on distance segments B, D and E to reach at the same point. In this way, the system determines that one route includes distance segments A, B and C and another route includes distance segments A, B and F.

The distance segment component 316 determines distance segments relevant to a route. Determining relevant distance segments can increase the efficiency of the traffic information system by reducing the number of distance segments analyzed. Relevant distance segments can be determined based on the desired transmission identified by the desired transmission component 310, at the destination location identified by destination location 308 or a combination of these.

In modalities where the information of the expected traffic flow is a desired transmission, relevant distance segments may include distance segments from which a user wants traffic information or distance segments with a changed traffic flow caused, for example, by minors driving speeds, traffic events, weather, etc. In such cases, relevant distance segments can also include at least one distance segment on a predetermined route that can be shifted to reach the specified or changed distance segment. Alternatively, relevant distance segments can include all distance segments in a neighborhood where traffic flow information for an entire area is desired.

In modalities where traffic event information is a desired transmission, relevant distance segments may include distance segments affected by known and expected traffic events, such as, for example, traffic incidents, construction, community activities and the like. In such cases, relevant distance segments may also include at least one distance segment on a predetermined route that can be moved to reach the distance segment affected by known or expected traffic events. Alternatively, the relevant distance segments can include all distance segments in a neighborhood where traffic event information for an entire area is desired.

In modalities where travel time is a desired transmission, the relevant distance segments can include any distance segment on a selected number of routes on which the user can travel until reaching a destination or any distance segment on a route such as a route with the shortest distance, the route with the shortest time the user can travel until reaching a destination. Alternatively, the relevant distance segments can include all distance segments in a neighborhood in cases where travel time for all distance segments in an area is desired.

Calculation component 318 calculates expected arrival times for a plurality of relevant distance segment purposes. An area, such as roads, can be divided into segments (ie distance segments) to provide more accurate transmission of traffic information. As aforementioned, a distance segment can be a predetermined distance, such as the distance of a road or radial distance, a road, a road segment or a combination of these. The end of a distance segment is a location that a user arrives at when they reach the end of a distance segment.

Multiple methods can be used to calculate a user's expected arrival time at each distance segment end. In one embodiment, a geographic reference system can be used to calculate expected arrival times for distance segment purposes. Experienced in the technique, they realize that this method incorporates a radial distance from the starting point, or from another place, to the end of the road segment, and a nominal travel speed considered. In another embodiment, a routing engine can be used to compute the earliest time a user is expected to arrive at the end of a distance segment based on the user's route. In both a geographic reference system modality and a routing engine modality, the user's expected arrival time at each distance segment end can be determined, at least in part, by retrieving information from a database with expected travel times.

In a more advanced and more accurate mode, traffic conditions, such as traffic flow and traffic events, can be used to calculate a user's expected arrival time for distance segment purposes. In a case like this, by identifying the expected origin information, to calculate an expected arrival time for an end of the distance segment, the expected arrival time for the end of the previous distance segment as well as the expected travel time in the distance segment of interest are determined. In this way, the calculation of the expected arrival times for distance segment purposes starts with the distance segment closest to the departure location and depends on the travel conditions in the distance segment in the expected travel hours. As an illustration, see figure 5 and consider that segment 1 is the distance segment closest to the place of departure, for example, home, and that the user left the home at 8:00. The user is expected to continue on distance segment 1 for six minutes and reach the end of distance segment 1 at 8:06 am. Because the user is expected to reach the end of distance segment 1 at 8:06, the user is also expected to start distance segment 2 at 8:06. The user is expected to have a travel time in distance segment 2 of seven minutes and thus reach the end of distance segment 2 at 8:13. The procedure continues until the user arrives at the destination, located at the end of distance segment 5, at 8:31.

In relation to the advanced modality, several factors can be included in determining the expected travel time of the user in a specific distance segment at a specific time, such as, for example, traffic flow, traffic events and historical traffic information. Traffic flow can include the speed rate of travelers driving on road segments and can incorporate the speed limit, the type of road, weather conditions, special zones (eg school zones) and traffic events . Traffic events include, among other things, traffic incidents, road construction, community events, such as sporting events, etc. In one embodiment, the user's expected travel time in a specific distance segment at a specific time can be determined by retrieving traffic condition information from a database with expected traffic conditions.

A user can request traffic condition information or travel time for routes to a specific destination or routes to a specific distance or road segment. In a case like this, the destination can be identified in the destination component 308 and the computer system can use one of the three methods mentioned above (that is, geographic reference system, routing engine or expected traffic conditions) to calculate the time expected user arrival time at each distance segment end on each route. Traffic information, such as traffic flow and traffic events, can be transmitted for each distance segment based on the expected arrival time for the end of the previous distance segment. In addition, the arrival times for each distance segment end can be added to achieve an expected travel time that is adaptive to the user's travel. One or more travel times can be calculated, depending on the number of routes.

Alternatively, a user can request traffic information for a metropolitan area or other neighborhood. In a case like this, a destination location does not need to be identified, and traffic information for all motorways, or even all distance segments, can be displayed. To calculate arrival times at segment route ends, the system is based on the multiple routes determined in route component 314. The computer system can use one of the three methods mentioned above (that is, geographic reference system, routing engine or expected traffic conditions) to calculate the expected arrival time of the user at each distance segment end on predetermined routes . For example, in relation to figure 6, consider that the user's place of origin is the O point and that the information in relation to a metropolitan area is the desired transmission. The system will calculate the expected arrival time at the end of distance segment A. Based on the expected arrival time at the end of distance segment A, traffic information for distance segments B and D will be transmitted according to that time. Based on the expected arrival time at the end of distance segment B, traffic information for distance segments C and F will be transmitted according to the calculated time. For example, based on the expected arrival time at the end of distance segment B, the traffic flow for distance segment C is displayed as 40 - 72 kilometers per hour (25 - 45 miles per hour) for the first part of the segment, and changes to 0-40 kilometers per hour (0 - 25 miles per hour) for the final part of distance segment C.

In addition to displaying traffic flow and traffic event information for a metropolitan area, travel times, based on the expected arrival times calculated at each distance segment end, can also be displayed, even though no destination is specified. In one example, a map can display a symbol at the ends of the distance segment and a user can select the symbol, in such a way that the travel time from the user's starting location to the end of the distance segment is displayed.

Transmission component 320 transmits traffic information in relation to traffic flow, traffic events, travel time or a combination of these. A transmission component 320 residing on a server transmits traffic information to a client computing device, such as client computing device 100. A transmission component 320 residing on a client computer transmits traffic information to the user via a graphical user interface (GUI). The transmission component 316 can determine the traffic information to be transmitted according to the desired transmission identified by the desired transmission component 310.

The traffic information transmitted by the transmission component 316 may result in the modification, display or removal of particular traffic information. For example, for traffic events, the severity of a traffic incident can be adjusted based on the expected progress of the incident (for example, an incident being undone can be completely undone by the time the user arrives and, therefore, it should be minimized or removed). On the other hand, a new incident can be displayed if it becomes relevant at the time the user is expected to arrive (for example, scheduled road maintenance).

Traffic information in relation to the traffic flow can be transmitted. Traffic flow can be based, at least in part, on speed limits, traveler speed rates, weather, traffic events and historical data. The traffic flow can be graphically represented in a variety of methods. For example, the traffic flow can be graphically represented on a map simply by using different road segment colors to indicate different traffic flows. Various road segment colors can be used, for example, to indicate varying speed rates or reductions in speed rate (for example, red road segments indicate motionless traffic or traffic moving at speeds from zero to forty kilometers per hour (zero to twenty-five miles per hour), yellow road segments indicate traffic moving at reduced speeds or traffic moving at a speed of forty to seventy two kilometers per hour (twenty five to forty five miles per hour), green road segments indicate freely flowing traffic or traffic moving at a speed of more than seventy-two kilometers per hour (forty-five miles per hour). Alternatively, the traffic flow can be graphically represented on a map by using different display formats, such as full, broken or dashed lines. Figure 6 provides a view of the flow of traffic graphically represented. The traffic flow can also be described by representations of value, text or symbol. For example, a value of 10 (on a scale of 1 to 10), the word “excellent” or four stars can represent that traffic is flowing freely or moving at a speed of more than seventy-two kilometers per hour (forty and five miles an hour). Experienced in the technique, they realize that a variety of different graphic, numerical, textual or symbolic representations can be used to differentiate various traffic flow conditions. If the traffic flow is represented graphically, quantitatively, textually or symbolically, the traffic flow can relate to one or more specific distance segments, specific roads, specific routes, roads in a metropolitan area and roads in a state.

In another mode, traffic events can be broadcast. Traffic events can include traffic incidents, construction, community activities and historical events. Traffic events can also be transmitted using a graphical representation, such as an icon positioned on a map display next to the traffic event. Figure 6 provides a display of the graphically represented traffic events. Traffic events can also be described by numerical and textual representations. For example, a value of 5 (on a scale of 1 to 10) or the word "construction" can represent that construction on a road segment is delaying traffic. In addition, details regarding the traffic event can also be transmitted, such as, for example, severity level, location, description, start time and estimated end time. Experienced in the technique, they realize that a variety of different graphic, numerical and textual representations can be used to differentiate various traffic events. If traffic events are represented graphically, quantitatively or textually, the traffic details transmitted may relate to one or more specific distance segments, specific roads, specific routes, roads in a metropolitan area, roads in a state or the like.

In yet another mode, the travel time calculated by the user can be transmitted. Travel time is the amount of time it takes a user to travel from one distance segment to another distance segment, the amount of time it takes a user to travel multiple distance segments, or the amount estimated time it takes a user to travel an entire route. The travel time can also be transmitted by means of a graphic representation, a value, text and the like. For example, the value 5, the words “five minutes” or two stars can represent a travel time of approximately five minutes or a relatively short travel time. Experienced in the technique, they realize that a variety of different graphic, numerical or textual representations can be used to differentiate various displacement times.

In one example, a destination can be identified by destination component 308 to transmit a user's travel time. The arrival times for each end of the road segment can be added to achieve an expected travel time that is adaptive to the user's travel. One or more arrival times can be calculated, depending on the number of routes. In an alternative embodiment, a destination does not need to be identified by the destination component 308. In a case like this, because no destination is identified, the calculation of arrival times until the end of the road segment can be performed in a similar way to that which can be used to calculate arrival times at the end of the road segment for transmit traffic flow information when there is no destination. In one example, a map may display a symbol at the ends of the road segment or at selected ends of the road segment, and a user may select the symbol in such a way that the travel time from the user's starting location to the end of the road segment is displayed.

Figure 4 illustrates an exemplary method 400 for providing traffic information adaptive to a user's travel time. Initially, in block 402, a user's departure time is identified. A user's expected departure time can be identified based on a user's input, a standard measurement, a user's access history or another departure time identification mechanism. In block 404, a user's starting location is identified. A user's expected departure location can be identified based on a user's input, a standard measurement, a user's access history, or another departure time mechanism. A destination location is identified in block 406. Those skilled in the art realize that, in some modalities, a destination location does not need to be identified.

In block 408, the desired transmission is identified. Desired transmissions may include transmissions in relation to traffic flow, a traffic event, a travel time, or a combination of these. Desired transmission can be entered or selected by the user or the service provider. In block 410, a route is determined. In modes where a destination location is identified, or where a travel time, traffic flow or traffic event in relation to one or more distance segments or specific roads is the desired transmission, the route may be based on distance shorter, in the shortest time, on the preferred route designated by the user or the like, to acquire the predetermined end point. In modalities in which the destination locations are not identified and the desired transmission concerns a metropolitan area, for example, routes can be determined by algorithms. The algorithms can be configured to include the shortest distance or shortest time calculations.

The relevant distance segments are determined in block 412. The relevant distance segments can be determined based on the desired transmission identified by the desired transmission component 310, at the destination identified by destination 308 or a combination of these. Relevant distance segments can include one or more distance segments or roads that are of interest to the user, distance segments positioned on a route to one or more distance segments or roads that are of interest to the user, road segments on a route where a destination location is identified or all distance segments in a neighborhood.

In block 414, the relevant distance segment closest to the starting location is determined. The expected arrival time for the end of the distance segment identified in block 414 is calculated in block 416. In block 418, the expected arrival time for the end of the distance segment and all associated traffic flows or traffic events are stored. For example, in relation to figure 5, distance segment 1 is the distance segment closest to the departure location and has an expected completion time of 8:06 am, traffic flow is normal and there are no incidents for the segment .

The next distance segment of the route is determined in block 422, and the expected arrival time for the respective end of the distance segment using the end time for the end of the previous distance segment is calculated in block 424. In block 426 , the expected arrival time for the end of the distance segment, and all associated traffic flows or traffic events are stored.

In block 420, it is determined whether there is any further distance segment in the route. If there are more distance segments, blocks 422 through 426 are revisited until there are no more distance segments in the predetermined route. When it is determined that there are no additional distance segments on the predetermined route, in block 428, it is determined whether there are other routes with relevant road segments. If applicable, blocks 412 through 428 are revisited until there is no other route with relevant road segments. When there is no other route with relevant road segments, in block 428, the desired transmission traffic information is transmitted to block 430. In one embodiment, in block 430, the traffic information is provided to the user.

As an illustration, in relation to figure 4 and figure 5, the user starts at the starting point O at 8:00 am and enters a destination location at the end of the distance segment

5. In block 408, the user selects the desired transmission to include traffic events, traffic flow and travel time in relation to a route with a shorter distance from the starting point O to the destination location at the end of the distance segment 5. In block 410, route 1, 2, 3, 4, 5 is determined and relevant distance segments 1, 2, 3, 4 and 5 are determined in block 412. In block 414, the distance segment located closest to the starting location is determined to be segment 1. The traffic flow for segment 1 is determined with a normal traffic flow, and segment 1 has no traffic events . The estimated arrival time calculated for the end of distance segment 1 is 8:06 am, based on the expected traffic conditions for segment 1. Traffic information, including arrival time, traffic flow and traffic events, is stored in block 418. In block 422, the next distance segment 2 is identified. In block 424, using traffic information for segment 2, at 8:06, the end time of segment 1, it is determined that the expected arrival time for the end of distance segment 2 is 8:13 am in due to a slow flow of traffic due to construction. The traffic information is stored in block 426. In block 420, again it is determined that there are more distance segments in route 1, 2, 3, 4, 5 and, in block 422, the next distance segment 3 is identified. In block 424, using traffic information for distance segment 3 at 8:13, it is determined that the expected arrival time for the end of distance segment 3 is 8:20 and that there are no traffic events and that the Traffic flow is normal for distance segment 3 at 8:20 arrival time. Traffic information is stored in block 426. In block 420, again it is determined that there are more distance segments in route 1, 2, 3, 4, 5 and, in block 422, the next distance segment 4 is identified. In block 424, using traffic information for segment 4 at 8:20, it is determined that the expected arrival time for the end of distance segment 4 is 8:26 am and that the traffic flow for segment 4 is blocked at arrival time 8:26 am due to a traffic incident. Traffic information is stored in block 426. In block 420, again, it is determined that there are more distance segments in route 1, 2, 3, 4, and, in block 422, the next distance segment 5 is identified. In block 424, using traffic information for segment 5 at 8:26, it is determined that the expected arrival time for the end of distance segment 5 is 8:31 and that the traffic flow for distance segment 5 is normal and that there are no traffic events at 8:31 arrival time. The traffic information is stored in block 426.

In block 420, it is determined that there are no additional relevant distance segments in the route determined in block 412. In block 428, it is further determined that there are no additional routes available to travel from the starting point O to the destination location in the end of segment 5. The desired traffic information in relation to the traffic flow, traffic events and travel time is transmitted in block 430.

The modalities have been described here in relation to particular modalities that are intended to be, in all respects, illustrative rather than restrictive. Alternative modalities will be apparent to those skilled in the art to which the present invention relates without departing from its scope.

From the above, it is clear that this invention is a well-adapted invention to achieve all the purposes and objectives previously presented, along with other advantages that are obvious and inherent to the system and method. It is understood that certain resources and sub-combinations are useful and can be used without regard to other resources and sub-combinations. This is contemplated and is in the scope of the claims.