DE102012210209A1 - Method for operating electronic navigation system, involves outputting data comprising suggested departure time dot, suggested route and prospective total travel duration to each route proposal - Google Patents

Abstract

The method (100) involves providing (20,21,22,23) data of a departure place, an arrival location, a desired departure time point or a desired departure time window, a latest possible arrival time point and a desired time of arrival window. A number of records for route portions is provided (26). The route proposal from the data is computed. The data comprising a suggested departure time dot, a suggested route and a prospective total travel duration is output (29) to each route proposal. Independent claims are included for the following: (1) electronic navigation system; (2) computer program product for operating electronic navigation system; and (3) machine-readable medium storing program for operating electronic navigation system.

Description

Technical area

The invention relates to a method for operating an electronic navigation system. The invention further relates to an electronic navigation system for carrying out this method.

State of the art

From the WO 2005/013063 A2 For example, a system and method for determining a recommended departure time are known. The described system and method determines the departure time required to meet a desired or punctual arrival time at a particular location on a particular route route, based on the evaluation of information on historical, current and predicted traffic and weather conditions, and road conditions ,

According to the WO 2005/013063 A2 This information is collected in the form of records from various sources in a server. A device for determining the expected currently achievable speed determines this speed for all road sections of a map. Upon request by the user is thus determined by a device for route determination, the best time route and the estimated start time when using this route. The user is informed by the system about the details of the route and the necessary departure time and reminded in good time of the departure time via electronic media.

The user also has the option of rejecting a suggested route, in which case a second route proposal is prepared and submitted. The system also checks at regular intervals whether the current development of traffic and weather conditions as well as road conditions significantly changes the predicted travel time. If this is the case, the user receives a message about a new departure time and / or a new route. This is also done after starting to travel, i. during the entire journey, ongoing on.

In the known system and method, the low flexibility is perceived as a disadvantage, in particular because it can be given no alternatives for determining only a single recommended departure time and the course of the proposed route and the desired course of the journey are influenced only very insufficient.

DESCRIPTION OF THE INVENTION: Problem, Solution, Advantages

The invention has the task to optimize the route planning in an electronic navigation system and to make it more flexible and thus avoid traffic congestion in particular.

This object is achieved in a method of the type mentioned by the following method steps: providing data of a departure location; Providing data of an arrival location; Providing data of a desired departure time or a desired departure time window, and / or providing data of a desired arrival time, in particular a latest possible arrival time and / or a desired time of arrival window; Providing a number of data sets for route sections, each route section being associated with a data set comprising traffic data; Calculating at least one route proposal from the data of the place of departure, the place of arrival, the desired departure time or desired departure time window and / or latest arrival time and / or arrival time window and the route section data sets; Outputting data for each route proposal, each comprising at least one proposed departure time, a proposed route, and an estimated total travel time.

In the method according to the invention, the data relating to the place of departure, the place of arrival, the desired departure time or the desired departure time window, the desired arrival time, in particular the latest possible arrival time, and / or the desired time of arrival window can be arbitrarily predefined by a user within wide limits. As default value, the current location can preferably be selected for the departure location, but can be changed by the user. Preferably, the method may also include the specification of a stored so-called favorite list of frequently selected departure locations. The destination is reentered for each calculation of the at least one route proposal or also selected from a favorite list of frequently selected destinations.

The invention advantageously allows a particularly flexible selection of the desired departure and arrival times. As a result, the user is not determined in the route planning to a certain period in which he wants to perform his journey, but can from the outset of the route planning based on a larger period of time. As a preset value for the input of the desired departure time or the desired departure time window, the current date and time may be provided; the same can basically be set up for the desired time of arrival or the desired time of arrival window.

For the calculation of the at least one route proposal, a number of data records are provided, preferably from a data carrier, wherein each data record is associated with a route section, preferably a road section on a map. Such a data record includes traffic data of the respective route section, as will be explained in more detail below.

The computation of a route proposal on the basis of the data compiled in the manner explained above can in itself from the WO 2005/013063 A2 done known manner. In accordance with the invention, an optimization of the calculated route proposal is additionally made possible since a longer time span is available for the route proposal instead of a preselected time of arrival, within which the most favorable route proposal can be selected. Preferably, an iteration process can be carried out for this purpose.

Advantageous embodiments of the invention are characterized in the subclaims.

A preferred further development of the method according to the invention is characterized by the method steps: provision of data of a desired trip duration, in particular a maximum allowable trip duration, and / or provision of data of a desired trip distance; Providing data of a desired stage pause duration; Calculating the at least one route proposal taking into account the data of the desired stage travel time and / or the desired distance route length and the desired distance pause duration.

The data for the travel time or route length and pause duration of the desired stages can advantageously be selected by a user. This allows the user to route planning involving targeted driving interrupts, e.g. for refueling stops, prescribed rest periods, for recreation or care especially children traveling along, etc. According to the instructions of the user, the at least one route proposal is divided into stages and included the desired pause periods in the total journey time. If minimum values and / or maximum values are specified for the travel duration or distance length and pause duration, e.g. also as range or remaining range of the vehicle on the basis of the current tank contents, preferably directly from an on-board computer, this results in an even greater flexibility in optimizing the route proposal.

In a further preferred embodiment of the method according to the invention, it is provided that the traffic data in the data sets for route sections contain data on existing properties of waypoints, in particular data on rest stops and / or gas stations, data on desired properties of at least one waypoint are provided and the at least one Route proposal is calculated taking into account a comparison of the data on the existing and the desired properties of the way points.

Route planning, taking into account stages, can be further optimized by checking that calculated milestones are checked to see if they meet the requirements specified by the user. To this end, data about desired properties of the milestones can be provided by the user. The user can e.g. specify via an operating menu, whether the milestones should have a gas station, a truck parking space, a baby changing room for the care of infants, a restaurant, a toilet, a shower or the like. These desired properties are compared in the route calculation with the traffic data. In the at least one route proposal only milestones are incorporated, in which the desired properties are actually present.

According to another embodiment of the method according to the invention, the traffic data in the data sets for route sections contain data about travel conditions in each individual route section, in particular about a traffic load and / or construction sites and / or weather conditions, and the at least one route proposal is calculated taking into account the data on the driving conditions ,

This makes an even more flexible adaptation of the route planning to the current conditions possible. Preferably, the data about the travel conditions at certain time intervals via eg Internet services or the like can be retrieved and these data are maintained in each case for updating in the records for the route sections. After each update, a new calculation of the at least one route proposal can be made.

According to another embodiment of the method according to the invention, at least the following is calculated after specification of the departure point, arrival point, desired departure time or desired departure time window and / or latest time of arrival and / or arrival time window: a first route proposal for an earliest desired departure time, a second route destination Route proposal for the latest possible time of arrival and a third route proposal as a result of optimizing at least one predetermined driving parameter, preferably the estimated total journey time and / or a total journey distance and / or a proposed distance travel time and / or a suggested distance route length and / or a proposed Staged pause duration and / or the characteristics of proposed milestones.

Depending on the current circumstances, the first, second and / or third route proposal may coincide. With these route suggestions the most important requirements of a user can be met in most cases well, the first proposal the need for the earliest possible start of the journey, the second proposal the need not to be late, and the third proposal the need for an optimal Route with eg lowest travel time, the least congestion, the lowest fuel consumption, etc. covers.

In the method according to the invention, data may additionally be provided which can be used by a user to set specifications for the route to be calculated, in particular the route course. In particular, it can be specified to calculate a route proposal for the most economical driving method on the basis of the driving conditions in each individual route section, or it can be e.g. a specific highway usage share for the proposed route to be calculated.

In another refinement, the method according to the invention comprises a recalculation and output of the at least one route proposal after a respective one of these time intervals repeatedly provided updated data of the departure / / arrival and / or the desired departure time or a desired departure time window and / or the desired time of arrival and / or the latest possible time of arrival and / or data sets for route sections, in particular traffic data concerning data on properties of waypoints and / or driving conditions in each individual route section, in particular a traffic load, construction sites and / or weather conditions.

In this way, it is advantageously also possible, during the journey, for a criteria selected by the user, i. e.g. the desired time of arrival, the desired characteristics of milestones, the desired motorway usage rate, etc., calculated route proposal is continually updated, i. changing driving conditions such as fluctuating traffic density, weather changes and the like can be flexibly adjusted. At any point in time, the user receives a currently optimal route suggestion.

The above object is further achieved by an electronic navigation system for performing the method in one of the above-described embodiments.

In addition, the object mentioned is achieved by a computer program product, comprising program parts for carrying out such a method, by a machine-readable, in particular computer-readable, data structure, generated by such a method, as well as a machine-readable, in particular computer-readable, data carrier on which at least one computer program product according to the above Art recorded and / or stored and / or on the at least one data structure according to the above type is kept ready for retrieval.

Brief description of the drawings

1 shows a flowchart of an embodiment of a method according to the invention, which will be described in more detail below.

Preferred embodiment of the invention

The embodiment of the method according to the invention 100 according to 1 points as 1st step 20 a provision of data of a place of departure, preferably by a user or by adopting a preset value; As such, the current location of the navigation system can preferably be determined and selected by the navigation system for the departure location. In a second step 21 Data of an arrival location are provided by input from a user, eg as a new entry. The place of departure and the place of arrival can also be determined by selecting from a list of favorites, from a list of last destinations or from a list of points of interest, eg multi-storey car park, museum, railway station, etc. In a 3rd step 22 Data of a desired departure time or a desired departure time window are provided by input from the user. The current time can be provided as a preset value. Again, a selection from a list of favorites is possible and advantageous for the planning of frequently repeated trips. Finally, the user in a 4th step 23 additionally or optionally still data of a desired arrival time, in particular a latest possible time of arrival, provided. Optionally, a desired arrival time window can also be entered. Again a selection from a list of favorites is possible. In a modification of this embodiment, the input of the data from the steps 20 to 23 also be done in a different order.

In a 5th step 26 is provided, preferably from a volume or a number of different data sources, a number of records for route sections, each route section is associated with a record that includes various traffic data for this route section. These include first data on the length, the state of development, speed limits, average, usual traffic load, usual rush hours, existing properties of milestones, in particular information about rest areas or gas stations and the like, which are constant for the route section concerned. Data on temporally more or less rapidly changing travel conditions in each individual route section, eg on current traffic load and congestion, for example during rush hours of commuter traffic, the current occupancy of truck stops, construction sites, current weather conditions, the current road conditions, registered heavy transport, main travel days at holiday times, etc. are preferably provided from external data sources. For example, these can be payment services dialed via the Internet. The individual services are in 1 symbolically through a sixth step 28 presented, the selection of the entire range of these services through a 7th step 27 ,

With an 8th step 25 is symbolically represented another option in which the user the selection of data of a desired stage trip duration, such as a truck driver maximum allowed stage trip duration, optionally a desired distance route length, and a desired stage pause duration, desired properties of milestones , For example, from rest areas, preferably in menu form is offered. A 9th step 24 refers to the selection and thus the provision of the actual desired and selected data.

In the 5th process step 26 From the provided and selected data and after comparing the existing and desired properties of the waypoints, three alternative route suggestions are calculated and this in a 10th step 29 at least one proposed departure time, a proposed route and an estimated total travel time spent. A route proposal once accepted by the user, ie a route which is then actually driven, becomes an 11th method step 30 Updated at predetermined time intervals, in particular updated data from the 6th and 7th step 28 . 27 be taken into account. The suggested route is dynamically adapted to the constantly changing traffic situation. For example, redirection recommendations can be incorporated into the route suggestion in the event of congestion. A truck driver can be advised of a changed route or leg if, during the journey, a planned service is required Milestones but now all truck parking spaces are occupied.

• 1. Abfahrt sofort, Route X, Gesamtfahrtdauer 5 Std.;
• 2. Abfahrt 17:30 Uhr, Route Y, Gesamtfahrtdauer 4 Std.;
• 3. Abfahrt 14:00 Uhr, Route Z, Gesamtfahrtdauer 3,5 Std.

In an example of a route calculation, the departure point becomes A, the arrival point is B, the desired departure time window is the current time, eg Friday 12:00, until Friday 20:00, the latest arrival time is Friday 21:30 and Highway usage rate of 80% specified. From this, three route suggestions are calculated:

• 1st departure immediately, Route X, total travel time 5 hours;
• 2. departure 5.30 pm, Route Y, total travel time 4 hours;
• 3. Departure 14:00, Route Z, total journey time 3.5 hours.

Route 3 is recommended because of the short travel time, the relaxed traffic situation and reduced fuel consumption and emissions.

In another example of a route calculation for a family trip with children from the departure point B to the arrival point R with stops of maximum 4 hours and breaks of 30 minutes, departure at the earliest Thursday 16:00, arrival latest Friday 21:00, Three route suggestions are output:
Route 1 (earliest departure, fastest journey)
pure driving time: 11h
Total duration: 12h Thursday 16:00 departure 20: 00-20: 30 Break (gas station) 0: 00-0: 30 Break (gas station) Friday 4:00 arrival Fastest ride, but inconvenient since night drive and arrival in the middle of the night.
Route 2 (latest departure)
pure driving time: 12h
Total duration: 13h Friday 8:00 departure 12: 00-12: 30 Break (gas station) 16: 30-17: 00 Break (gas station) Friday 21:00 arrival Unfavorable, because bad rest opportunities.
Route 3 (optimized for rest stops)
pure driving time: 13h
Total duration: 27h Thursday 16:00 departure 20: 00-9: 00 Overnight with possibility for refueling 12: 00-12: 30 Break (rest stop with gas station and changing facilities) 15: 30-16: 00 Break (gas station) Friday 19:00 arrival Recommended route, as better facilities at the breaks.

QUOTES INCLUDE IN THE DESCRIPTION

This list of the documents listed by the applicant has been generated automatically and is included solely for the better information of the reader. The list is not part of the German patent or utility model application. The DPMA assumes no liability for any errors or omissions.

Cited patent literature

• WO 2005/013063 A2 [0002, 0003, 0011]

Claims (10)

Procedure ( 100 ) for operating an electronic navigation system, comprising the following method steps: - providing data of a departure location; - providing data of an arrival location; - Providing data of a desired departure time or a desired departure time window, and / or - Providing data of a desired arrival time, in particular a latest possible arrival time and / or a desired time of arrival window; - Providing a number of records for route sections, each route section is associated with a traffic data comprehensive record; Calculating at least one route proposal from the data of the place of departure, the place of arrival, the desired departure time or desired departure time window and / or latest arrival time and / or desired arrival time window and the data sets for route segments; - Output of data for each route proposal, each comprising at least one proposed departure time, a proposed route and an estimated total journey time. Method according to claim 1, marked by the process steps: Providing data of a desired trip duration, in particular a maximum allowable trip duration, and / or Providing data of a desired leg distance length; - Providing data of a desired stage pause duration; - Calculating the at least one route proposal, taking into account the data of the desired stage travel time and / or the desired distance route length and the desired distance pause duration. Method according to claim 1 or 2, characterized in that The traffic data in the data records for route segments contain data on existing properties of intermediate destinations, in particular data on rest stops and / or gas stations, Data about desired properties of at least one milestone are provided, and - The at least one route proposal is calculated taking into account a comparison of the data on the existing and the desired properties of the way points. Method according to one or more of the preceding claims, characterized in that The traffic data in the data records for route sections contain data about travel conditions in each individual route section, in particular about a traffic load and / or construction sites and / or weather conditions, and - The at least one route proposal is calculated taking into account the data on the driving conditions. Method according to one or more of the preceding claims, characterized in that after at least the calculation of the data of the place of departure, the place of arrival, the desired departure time or desired departure time window and / or the latest possible arrival time and / or desired arrival time window: A first route proposal for the earliest possible departure time desired, - A second route proposal for the latest possible arrival time and A third route proposal as a result of an optimization of at least one predetermined travel parameter, preferably the estimated total travel time and / or a total travel distance and / or a suggested trip duration and / or a proposed trip distance and / or a proposed trip duration and / or the characteristics of proposed milestones. Method according to one or more of the preceding claims, characterized by a recalculation and output of the at least one route proposal made after predefined intervals of time of one of these time intervals updated data - the departure place / or - the place of arrival and / or - the desired departure time or a desired departure time window and / or - the desired Time of arrival and / or - the latest possible time of arrival and / or - records for route sections, in particular traffic data concerning data - on properties of milestones and / or - on driving conditions in each route section, in particular a traffic load, construction sites and / or weather conditions. Electronic navigation system for carrying out a method ( 100 ) according to one or more of the preceding claims. Computer program product comprising program parts for performing a method according to at least one of the preceding claims 1 to 6. Machine-readable, in particular computer-readable, data structure produced by a method according to at least one of claims 1 to 6 and / or by at least one computer program product according to claim 8. Machine-readable, in particular computer-readable, data carrier on which at least one computer program product according to claim 8 is recorded and / or stored and / or on which at least one data structure according to claim 9 is kept ready for retrieval.

Images