METHOD AND APPARATUS FOR USE IN NAVIGATIONAL APPLICATIONS

• US 20150354971A1
• Filed: 01/30/2013
• Published: 12/10/2015
• Est. Priority Date: 01/30/2013
• Status: Active Grant

• Current Assignee: HERE Global B.V. (HERE Holding Corporation)
• Original Assignee: HERE Global B.V. (HERE Holding Corporation)
• Inventors: Pfeifle, Martin
• Granted Patent: US 9,709,407 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G01C 21/26 specially adapted for navigation in a road network
• CPC Class Codes: G01C 21/32 Structuring or formatting of map data
• CPC Class Codes: G01C 21/3446 Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
• CPC Class Codes: G01C 21/3461 Preferred or disfavoured areas, e.g. dangerous zones, toll or emission zones, intersections, manoeuvre types, segments such as motorways, toll roads, ferries
• CPC Class Codes: G06F 16/00 Information retrieval; Database structures therefor; File system structures therefor
• CPC Class Codes: G06F 16/40 of multimedia data, e.g. slideshows comprising image and additional audio data retrieval of still image data G06F16/50; retrieval of audio data G06F16/60; retrieval of video data G06F16/70

Abstract

A method comprising providing or receiving updated information, previous and said updated information associated with a geographic region, said previous information comprising information about one or more links usable for connecting to one or more links in a different geographic region, and said updated information comprising at least said previous information and new Information about one or more links for connecting to one or more links in said different geographic region.

Claims

1-27. -27. (canceled)

28. A method comprising:

providing or receiving updated information, previous and said updated information associated with a geographic region, said previous information comprising information about one or more links usable for connecting to one or more links in a different geographic region, and said updated information comprising at least said previous information and new information about one or more links for connecting to one or more links in said different geographic region.

29. The method as claimed in claim 28, wherein said providing comprises:

computing a rank for each link of said geographic region usable for connecting to one or more links of said different geographic region;

determining for said each link if said computed rank has a lower importance than a previous computed rank for said link; and

if so, retaining the previous computed rank as the rank for said link.

30. The method as claimed in claim 28, comprising storing said updated information for said geographic region in association with map information for said geographic region.

31. The method as claimed in claim 28, wherein a geographic area is divided into at least said geographic region and said different geographic region, wherein said geographic region and said different geographic region are adjacent to each other and each of said geographic region and said different geographic region comprise at least one respective link usable to form a route between a first location in said geographic region and a second location in said different geographic region.

32. The method as claimed in claim 28, further comprising:

using said updated information when determining a route between said geographic region and said different region or between a first location in said geographic region and a second location in said different region.

33. The method as claimed in claim 28, wherein said new information is in respect of one or more links different to those of said previous information and/or one or more links of the previous information where said one or more links of the previous information has changed.

34. The method as claimed in claim 28, wherein said previous and updated information comprise edge flag information.

35. The method as claimed in claim 28, wherein said previous information and said updated information comprises a vector indicating if said link is a desired path to a respective node of respective partitions of a region.

36. The method as claimed in claim 35, wherein said previous information comprises a previous vector and said updated information comprises a updated vector, each value of said updated vector being one of the same or changed with respect to said previous vector to a value representing a higher ranking.

37. The method as claimed in claim 28, wherein said previous information and said updated information comprises link hierarchy information.

38. The method as claimed in claim 37, wherein said updated information is in a first link level and said previous information is retained in said first link level.

39. The method as claimed in claim 28, wherein each of said links has a link class associated therewith.

40. The method as claimed in claim 28, further comprising:

applying a cost function to one or more of said links.

41. The method as claimed in claim 40, wherein said cost function is dependent on one or more of length associated with said link, speed associated with said link and one or more attributes of said link.

42. The method as claimed in claim 28, further comprising:

storing said previous information, compiling update region information for said region when said update region information has been updated and storing first information associated with said compilation, and providing said updated information from said previous information and said first information.

43. The method as claimed in claim 42, further comprising:

carrying out an OR operation in respect of said previous and first information to provide said updated information.

44. The method as claimed in claim 42, wherein said updated information comprises said previous information and said first information.

45. An apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to provide or receive updated information, previous and said updated information associated with a geographic region, said previous information comprising information about one or more links usable for connecting to one or more links in a different geographic region, and said updated information comprising at least said previous information and new information about one or more links for connecting to one or more links in said different geographic region.

46. The apparatus as claimed in claim 45, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to compute a rank for each link of said geographic region usable for connecting to one or more links of said different geographic region, determine for said each link if said computed rank has a lower importance than a previous computed rank for said link and if so, retain the previous computed rank as the rank for said link.

47. The apparatus as claimed in claim 45, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to store said updated information for said geographic area in association with map information for said geographic area.