Method for automatically deleting a traffic announcement

• US 6,999,872 B2
• Filed: 11/27/2001
• Issued: 02/14/2006
• Est. Priority Date: 12/08/2000
• Status: Expired due to Fees

• Current Assignee: Robert Bosch GmbH
• Original Assignee: Robert Bosch GmbH
• Inventors: Fabian, Thomas, Kreft, Peter
• Primary Examiner(s): NGUYEN, TAN QUANG
• Application Number:
  US10/450,923
• Publication Number:
  US 20040073362A1
• Time in Patent Office: 1,540 Days
• Field of Search: 701/210, 701/211, 701/208, 701/209, 340/905, 340/902, 340/995.13, 455/414.2, 455/414.3, 455/456.1, 455/456.2, 455/456.3
• US Class Current: 701/210
• 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/093 Data selection, e.g. prioritizing information, managing message queues, selecting the information to be output
• 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/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

To provide a method of automatically deleting a traffic message that is associated with at least one directed segment and/or at least one node, in which traffic messages are automatically deleted at the earliest possible time while ensuring that the route segment affected by the traffic message is not traveled again, the traffic message is deleted when the sum of the resistances remaining between the current position and the destination is less than or equal to a reference resistance which is determined by the sum of the resistances remaining between a reference segment and the destination, the reference segment being the segment subsequent to the segment of the route, in the direction toward the destination, that is affected by the traffic message and that was the route specified before the traffic message was taken into account.

Claims

1. A method of automatically deleting a traffic message that is associated with at at least one of least one directed segment and at least one node, comprising:

mapping a route network in a memory unit as the at least one directed segment and the at least one node situated between two of the at least one directed segment;

associating a specific resistance with at least one of the at least one segment and the at least one node in such a way that one of the following;

at least one of a resistance of one of the at least one segment affected by the traffic message and a resistance of one of the at least one node affected by the traffic message is increased, and

at least one of the segment affected by the traffic message and the node affected by the traffic message is blocked according to an infinite resistance; and

specifying a route being as a series of segments such that a sum of all resistances is minimum, wherein;

the traffic message is deleted when the sum of the resistances remaining between a current position and a destination is no more than a reference resistance that is determined by the sum of the resistances remaining between a reference segment and the destination, and

the reference segment corresponds to the segment subsequent to the segment of the route, in a direction toward the destination, that is affected by the traffic message and that was the route specified before the traffic message was taken into account.

2. The method as recited in claim 1, wherein:

the route network includes a road network.

3. The method as recited in claim 1, further comprising:

temporarily storing the reference resistance in the memory unit;

recalculating the sum of the resistances remaining between the current position and the destination;

comparing the sum of the resistances, remaining between the current position and the destination to the reference resistance; and

deleting the traffic message from the memory unit when the sum of the resistances remaining between the current position and the destination falls below the reference resistance.

4. The method as recited in claim 1, wherein:

the traffic message is associated with at least one traffic-related event corresponding to at least one of at least one blockage, at least one event of one of congested and stop-and-go traffic, and at least one traffic accident, and

the traffic message is triggered by the at least one traffic-related event.

5. The method as recited in claim 4, wherein:

the at least one traffic-related event, whose associated traffic message has not yet been deleted and in particular is being bypassed, or in particular has yet to be bypassed, is one of identified and flagged.

6. The method as recited in claim 5, wherein:

the traffic-related event is one of identified and flagged at least one of;

in the form of at least one list, and

in the form of at least one map, such as a route network.

7. The method as recited in claim 6, wherein:

the at least one map includes the route network.

8. The method as recited in claim 7, wherein:

the route network includes a road network.

9. The method as recited in claim 6, further comprising:

displaying at least one of the traffic-related event and the traffic message associated with the traffic-related event on one of at least one readout device and at least one display.

10. The method as recited in claim 1, further comprising:

downloading the traffic message directly to a navigation system using one of traffic telematics and an on-line service provider.

11. The method as recited in claim 10, wherein:

the traffic telematics includes one of GPRS (General Packet Radio Service), GSM (Global System for Mobile Communication), and UMTS (Universal Mobile Telecommunication System).

12. A navigation system for a motor vehicle, comprising:

at least one memory unit for mapping a route network as directed segments (k) and nodes situated between the directed segments; and

at least one computing unit for performing the following;

mapping the route network in the memory unit as the at least one directed segment and the at least one node situated between two of the at least one directed segment,

associating a specific resistance with at least one of the at least one segment and the at least one node in such a way that one of the following;

at least one of a resistance of one of the at least one segment affected by the traffic message and a resistance of one of the at least one node affected by the traffic message is increased, and

at least one of the segment affected by the traffic message and the node affected by the traffic message is blocked according to an infinite resistance, and specifying a route being as a series of segments such that a sum of all resistances is minimum, wherein;

the traffic message is deleted when the sum of the resistances remaining between a current position and a destination is no more than a reference resistance that is determined by the sum of the resistances remaining between a reference segment and the destination, and

the reference segment corresponds to the segment subsequent to the segment of the route, in a direction toward the destination, that is affected by the traffic message and that was the route specified before the traffic message was taken into account.

13. The navigation system as recited in claim 12, wherein:

the route network includes a road network.

14. The navigation system as recited in claim 12, further comprising:

one of at least one readout device and at least one display for displaying at least one of a traffic-related event and the traffic message associated with the traffic-related event.