Encoded representation of traffic data

• US 9,863,780 B2
• Filed: 09/30/2012
• Issued: 01/09/2018
• Est. Priority Date: 06/10/2012
• Status: Active Grant

• Current Assignee: Apple Inc.
• Original Assignee: Apple Inc.
• Inventors: Prestor, Uros, McCabe, J. Paul
• Primary Examiner(s): Beaulieu, Yonel
• Assistant Examiner(s): WEEKS, MARTIN A
• Application Number:
  US13/632,090
• Publication Number:
  US 20130332058A1
• Time in Patent Office: 1,927 Days
• Field of Search: 701117-118
• CPC Class Codes: G01C 21/3626 Details of the output of route guidance instructions traffic control systems for road vehicles involving transmission of navigation instructions to the vehicle G08G1/0968
• CPC Class Codes: G01C 21/367 Details, e.g. road map scale, orientation, zooming, illumination, level of detail, scrolling of road map or positioning of current position marker
• CPC Class Codes: G01C 21/3676 Overview of the route on the road map
• CPC Class Codes: G01C 21/3694 Output thereof on a road map
• CPC Class Codes: G06Q 10/047 Optimisation of routes or paths, e.g. travelling salesman problem
• CPC Class Codes: G06T 17/05 Geographic models
• CPC Class Codes: G06T 17/20 Finite element generation, e.g. wire-frame surface description, tesselation
• CPC Class Codes: G06T 2200/24 involving graphical user interfaces [GUIs]
• CPC Class Codes: G08G 1/0962 having an indicator mounted inside the vehicle, e.g. giving voice messages
• CPC Class Codes: G08G 1/0967 Systems involving transmission of highway information, e.g. weather, speed limits transmission of navigation instructions to the vehicle G08G1/0968
• CPC Class Codes: G08G 1/096716 where the received information does not generate an automatic action on the vehicle control
• CPC Class Codes: G08G 1/096741 where the source of the transmitted information selects which information to transmit to each vehicle
• CPC Class Codes: G08G 1/096775 where the origin of the information is a central station
• CPC Class Codes: G08G 1/096816 where the complete route is transmitted to the vehicle at once
• CPC Class Codes: G08G 1/096827 where the route is computed onboard
• CPC Class Codes: G08G 1/096861 where the immediate route instructions are output to the driver, e.g. arrow signs for next turn

Abstract

A mapping program for execution by at least one processing unit of a device is described. The mapping program selects a traffic segment defined in a first data structure describing congestion in an area of a map. The mapping program identifies a portion of a road in the map area that corresponds to the traffic segment by using a second data structure to correlate the traffic segment in the first data structure to the road that is defined in a third data structure. The mapping program defines a traffic congestion representation to render for the identified road portion, based on data about the corresponding road in the third data structure.

Claims

1. A non-transitory machine readable medium storing a mapping program for execution by at least one processing unit, the program comprising sets of instructions for:

in a first data structure that defines traffic segments for an area of a map for display, selecting a particular traffic segment;

in a second data structure that defines a plurality of roads in the map area, identifying a portion of a road in the map area that corresponds to the particular traffic segment, said identifying comprising using a third data structure that stores linking data to correlate the particular traffic segment that is defined in the first data structure to the road portion that is defined in the second data structure; and

rendering the particular traffic segment on the map with the identified road portion.

2. The non-transitory machine readable medium of claim 1, wherein the first data structure further defines traffic congestion for each traffic segment, wherein the set of instructions for rendering the particular traffic segment comprises a set of instructions for generating a traffic congestion representation on the map along the identified road portion by using traffic congestion that is defined in the first data structure for the particular traffic segment.

3. The non-transitory machine readable medium of claim 2, wherein the set of instructions for rendering the particular traffic segment further comprises a set of instructions for using a definition of the road portion in the second data structure to generate the traffic congestion representation.

4. The non-transitory machine readable medium of claim 3, wherein the set of instructions for using the definition of the road portion comprises a set of instructions for using the road portion definition to generate the traffic congestion representation to run parallel to said identified road portion.

5. The non-transitory machine readable medium of claim 4, wherein the program further comprises a set of instructions for determining that the map is being displayed at a particular zoom level that will result in the identified road portion being too narrow for the traffic congestion representation to be laid over the identified road portion.

6. The non-transitory machine readable medium of claim 5,

wherein the program further comprises a set of instructions for changing the zoom level to make the road portion wider or narrower,

wherein the set of instructions for using the definition of the road portion comprises a set of instructions for using the road portion definition to generate the traffic congestion representation to lie over said identified road portion when the zoom level changes and makes the road portion wide enough for placing the traffic congestion representation over the identified road portion.

7. The non-transitory machine readable medium of claim 3, wherein the set of instructions for using the road portion definition comprises a set of instructions for using the road portion definition to generate the traffic congestion representation to lie over said identified road portion.

8. The non-transitory machine readable medium of claim 1, wherein the program further comprises sets of instructions for:

receiving the first data structure that defines the traffic segments, the second data structure that defines the plurality of roads, and the third data structure that links the traffic segments defined in the first data structure to the roads defined in the second data structure; and

iteratively performing the selecting, identifying and rendering operations for each of the traffic segments in the first data structure in order to generate traffic representations for the selected traffic segments.

9. The non-transitory machine readable medium of claim 8, wherein the set of instructions for receiving the data structures comprises sets of instructions for identifying a particular view of the map for rendering and identifying at least one data structure that describes at least one map feature needed for the particular view.

10. The non-transitory machine readable medium of claim 9,

wherein the identified data structure is the second data structure that defines the roads,

wherein the set of instructions for identifying at least one data structure comprises a set of instructions for identifying all data structures that describe all features in the map that are needed to generate the particular view of the map.

11. The non-transitory machine readable medium of claim 1, wherein the program further comprises sets of instructions for:

defining a virtual camera to represent a particular view of the map for rendering; and

specifying at least the identified portion of the road as a feature to render in the particular view along with a traffic congestion representation before concurrently rendering the identified road portion and the traffic congestion representation.

12. The non-transitory machine readable medium of claim 11,

wherein the program further comprises a set of instructions for defining a three-dimensional (3D) scene that contains the identified road portion and the traffic congestion representation,

wherein the virtual camera defines a particular perspective view in the 3D scene.

13. The non-transitory machine readable medium of claim 1,

wherein the first data structure further defines traffic congestion for different portions of each traffic segment;

wherein the set of instructions for selecting the particular traffic segment comprises a set of instructions for selecting, from the first data structure, a portion of the particular traffic segment;

wherein the set of instructions for identifying the road portion comprises a set of instructions for using the data stored in the third data structure to correlate the selected portion of the particular traffic segment to the road portion; and

wherein the set of instructions for rendering the particular traffic segment comprises a set of instructions for generating a traffic congestion representation for the selected portion of the particular traffic segment based on the traffic congestion defined in the first data structure, the correlation data stored in the third data structure, and the road defined in the second data structure.

14. The non-transitory machine readable medium of claim 13, wherein the first data structure further defines a color value that specifies a color for each traffic congestion.

15. The non-transitory machine readable medium of claim 14, wherein the set of instructions for generating the traffic congestion representation for the selected portion of the particular traffic segment comprises a set of instructions for rendering the selected portion in a particular color by using a color value that is defined in the first data structure for the selected portion.

16. A method of defining traffic along roads in a map, the method comprising:

identifying, by a computer, a plurality of traffic segments for a plurality of roads;

identifying different groupings of the traffic segments; and

for each group of traffic segments, defining a traffic tile that stores data that specify the traffic segments of the group and traffic congestion along the traffic segments of the group, said traffic segments data in the traffic tile linked to road data stored in a road tile through linking data stored in a linking tile.

17. The method of claim 16 further comprising:

from a set of sources, obtaining traffic congestion data for the plurality of roads; and

specifying traffic congestion along the traffic segments based on the obtained data.

18. The method of claim 16 further comprising:

dynamically obtaining traffic congestion data for the plurality of roads; and

dynamically updating the traffic tiles based on the dynamically obtained traffic congestion data.

19. The method of claim 16 further comprising defining a traffic congestion representation along a road based on data stored in the traffic tile and data stored in the road tile.

20. The method of claim 16,

wherein each linking tile stores linking data for each traffic segment in the group in terms of (i) data that identify a road corresponding to the traffic segment and (ii) positional data that express a location of the traffic segment along the road;

said road and positional data allowing for displaying a representation of the traffic congestion along the road.

21. The method of claim 20,

wherein for a particular traffic segment, a representation of the traffic congestion is displayed along a portion of the road corresponding to the particular traffic segment when there is a threshold amount of traffic congestion along the particular traffic segment;

wherein the traffic congestion data for the particular traffic segment specify whether the threshold amount of traffic congestion exists along the particular traffic segment.

22. The method of claim 21, wherein the threshold amount specifies moderate traffic congestion or heavy traffic congestion.

23. The method of claim 16, wherein traffic tiles are dynamic tiles that are updated frequently, while road and linking tiles are static tiles that are not updated or updated less frequently than the dynamic traffic tiles.

24. A computer-implemented method of illustrating traffic congestion on a map, the method comprising:

receiving a plurality of traffic congestion data sets for a plurality of traffic segments; and

for each traffic segment;

identifying a portion of a road in an area of a map that corresponds to the traffic segment; and

based on a definition of the identified road portion and a traffic congestion data set received for the traffic segment, rendering a traffic congestion representation at different positions on the map relative to the identified road portion.

25. The computer-implemented method of claim 24 further comprising concurrently rendering each traffic congestion representation with its corresponding identified road portion.

26. The computer-implemented method of claim 24, wherein the rendering comprises rendering the traffic congestion representation to run parallel to the identified road portion.

27. The computer-implemented method of claim 24, wherein the rendering comprises rendering the traffic congestion representation to lie over the identified road portion.

28. The computer-implemented method of claim 24 further comprising:

defining a virtual camera to represent a particular view of the map for rendering;

specifying at least one particular portion of one particular road as a feature to render in the particular view along with the particular road portion'"'"'s traffic congestion representation; and

concurrently rendering the particular road portion and the particular road portion'"'"'s traffic congestion representation.

29. The computer-implemented method of claim 28 further comprising defining a three-dimensional (3D) scene that contains the particular road portion and the particular road portion'"'"'s traffic congestion representation, wherein the virtual camera defines a particular perspective view in the 3D scene.

30. The computer-implemented method of claim 24, wherein each traffic congestion data set comprises a value specifying a color for rendering a traffic representation.

31. A non-transitory machine readable medium storing a mapping program for execution by at least one processing unit, the program comprising sets of instructions for:

receiving road tiles specifying different roads in a map, traffic tiles specifying traffic congestion for different traffic segments along different roads, and linking tiles for associating the road and traffic tiles; and

for at least one particular traffic segment,

(i) using a particular traffic segment identifier in the particular traffic segment'"'"'s traffic tile to retrieve, from a linking tile, data that identify a road in a road tile and a position along the road; and

(ii) defining a representation of traffic congestion for the particular traffic segment by (1) using the identified road data and the positional data from the linking tile to identify a position of the traffic congestion representation, and (2) using traffic congestion data that the traffic tile stores for the particular traffic segment, to specify an appearance of the traffic congestion representation.

32. The non-transitory machine readable medium of claim 31, wherein the appearance of the traffic congestion representation comprises a color of a graphically rendered object that represents the traffic congestion.

33. The non-transitory machine readable medium of claim 32, wherein the graphically rendered object is a dashed line.

34. The non-transitory machine readable medium of claim 31, wherein the positional data in the linking tile is relative positional data that express a position of the particular traffic segment relative to a position of the identified road.