Tomtom Navigation B.v.

Tom Tom International B.v.

Other

Tomtom Development Germany Gmbh

Andreas Profous

Heiko Schilling

Ewgenij Gawrilow

Moritz Hilger

Jürgen Werber

Alexandru Serbanescu

Dominique Pelle

Simone Francine Tertoolen

Johannes Robert Fischer

Andreas Menge

This invention concerns a method of determining a route using map data comprising a plurality of navigable paths, the map data divided into a plurality of regions. The method comprises using at least one processing apparatus to: receive an origin and a destination on the map data and a travel time, determine a route from the origin to the destination using the map data and minimum cost data that identifies minimum cost paths between regions of the map data. The minimum cost data identifies more than one minimum cost path between a pair of the regions if different minimum cost paths exist between the pair of regions at different times and determining a route comprises identifying from the minimum cost paths for the pair of regions comprising the origin and destination, the minimum cost path having a lowest cost at the travel time.

Navigation devices and methods carried out thereon

Embodiments of the present invention provide a one-to-many route searching method comprising searching map data to select links to form a plurality of routes from a departure node according to a cost function, and determining an extent of each route according to an objective function, wherein the searching of the map data is performed to a search boundary based upon a cost of an unreachable node.

Apparatus and method for route searching

This invention concerns a method of determining a route using map data comprising a plurality of navigable paths, the map data divided into a plurality of regions. The method comprises using at least one processing apparatus to: receive an origin and a destination on the map data and a selection of one of a plurality of cost functions and determine a route from the origin to the destination using the map data and minimum cost data that identifies minimum cost paths between regions of the map data. The minimum cost data identifies more than one minimum cost path between a pair of the regions if different minimum cost paths exist between the pair of regions for different cost functions and determining a route comprises identifying from the minimum cost paths for the pair of regions comprising the origin and destination, the minimum cost path having a lowest cost for the selected cost function.

A method of creating map data including search acceleration data arranged to increase the speed at which a route can be planned across an electronic map comprising a plurality of navigable segments, each navigable segment representing a segment of a navigable route in the area covered by the map, wherein the method comprises:

Navigation devices

A computerized method of generating a routefrom an origin position Fto a destination positionacross an electronic mapcomprising a plurality of vectors representing segments of a navigable route in the area covered by the electronic map, the method comprising: (1) obtaining delay data indicating delays on vectors within the area covered by the electronic map; (2) calculating a first portionof a route from origin position toward the destination positionusing a first routing method up to a predetermined thresholdfrom the origin position F, such that the first routing method uses the delay data so that the first portionof the route takes into account delays; and (3) calculating a second portionof the route beyond the predetermined thresholdto the destination positionusing a second routing method to further calculate the route to the destination position

System and method of generating a route across an electronic map

A method of creating map data, including search acceleration data arranged to increase the speed at which a route can be planned across an electronic map, which comprises a plurality of navigable segments, representing segments of a navigable route in the area covered by the map, wherein the method comprises: a) processing the navigable segments in order to generate the search acceleration data for at least some of, and generally each of, the navigable segments of the electronic map indicating whether that navigable segment is part of a minimum cost route; and b) processing the generated search acceleration data in order to compress that data wherein the compression includes computing the correlation of pairs of bits in the search acceleration data and coalescing correlated bits.

A method of creating map data including search acceleration data arranged to increase the speed at which a route can be planned across an electronic map comprising a plurality of navigable segments, each navigable segment representing a segment of a navigable route in the area covered by the map.

Growing community of inventors

Berlin, Germany

Andreas Profous