1. Field
This disclosure relates to providing traffic information of a road, particularly, information relating to the road.
2. Description of the Related Art
With the advancement in digital signal processing and communication technologies, radio and TV broadcasts are being digitalized. Digital broadcasting enables provision of various information (e.g., news, stock prices, weather, traffic information, etc.) as well as audio and video content.
In one general aspect, a method of processing traffic information is provided. The method includes receiving link vertex information including a first identifier and vertex components that each reveal a position along a link. The first identifier enables a determination of a type of information that is included within the received link vertex information. The method also includes determining the type of information included within the received link vertex information based on the first identifier and identifying vertex components within the link vertex information only if the first identifier enables a determination that the received link vertex information includes at least one vertex component.
Implementations may include one or more additional features. For instance, receiving link vertex information may include receiving an indicator of a number of vertex components that are specified by the link vertex information. The number of vertex components included in the link vertex information may correspond to the number of vertex components indicated by the indicator. The received indicator may specify that the link vertex information includes only one vertice, and the identified vertex component consists of a single vertex component that reveals a single position along the link other than a start point and end point. The received indicator may specify that the link vertex information includes more than one vertice, and the identified vertex component includes multiple vertex components that correspondingly reveal multiple positions along the link other than start point and end point of the link. The identified vertex components may each be associated with a sequence value configured to order the vertex components along the link. Receiving link vertex information may include receiving the sequence value.
The method may also include receiving information corresponding to a message management structure including information corresponding to a generation time of information reflected in the link vertex information. The generation time included within the received message management structure may relate to a plurality of vertex components. The generation time included within the received message management structure may relate to a plurality of message component structures that correspond to a vertex component. Each message component structure may further include an identifier specific to the type of information included in the message management structure and the first identifier may be an identifier, in a message component structure, specifying the inclusion of a vertex component. The vertex component may include, for each vertex component, a sequence value configured to order the vertex components along the link.
In the method, the vertex component may identify a longitude and latitude associated with a position along a link other than a start point and an end point. The vertex component may include a text descriptor associated with the vertex component. Receiving link vertex information may include decoding the link vertex information such that the received link vertex information is decoded link vertex information. Receiving link vertex information may include identifying a longitude of the vertex position information and identifying a latitude of the vertex position. The processing device may be configured to determine link vertex information is configured to determine a vertex position from information other than longitude, latitude, or sequence. The position may be a position along the link other than a start point or an end point of the link.
In another general aspect, a traffic information communication device is provided. The device includes a data receiving interface configured to receive link vertex information including a link vertex identifier that identifies the received information as including at least one vertex component. The data receiving interface also includes an indication of a number of vertex components that are specified by the link vertex information and a number of vertex components corresponding to the indication. At least one of the vertex components includes a vertex component identifier that identifies the vertex component as a single one of the vertex components included within the link vertex information, vertex position information identifying a position of a vertex specified by the vertex component as including a position along a link. The device also includes a processing device configured to process the link vertex information received from the data receiving interface. The process includes determining a type of information included within the received link vertex information and identifying a vertex position specified by the vertex components based on the received information.
Implementations may include one or more additional features. For instance, the vertex position information may indicate a position along a path other than the shortest path between the endpoints of the link. The link vertex identifier may reflect that a single vertex is specified by the link vertex information, and the number of vertex components correspondingly include a single vertex component. The vertex position information may correspond to at least a two-dimensional position where at least one positional dimension corresponds to time.
In the device, a set of values may corresponding to the first dimension may be a function of a set of values corresponding to time. The vertex position information may correspond to more than a two-dimensional position. One dimension may be associated with elevation. The processing device may be configured to decode information identifying a longitude of the vertex position and information identifying a latitude of the vertex position.
Also, in the device, the link vertex information may include a data length of information used to reveal the vertex position along the link. The processing device may be configured to determine a vertex position from information other than longitude, latitude, or sequence. The processing device may be configured to receive link vertex information including information corresponding to a version number of information reflected in the link vertex information. The version number may be associated with a specific syntax of the data where any one of multiple syntaxes may be used.
The processing device may be further configured to receive information corresponding to a message management structure including information corresponding to a generation time of information reflected in the link vertex information. The positions may be a position along the link other than a start point or an end point of the link. The processing device may be configured to determine the type of information included within the received link vertex information based on the link vertex identifier and the vertex component identifier. The processing device may be configured to identify the vertex position only if the link vertex identifier and the vertex component identifier enable a determination that the received link vertex information includes at least one vertex component
In a further general aspect, a method of processing traffic information is provided. The method includes means for receiving link vertex information including a first identifier and vertex components that each reveal a position along a link. The first identifier enables a determination of a type of information that is included within the received link vertex information. The method also includes means for determining the type of information included within the received link vertex information based on the first identifier and means for identifying vertex components within the link vertex information only if the first identifier enables a determination that the received link vertex information includes at least one vertex component.
The details of one or more implementations are set forth in the accompanying drawings and the description below. Other features will be apparent from the description and drawings, and from the claims.
One such use for digital broadcasts is to satisfy an existing demand for traffic information. Proposals that involve the use of digital broadcasts for this purpose contemplate the use of standardized formatting of traffic information to be broadcast. This approach may be used to enable the use of traffic information receiving terminals made by different manufacturers, which each could be configured to detect and interpret traffic information broadcast in the same way.
The congestion traffic information broadcast by the traffic information providing server 100 via radio waves may be transmitted as a component frame. The component frame, as shown in
In various implementations, one message segment of the sequence 202, that is, the TPEG-CTT message may comprise a message management container carrying information relating to date, time, and message generation time, a CTT container, and a TPEG-CTT location container, as shown in
In various implementations, if a CTT component includes traffic flow information, the CTT component has an identifier (ID) of 0×80 as shown in
In various implementations, if a CTT component includes link location information, the CTT component has an ID of 0×09 as shown in
The information on load shape may be organized and transmitted, for example, in the form of
The server 100 may reconfigure current road congestion information, as shown in
In one implementation, when the traffic information about each road link is provided, the traffic information receiving terminal may search a corresponding road section (hereafter, referred to as a “section” or a “link”) on its held electronic map and may represent the received traffic information using color, graphic, or text. If the traffic information receiving terminal is without an electronic map, such that it cannot represent the received traffic information on such an electronic map, it may nevertheless represent the received traffic information using graphic or text. Specifically, the graphical representation may present the road as a linear form regardless of the actual type.
According to an implementation, the server 100 may aggregate and may provide the traffic information relating to, for example, a new building, a shut-down road, or route or area, or a path change of the roads (hereafter, referred to as a road change), to a traffic information receiving terminal. In addition, the information about road shape may also provided for a traffic information receiving terminal not equipped with electronic map. Thus the system is capable of informing a user when a new road is configured, and/or an existing road is reconfigured to change its shape and/or shut down, such as, for example, due to construction.
In the following, an implementation of method of providing the road change or road shape information is explained in detail.
To provide the road change or road shape information, the server 100 may generate a road information component 300 Link_info_component configured as shown in
Each road information component
Link_info_component, as shown in
In various implementations, the link shape sub-component 301 has an ID of 0×00 and comprises an ID of the link, the number of link vertices, information relating to the vertices, and a name assigned to the link. The vertex is information consisting of a pair of latitude and longitude which may be defined, for example, in the WGS 84 format, so that the traffic information receiving terminal may recognize the shape of the link and display the graphical representation according to the recognized shape. The link shape sub-component 301 may be provided to help the traffic information receiving terminal including no electronic map to represent a more accurate shape of the road based on the current location on the screen. Thus, the number of the vertices included in the link shape sub-component 301 may be enough to reveal the shape of the road when the road is presented according to the VGA or the QVGA on a scale lower than the precision of the electronic map supplied from a disk medium, for example, on a reduced scale of 1 to 10000.
The link creation sub-component 302 has 0×01 as its ID and may comprise an ID of the link to be newly assigned, the number of link vertices, information relating to the vertices, and the number assigned to the link. The link creation sub-component 302 may be generated and provided when a road link is newly built.
The link change sub-component 303 has 0×02 as its ID and may comprise an ID of the link, the number of link vertices, and information relating to the vertices. The link change sub-component 303 may be generated and provided when the shape of an existing road link is changed, for example, when the road shape is changed by linearizing the curved section. Since the link change sub-component 303 may provide information relating to the shape change of the existing road link, the same link ID as previously assigned to the link may be utilized and the sub-component 303 need not include a link name.
The link elimination sub-component 304 has 0×03 as its ID. In
The server 100 may configure the current congestion traffic information, as shown in
In various implementations, after transmitting the information relating to the road change, traffic flow information, such as average speed, link travel-time, congestion type, and so on, relating to the new road link and the changed road link, is transmitted in the same manner as other links.
In various implementations, the information on link shape provided through the aforementioned link shape sub-component 301, may be provided for a terminal in different manner. For example, the vertex information about link shape may be carried by the aforementioned coordinates component as shown in
Coordinates information describing road shape may be transmitted in a vertex component as shown in
In the implementation of
In
The tuner 1 tunes the signal received at the server 100. The modulator 2 demodulates and outputs the tuned signal according to a preset scheme. Next, the TPEG-CTT decoder 3 extracts the TPEG message, as shown in
The TPEG-CTT decoder 3 extracts the date/time, and the message generation time in the message management container of the TPEG message and checks whether a subsequent container is a CTT event container based on the information of a ‘message element’ (i.e. an identifier). When the subsequent container is the CTT event container, the information acquired from the CTT container in the CTT event container is provided so that the navigation engine 5 may perform the display operation according to the traffic flow information and the road information, to be explained below. Providing the navigation engine 250 with the information may include determining, based on identifiers, that the traffic information includes a message management container including status or vertex information within various message components within the message management container. The components may each include different status or vertex information associated with different links or locations and identifiers associated with the different status or vertex information. The containers and components may each include information associated with a generation time, version number, data length, and identifiers of included information.
Location information corresponding to current traffic flow information is acquired from the subsequent TPEG-CTT location container. This location information may include location coordinates such as longitude and latitude of a start point and an end point according to the type information of the TPEG-CTT location container, or the link, i.e., the link ID assigned to the road link. If a storage structure 4 is equipped, a link corresponding to the received information may be specified based on the information relating to the links and the nodes stored in the storage structure 4. The navigation engine 5 may convert the location coordinates of the received link to the link ID or vice versa.
In the implementation of
In the implementation of
If the storage structure 4 does not store the electronic map, the navigation engine 5 may store the information of the received link shape sub-components in the link information table, as shown in
When the electronic map is embedded in the storage structure 4, the navigation engine 5 may read out a necessary area (an area around the current location) on the electronic map based the current location coordinates received from the GPS module 8 and displays the area on the LCD panel 7 via the LCD drive 6. In doing so, the place corresponding to the current location may be marked by a specific graphic symbol. When the storage structure 4 does not have the electronic map, the navigation engine 5 may control the LCD drive 6 to display the road shape as the graphical presentation on the LCD panel 7 according to the vertex information with respect to the links belonging to the area around the current location in the link information table stored in the memory 5a as show in
If the detected sub-components are link creation sub-components including the ID of 0×01 or link change sub-components including the ID of 0×02, the navigation engine 5 may store the information which is included in the sub-components and received from the TPEG-CTT decoder 3, in the link information table as constructed in
If the detected sub-components are link elimination components including the ID of 0×03, the TPEG-CTT decoder 3 may request the navigation engine 5 to issue an elimination request command of the link including the ID identical to the link ID of the sub-components. When the electronic map is not provided, the navigation engine 5 may control deletion of the entry of the corresponding link from the link information table in the memory 5a. When the electronic map is provided, the navigation engine 5 may search an entry including the corresponding link ID in the link information table of the memory 5a. If such an entry is discovered, the entry may be deleted from the link information table of
The navigation engine 5 controls the display of the traffic flow information received from the TPEG-CTT decoder 3, e.g., the link average speed or the link average travel-time in the displayed area according to the location coordinates of the link ID included in the coordinates component corresponding to the status component which carries the traffic flow information, within the subsequent location container. The link corresponding to the location coordinates or the link ID received in the location container may be retrieved from the memory 5a. When the storing structure 4 stores the electronic map and the corresponding link is not discovered in the memory 5a, the retrieval in the storage structure 4 may be conducted. In case of the terminal including the electronic map, since entries of the link information table stored in the memory 5a may be first retrieved, the link including the information based on the latest road conditions may be specified earlier than the electronic map of the storage map 4.
As such, the new link or the changed link and the general link may be specified. The traffic flow information as to the specified link is acquired from the corresponding status component with the CTT component which carries the traffic information and has the ID of 0×80 as mentioned above.
The navigation engine 5 may display the traffic flow information, e.g., the average speed on the path by changing a color according to the link average speed as shown in
Referring to
Meanwhile, in case that the navigation engine 5 has a path search function with respect to the destination, it is possible to automatically search or re-search a desired path based on the received link average speed or link average travel-time when the user's request is specified or the destination is designated. A terminal without the electronic map may determine and may display the path on the screen based on the links in the link information table registered to the memory 5a and the received traffic flow information relating to the links. Note that the received traffic flow information of the links may be stored in the memory 5a until it is updated by the next traffic flow information. A terminal with the electronic map may determine a path based on the traffic flow information relating to the links of the link information table registered in the memory 5a and the traffic flow information relating to the link information on the electronic map of the storage structure 4. As for a link including the same link ID, the link in the link information table may be selected. Next, a determination may be made whether the links along the selected path are organized in the deleted link table of the memory 5a. When they are not in the deleted link table, the selected path may be confirmed. Otherwise, when the links along the selected path are in the deleted link table, a partial path including the links may be excluded and the whole path may be determined by conducting the re-search in relation to the partial path. As a result, the determined path may be displayed on the map of the screen.
If the terminal of
The foregoing description has been presented for purposes of illustration. Thus, various implementations with improvements, modifications, substitutions, or additions within the spirit and scope as defined by the following appended claims.
Number | Date | Country | Kind |
---|---|---|---|
10-2005-0101414 | Oct 2005 | KR | national |
10-2006-0023213 | Mar 2006 | KR | national |
The present application claims priority from U.S. provisional application Nos. 60/681,971 filed May 18, 2005, which is titled “Traffic information signal and method and apparatus for providing the signal,” and 60/759,963 filed Jan. 19, 2006, which is titled “Traffic information providing method,” the entire contents of which are incorporated herein by reference. The present application also claims priority from Korean application Nos. 10-2005-0101414 filed Oct. 26, 2005, and 10-2006-0023213 filed, Mar. 13, 2006, the entire contents of which are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
4907159 | Mauge et al. | Mar 1990 | A |
5649297 | Park | Jul 1997 | A |
5662109 | Hutson | Sep 1997 | A |
5933100 | Golding | Aug 1999 | A |
6067499 | Yagyu et al. | May 2000 | A |
6067502 | Hayashida et al. | May 2000 | A |
6075467 | Ninagawa | Jun 2000 | A |
6085137 | Aruga et al. | Jul 2000 | A |
6101443 | Kato et al. | Aug 2000 | A |
6115667 | Nakamura | Sep 2000 | A |
6125323 | Nimura et al. | Sep 2000 | A |
6128571 | Ito et al. | Oct 2000 | A |
6232917 | Baumer | May 2001 | B1 |
6236933 | Lang | May 2001 | B1 |
6324466 | Vieweg | Nov 2001 | B1 |
6401027 | Xu | Jun 2002 | B1 |
6434477 | Goss et al. | Aug 2002 | B1 |
6438490 | Ohta | Aug 2002 | B2 |
6438561 | Israni | Aug 2002 | B1 |
6453230 | Geurts | Sep 2002 | B1 |
6477459 | Wunderlich | Nov 2002 | B1 |
6594576 | Fan et al. | Jul 2003 | B2 |
6597982 | Schmidt | Jul 2003 | B1 |
6610321 | Huang et al. | Aug 2003 | B2 |
6611749 | Berwanger | Aug 2003 | B1 |
6615133 | Moskowitz et al. | Sep 2003 | B2 |
6618667 | Berwanger et al. | Sep 2003 | B1 |
6633808 | Schulz et al. | Oct 2003 | B1 |
6687611 | Hessing et al. | Feb 2004 | B1 |
6741932 | Groth et al. | May 2004 | B1 |
6810321 | Cook | Oct 2004 | B1 |
6873904 | Yamamoto et al. | Mar 2005 | B2 |
6904362 | Nakashima et al. | Jun 2005 | B2 |
6924751 | Hempel et al. | Aug 2005 | B2 |
6970132 | Spilker, Jr. | Nov 2005 | B2 |
6990407 | Mbekeani et al. | Jan 2006 | B1 |
6995769 | Ordentlich et al. | Feb 2006 | B2 |
6996089 | Ruf et al. | Feb 2006 | B1 |
7013983 | Matsumoto et al. | Mar 2006 | B2 |
7047247 | Petzold et al. | May 2006 | B1 |
7106219 | Pearce | Sep 2006 | B2 |
7139467 | Seo et al. | Nov 2006 | B2 |
7139659 | Mbekeani et al. | Nov 2006 | B2 |
7188025 | Hudson | Mar 2007 | B2 |
7251558 | McGrath | Jul 2007 | B1 |
7269503 | McGrath | Sep 2007 | B2 |
7319931 | Uyeki et al. | Jan 2008 | B2 |
7355528 | Yamane et al. | Apr 2008 | B2 |
7373247 | Park | May 2008 | B2 |
7375649 | Gueziec | May 2008 | B2 |
7403852 | Mikuriya et al. | Jul 2008 | B2 |
7609176 | Yamane et al. | Oct 2009 | B2 |
7650227 | Kirk et al. | Jan 2010 | B2 |
7657372 | Adachi et al. | Feb 2010 | B2 |
7668209 | Kim et al. | Feb 2010 | B2 |
7701850 | Kim et al. | Apr 2010 | B2 |
7729335 | Lee et al. | Jun 2010 | B2 |
7739037 | Sumizawa et al. | Jun 2010 | B2 |
7825825 | Park | Nov 2010 | B2 |
7877203 | Mikuriya et al. | Jan 2011 | B2 |
7907590 | Lee et al. | Mar 2011 | B2 |
7940741 | Lee et al. | May 2011 | B2 |
7940742 | Lee et al. | May 2011 | B2 |
20010028314 | Hessing et al. | Oct 2001 | A1 |
20030036824 | Kuroda et al. | Feb 2003 | A1 |
20030083813 | Park | May 2003 | A1 |
20030102986 | Hempel et al. | Jun 2003 | A1 |
20030179110 | Kato | Sep 2003 | A1 |
20040148092 | Kim et al. | Jul 2004 | A1 |
20040198339 | Martin | Oct 2004 | A1 |
20040246888 | Peron | Dec 2004 | A1 |
20040249560 | Kim et al. | Dec 2004 | A1 |
20050027437 | Takenaga et al. | Feb 2005 | A1 |
20050038596 | Yang et al. | Feb 2005 | A1 |
20050081240 | Kim | Apr 2005 | A1 |
20050107944 | Hovestadt et al. | May 2005 | A1 |
20050141428 | Ishikawa | Jun 2005 | A1 |
20050143906 | Ishikawa et al. | Jun 2005 | A1 |
20050198133 | Karaki | Sep 2005 | A1 |
20050206534 | Yamane | Sep 2005 | A1 |
20050209772 | Yoshikawa | Sep 2005 | A1 |
20050231393 | Berger | Oct 2005 | A1 |
20060139234 | Tanaka | Jun 2006 | A1 |
20060143009 | Jost et al. | Jun 2006 | A1 |
20060173841 | Bill | Aug 2006 | A1 |
20060178105 | Kim | Aug 2006 | A1 |
20060178807 | Kato et al. | Aug 2006 | A1 |
20060262662 | Jung et al. | Nov 2006 | A1 |
20060265118 | Lee et al. | Nov 2006 | A1 |
20060268721 | Lee et al. | Nov 2006 | A1 |
20060268736 | Lee et al. | Nov 2006 | A1 |
20060268737 | Lee et al. | Nov 2006 | A1 |
20060271273 | Lee et al. | Nov 2006 | A1 |
20060281444 | Jung | Dec 2006 | A1 |
20070005795 | Gonzalez | Jan 2007 | A1 |
20070019562 | Kim et al. | Jan 2007 | A1 |
20070122116 | Seo et al. | May 2007 | A1 |
20070167172 | Kim et al. | Jul 2007 | A1 |
20090125219 | Lee et al. | May 2009 | A1 |
Number | Date | Country |
---|---|---|
19733179 | Feb 1998 | DE |
197 33 179 | May 1998 | DE |
100 60 599 | Jun 2002 | DE |
101 01 349 | Aug 2002 | DE |
0 725 500 | Aug 1996 | EP |
1 041 755 | Feb 2000 | EP |
1 006 684 | Jun 2000 | EP |
1 030 475 | Aug 2000 | EP |
1 079 353 | Feb 2001 | EP |
1 376 512 | Jun 2003 | EP |
1 445 750 | Nov 2003 | EP |
1 460 599 | Nov 2003 | EP |
1150265 | Oct 2006 | EP |
1 049 277 | Feb 2007 | EP |
2 342 260 | Apr 2000 | GB |
09-062884 | Mar 1997 | JP |
11-160081 | Jun 1999 | JP |
2001-082967 | Mar 2001 | JP |
2001-272246 | Oct 2001 | JP |
2004-164373 | Jun 2004 | JP |
2004-186741 | Jul 2004 | JP |
2004-295736 | Oct 2004 | JP |
2004-355662 | Dec 2004 | JP |
2005-056061 | Mar 2005 | JP |
10-1999-0025959 | Apr 1999 | KR |
1019990068262 | Sep 1999 | KR |
10-2001-0016252 | Mar 2001 | KR |
10-2003-0034915 | Oct 2001 | KR |
10-2002-0017535 | Mar 2002 | KR |
10-2003-0037455 | May 2003 | KR |
10-2004-0033141 | Apr 2004 | KR |
10-2004-0084374 | Oct 2004 | KR |
10-2004-0084508 | Oct 2004 | KR |
10-2005-0037776 | Apr 2005 | KR |
10-2005-0062320 | Jun 2005 | KR |
10-2006-0002468 | Jan 2006 | KR |
100565089 | Mar 2006 | KR |
10-2006-0063563 | Jun 2006 | KR |
10-2006-0063629 | Jun 2006 | KR |
10-2006-0076574 | Jul 2006 | KR |
WO 9824079 | Jun 1998 | WO |
WO 9826395 | Jun 1998 | WO |
WO 9826396 | Jun 1998 | WO |
WO 9841959 | Sep 1998 | WO |
WO 0030058 | May 2000 | WO |
WO 0036771 | Jun 2000 | WO |
WO 0039774 | Jul 2000 | WO |
WO 0106478 | Jan 2001 | WO |
WO 0118767 | Mar 2001 | WO |
WO 0118768 | Mar 2001 | WO |
WO 0131497 | May 2001 | WO |
WO 0201532 | Jan 2002 | WO |
WO 0213161 | Feb 2002 | WO |
WO 02082402 | Oct 2002 | WO |
W02004036545 | Apr 2004 | WO |
WO 2005020576 | Mar 2005 | WO |
Number | Date | Country | |
---|---|---|---|
20060265118 A1 | Nov 2006 | US |
Number | Date | Country | |
---|---|---|---|
60681971 | May 2005 | US | |
60759963 | Jan 2006 | US |