ROUTING ENGINE

• US 20160084666A1
• Filed: 04/17/2014
• Published: 03/24/2016
• Est. Priority Date: 04/17/2013
• Status: Abandoned Application

• Current Assignee: TomTom Navigation B.V (TomTom NV)
• Original Assignee: TomTom Development Germany GmbH (TomTom NV)
• Inventors: Dzyuba, Tetyana, Sasse, Jan-Ole
• Application Number:
  US14/785,363
• Publication Number:
  US 20160084666A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G01C 21/3407 specially adapted for specific applications
• CPC Class Codes: G01C 21/3492 employing speed data or traffic data, e.g. real-time or historical traffic control systems for road vehicles involving transmission of navigation instructions to the vehicle G08G1/0968
• CPC Class Codes: G08G 1/096827 where the route is computed onboard
• CPC Class Codes: G08G 1/096844 where the complete route is dynamically recomputed based on new data

Abstract

A route planning system comprising a routing engine is described in which data access to map data for selecting from a plurality of routes comprises means for receiving traffic data for a plurality of routes between two nodes and using the traffic data with map data to select an initial best route between the two nodes.

Claims

1. A computer implemented method of planning a time-dependent route between a first location and a second location using a routing engine, wherein the routing engine has access to map data comprising a plurality of segments, the method comprising:

receiving traffic data indicative of one or more traffic delays, each traffic delay being associated with;

location information indicating a location of the respective traffic delay; and

duration information indicative of when the respective traffic delay is expected to expire; and

,

when planning the time-dependent route, imposing a routing penalty for any segment that enters a point within a traffic delay, so as to generate a route that preferentially avoids the traffic delay.

2. The method of claim 1, wherein the presence of a traffic delay is determined using the duration information and location information.

3. The method of claim 1, wherein the duration information for each traffic delay is determined by analysing live probe traffic data.

7. A non-transitory computer readable medium comprising computer software operable, when executed on a route planning system comprising one or more processors, to cause the one or more processors to perform a method according to claim 1.

4. A time-dependent route planning system configured to plan a time-dependent route between a first location and a second location using a routing engine, wherein the routing engine has access to map data comprising a plurality of segments, the system comprising one or more processors arranged to:

receive traffic data indicative of one or more traffic delays, each traffic delay being associated with;

location information indicating a location of the respective traffic delay; and

duration information indicative of when the respective traffic delay is expected to expire; and

,

when planning the time-dependent route, impose a routing penalty for any segment that enters a point within a traffic delay, so as to generate a route that preferentially avoids the traffic delay.

5. The system of claim 4, wherein the presence of a traffic delay is determined using the duration information and location information.

6. The system of claim 4, wherein the duration information for each traffic delay is determined by analysing live probe traffic data.

8. (canceled)

9. A computer implemented method of planning a time-dependent route between a first location and a second location using a routing engine, wherein the routing engine has access to map data comprising a plurality of segments, the method comprising:

receiving traffic data indicative of one or more traffic delays, each traffic delay being associated with;

location information indicating a location of the respective traffic delay; and

duration information indicative of when the respective traffic delay is expected to expire;

planning a plurality of time-dependent routes between the first location and the second location, wherein said planning comprises imposing a routing penalty for any segment of a route that enters a point within a traffic delay determined to exist on other segments using the duration information and location information for the respective traffic delay, so as to preferentially avoid the traffic delay;

selecting one of the plurality of routes as the optimum route between the first location and the second location time-dependent route; and

generating navigation instructions to guide a user along the selected optimum route.