EP1494193B1 - Method and navigation apparatus to determine a route with intermediate destinations - Google Patents

Method and navigation apparatus to determine a route with intermediate destinations Download PDF

Info

Publication number
EP1494193B1
EP1494193B1 EP20040102432 EP04102432A EP1494193B1 EP 1494193 B1 EP1494193 B1 EP 1494193B1 EP 20040102432 EP20040102432 EP 20040102432 EP 04102432 A EP04102432 A EP 04102432A EP 1494193 B1 EP1494193 B1 EP 1494193B1
Authority
EP
European Patent Office
Prior art keywords
route
destination
intermediate destination
indirect
location
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
EP20040102432
Other languages
German (de)
French (fr)
Other versions
EP1494193A3 (en
EP1494193A2 (en
EP1494193B8 (en
Inventor
Michael Lichtinger
Christian Loibl
Wolfgang Mayer
Markus Schupfner
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Continental Automotive GmbH
Original Assignee
Siemens VDO Automotive AG
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Siemens VDO Automotive AG filed Critical Siemens VDO Automotive AG
Publication of EP1494193A2 publication Critical patent/EP1494193A2/en
Publication of EP1494193A3 publication Critical patent/EP1494193A3/en
Publication of EP1494193B1 publication Critical patent/EP1494193B1/en
Application granted granted Critical
Publication of EP1494193B8 publication Critical patent/EP1494193B8/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/09—Arrangements for giving variable traffic instructions
    • G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
    • G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
    • G08G1/096805—Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route
    • G08G1/096811—Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route where the route is computed offboard
    • G08G1/096822—Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route where the route is computed offboard where the segments of the route are transmitted to the vehicle at different locations and times
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/09—Arrangements for giving variable traffic instructions
    • G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
    • G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
    • G08G1/096833—Systems involving transmission of navigation instructions to the vehicle where different aspects are considered when computing the route
    • G08G1/096838—Systems involving transmission of navigation instructions to the vehicle where different aspects are considered when computing the route where the user preferences are taken into account or the user selects one route out of a plurality
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/09—Arrangements for giving variable traffic instructions
    • G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
    • G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
    • G08G1/096855—Systems involving transmission of navigation instructions to the vehicle where the output is provided in a suitable form to the driver
    • G08G1/096872—Systems involving transmission of navigation instructions to the vehicle where the output is provided in a suitable form to the driver where instructions are given per voice

Definitions

  • the invention relates to a method and a navigation system for determining an overall route comprising at least two partial routes between a first and a second location by means of a route calculation device, wherein the partial routes consist of nodes and edges and the overall route passes an indirect intermediate destination.
  • a route calculation device is understood to be any device that can be used to determine a route between a start location and a destination location. This can be a navigation system in a motor vehicle, a stationary computer with correspondingly installed route calculation software or access to the Internet, or even a portable device, such as a mobile phone or a PDA. The route can be calculated, for example, for motorists or pedestrians.
  • An indirect intermediate destination is a location predefined by the operator of the route calculation device, through which the desired overall route should not pass directly but in the vicinity of which it should pass.
  • the hitherto commercially available software or devices for route calculation allow only the specification of directly approaching intermediate destinations, hereinafter referred to as intermediate destinations. For example, if an operator wants to get to Dusseldorf via the freeway and not drive past the A3 in the direction of Cologne / Bonn as suggested by a route calculation unit, but instead drives past the A45, he can currently only select Siegen as a direct stopover. As a result, the route passes through downtown Siegen. Alternatively, the user could try using direct on the highway Intermediate destinations, such as certain motorway junctions to influence the routing. But this would have him these intersections already known, which requires a prior knowledge of the approximate route and thus is in conflict with the actual intended use of a route calculation unit.
  • the DE-10036817-A1 proposes in this context a method in which, starting from a starting point, a route calculation in the direction of an indirect intermediate destination, called transit destination, is started and runs until the route has reached a so-called capture area around the transit destination.
  • the route calculation is aborted at this point and, starting from the intermediate point thus found, a further route calculation is carried out in the direction of a next transit destination or in the direction of the final destination.
  • the size of the capture area is either fixed or adapted to the length of the calculated route or to a required change of road class, for example, from the highway to the highway.
  • the route calculation can become problematic when a user selects a transit destination in an unusual location for the optimal route, ie the route determined without a transit destination. For example, the transit destination may be very close to the start or destination or be placed pretty close to the optimal route.
  • the catching area around the transit destination determined by the above-mentioned criteria coincides with a high probability with the near surroundings of the starting and destination locations, the calculated route will not be different from the optimal route.
  • the desire of the user to deviate from the optimal route is ultimately disregarded.
  • a method and a navigation system for determining a route for a motor vehicle are known in which an indirect intermediate destination, here called a waypoint, is selected on a map by means of a displaceable marking.
  • This waypoint defines a preferred route corridor that is placed between start and destination by the route calculation unit such that this waypoint is included in the route corridor.
  • a route between start and destination is calculated, with the area within the route corridor being preferred.
  • Such a preference is achieved, for example, by reducing the resistance values within the corridor assigned to the individual route sections in the digital road map.
  • the user can change the route corridor proposed by the route calculation unit as desired in order to further influence the course of the resulting route.
  • the object of the present invention is therefore to specify a method for determining a route via an indirect intermediate destination, which can be implemented with little effort in an existing route calculation system.
  • the method and a generic navigation system should further allow easy operation.
  • a method is selected in which the indirect intermediate destination by a direct Intermediate destination is replaced. This is achieved by calculating an intermediate route between the first location, ie the starting location, and the indirect intermediate destination in a first method step. The standard algorithm can be used for this. From this first intermediate route, a node is then selected, the node being determined to be at a distance calculated by various criteria from the indirect intermediate destination. This node is substituted for the indirect intermediate destination as a direct intermediate destination and the section of the intermediate route between the starting location and the newly found direct intermediate destination is defined as a first partial route.
  • a second partial route to the destination can now be calculated, again using the standard algorithm, and these can be combined with the first partial route to form an overall route.
  • the overall route is displayed to the operator of the route calculation unit in a known manner on a graphical output unit, either in the form of routing on a map or as a succession of navigation indications in visual or audio form.
  • the method according to the invention offers the advantage that large parts of the existing route calculation system can be used in their original form and only additional software modules are created and, so to speak, appended to the system.
  • the method already implemented for calculating a route between a starting point and a destination point including a direct intermediate destination is only modified to the extent that additional functions must be created to calculate the distance between indirect and searchable direct intermediate destination, which depends on different criteria, for searching the intermediate waypoint on the calculated intermediate route and to shorten the intermediate route at the found node.
  • the already existing route calculation algorithm as well as the specified format of the road map data can be used unchanged, i. a constant query on a cancellation of the route calculation or a change in the road sections associated resistance values omitted.
  • an interim destination specified by the operator to a conventional distance must merely be identified by adding another attribute as an indirect intermediate destination.
  • known input options can be used, such as typing by keyboard, selecting from a list of locations or the graphical input on a map via cursor and mouse click.
  • the inventive method offers the possibility to use the known and already optimized operating options of route calculation facilities.
  • the marking of the intermediate destination as an indirect intermediate destination requires no more than, for example, an additional mouse click.
  • a navigation system which contains a computing unit which is designed to carry out the method according to the invention.
  • This arithmetic unit is equipped with an input unit, such as For example, a keyboard, a mouse, a touch screen or a control unit with rotary and function switches connected to the input of an indirect intermediate destination.
  • the arithmetic unit is connected to an optical output unit, on which a map can be displayed. On this map, at least the start and finish, the indirect waypoint and the course of the entire route can be graphically displayed.
  • the operator enters his start and destination in a known manner and selects an intermediate destination, which he only has to mark as an indirect intermediate destination. It is not necessary to specify further features or attributes, and an iterative procedure for specifying, for example, a route corridor is also dispensed with.
  • the node to be searched for the intermediate route is selected from a set of potential direct intermediate destinations.
  • This set of potential direct waypoints corresponds to the set of intermediate route nodes which are within a distance dependent on certain criteria from the indirect waypoint.
  • the distance, which determines the amount of potential direct intermediate destinations is generally greater than or at most equal to the distance within which the subsequently to be searched for a node of this amount. Equally long distances result if the same criteria are used to calculate both distances.
  • the first described sequence of the locations essential for the route namely start location, indirect intermediate destination, direct intermediate destination and destination serves as a basis for a further embodiment of the method according to the invention.
  • the indirect intermediate goal is replaced not only by one but by two direct intermediate goals.
  • two intermediate routes are calculated, the first between the starting point and the indirect intermediate destination and the second between the indirect intermediate destination and the destination.
  • the node is determined which is within a distance determined by different criteria from the indirect intermediate destination. These two nodes replace the indirect intermediate destination as direct intermediate destinations.
  • the two intermediate routes are shortened at this node and between the direct intermediate destinations the still missing partial route is calculated.
  • the second direct waypoint as a substitute node for the indirect waypoint may also again be selected from among a set of potential intermediate waypoints which are all within a certain distance from the indirect waypoint, thereby simplifying the search for the replacement node on the second intermediate route.
  • the areal extent of the indirect intermediate destination is taken into account. So i.a. the indirect intermediate destination may be given as the place name, and the villages or towns may be assigned an areal extent in the form of a circle or rectangle enclosing the place. If the intermediate indirect destinations are defined via special points, such as motorway junctions or scenic sites, they can also be assigned predefined dimensions, since the operator also consciously excludes these points as places to be approached directly.
  • the road class of the nodes of the intermediate route is considered as distance-determining criterion.
  • smaller roads such as thoroughfares or highways
  • smaller distances result and for motorways and main roads larger.
  • longer total routes which are mainly on the larger roads, this ensures that no unnecessary change of class to smaller roads takes place when passing the intermediate indirect destination.
  • the overall route be rather short or under certain circumstances anyway only on smaller roads lead along, for example, because the operator wants to drive on a scenic route, is approached to the indirect intermediate target also closer.
  • Another criterion for determining the distance to the indirect intermediate destination are the geometric relationships of a triangle, which is spanned by the starting location, the indirect intermediate destination and the destination.
  • the ratios of the side lengths of this triangle are of interest to each other, as these indicate whether and to what extent the indirect intermediate destination is closer to the start or the destination. If the operator has placed the indirect intermediate destination very close to one of these locations, normally the route would not be affected by this. For this reason, in such a case, the distance value is chosen to be quite small in order to actually redirect the route toward that intermediate destination. It is also interesting to consider the angle of the triangle.
  • the indirect intermediate destination is far away from the optimal route between the start and destination.
  • the distance for the replacement node to be searched can be relatively large in this case. It can be assumed that in a calculation of two individual routes between the starting point and the intermediate destination or the intermediate destination and the destination, the two routes in the vicinity of the indirect intermediate target due to its acute-angled position meet and continue identically to the interim destination. However, since the operator does not want to go back and forth on one and the same road, a substitute node for the indirect waypoint has to be found at some distance.
  • Another angle of interest is the angle with the vertex at the starting point. If this angle is rather small, the indirect intermediate destination is close to the optimal route between the start and destination.
  • All these criteria can be combined individually or all together to better match the distance values to the wishes of the operator.
  • a preferred combination is that the distance values determined by the spatial extent of the intermediate indirect destination are multiplied by a factor which depends on the road class of the nodes of the intermediate routes. The result of this multiplication can be changed by further multiplications, the other factors being determined by the properties of the triangle described above.
  • a route is calculated based on the combination of these criteria, which is immediately accepted by the operator. This saves him any attempts to design the route according to his ideas by changing the specification of the indirect intermediate destination or by entering additional direct or indirect intermediate destinations.
  • continental or country-specific configuration files can be stored in the route calculation system and loadable at any time before the start of a new route calculation.
  • the navigation system according to the invention is characterized in a development in that the arithmetic unit is designed to execute the route calculation method with the replacement of the indirect intermediate destination via two direct intermediate destinations.
  • the output unit displays the same overall route for a route calculation from the starting location via the indirect intermediate destination to the destination as for a calculation from the destination via the indirect intermediate destination to the starting location.
  • Another special embodiment of the navigation system provides that an additional storage unit for storing configuration files in the navigation system is included, the configuration files are used to determine the distances that determine the amounts of potential direct intermediate goals or define the nodes that replace the indirect intermediate goals ,
  • Fig. 1 In the background you can see the outline of a map of Germany. On a greatly enlarged scale, the start location SO, indirect intermediate destination IZ and destination location ZO given by an operator of a route calculation device can be seen. Between SO and IZ an intermediate route is calculated, which in the case shown should consist of only four essential nodes between SO and IZ. On the basis of criteria, such as the areal extent of IZ, a distance E1 is defined, which can also be regarded as a circle around IZ with the radius E1. Now, one of the four nodes of the intermediate route between SO and IZ is selected which is farthest from IZ but still within the distance E1.
  • This node is defined as a direct intermediate destination DZ1 and the intermediate route is shortened at this node, so that the first partial route consists of the nodes SO, K1, K2, K3 and DZ1.
  • DZ1 a second partial route to ZO is then calculated, which contains the nodes K4 to K7.
  • the dashed overall route is composed of the two sub-routes and leads at a distance that is slightly smaller than E1, past the indirect intermediate destination IZ.
  • Fig. 2 the procedure emerges if IZ is not replaced by one but by two direct intermediate goals DZ.
  • First analogously to Fig. 1 , calculates a first intermediate route between SO and IZ, where the first node located within E1 is selected and defined as DZ1, and the intermediate route at DZ1 is abbreviated to the first partial route.
  • a second intermediate route between IZ and ZO is calculated, on the second intermediate route the outermost node lying within E1 is determined and defined as a second direct intermediate destination DZ2.
  • the second intermediate route is shortened to DZ2 so that it runs between DZ2 and ZO.
  • a third partial route is calculated between DZ1 and DZ3 and the total route shown in dashed lines is composed of the three partial routes.
  • the order of the individual steps can be varied to some extent For example, since the intermediate routes are both calculated simultaneously and DZ1 and DZ2 can be determined simultaneously.
  • Fig. 3 Clarifies how to set the distance to select an intermediate route node.
  • the indirect intermediate destination IZ is a rectangle, which indicates the areal extent of IZ. Based on geometric dimensions of this rectangle, such as a page length or diagonal, a first value is set as the distance value. In the case presented here, this is multiplied by five different factors, which leads to five differently sized dashed circles around IZ. Each of the five factors corresponds to a road class, with the highest road class, the highways, being linked to the largest factor, leading to the outermost circle.
  • the search for the node replacing the indirect intermediate destination is started. For this, the largest of the five radii is defined as the so-called second distance value E2.
  • This distance value E2 determines all nodes of the intermediate route between SO and IZ within the outer circle as the set of potential direct intermediate destinations that can replace IZ.
  • the search can now be started and carried out in the direction IZ.
  • the next node in the direction of IZ is queried for its associated road class and assigned to one of the five radii corresponding to the road class. If the considered node lies within the radius assigned to it, the direct intermediate destination is found.
  • a node K1 lies between the outer radius E2 and the next smaller radius. This node has the second highest road class, ie the stretch of road on which it lies is a federal highway. It is therefore assigned the second largest radius as the distance value to be checked.
  • the search must continue become.
  • the next node also located on a main road, is then already within the radius assigned to it, whereby the direct intermediate destination DZ1 is found.
  • the radius assigned to it is referred to as the first distance value E1.
  • the first partial route TR1 is determined and, starting from DZ1, the second partial route TR2 is calculated.
  • the distance values for DZ1 and DZ2 may vary in size depending on the road class of the nodes. Then it would have to be in Fig. 2 for DZ1 a radius E1 and for DZ2 for example a larger radius E3 are drawn.
  • the road classes of the considered nodes change several times. Then it may be useful to cancel the search for a certain number of class changes in order to generate a meaningful overall route.
  • the user has certainly not intended to be introduced as close as possible to this interim destination by means of several crosses and junctions when choosing his indirect interim destination, but he would like to be guided past it at a reasonable distance.
  • radii assigned to the individual road classes can be further modified by considering the triangle formed by SO, IZ and ZO. Some special cases of this triangle are in the Figs. 4 to 6 displayed. So is IZ in Fig. 4 relatively close to SO. If a route between SO and ZO is selected via motorway, the largest radius around IZ will be relatively generous. However, this could lead to the found direct intermediate destination lies on the direct connection between SO and ZO, ie on the optimal route between SO and ZO. However, since the user intends to change the route, the radii around IZ should be rather small. This is achieved by considering the ratio of sides a to b. If this is clearly not equal to one, then IZ is close to SO or ZO and the radii are chosen to be small.
  • IZ is far from the optimal route between SO and ZO.
  • a consideration of the angle ⁇ with the vertex in IZ makes this clear. Since this angle is small in size, larger radii are to be set around IZ to avoid unnecessary back and forth driving on the same distance near IZ.
  • the Fig. 7 finally shows the result actually displayed on an output unit of a navigation system of a route calculation according to the invention in comparison to a route calculation via intermediate destinations that was previously possible with the same navigation system.
  • Start Location SO is Nuremberg
  • indirect stopover IZ is Regensburg and destination ZO is Munich.
  • the result calculated by the method according to the invention is Route at a considerable distance past Regensburg. A shutdown of the highway is completely avoided. It can be seen in the left-hand section of the picture that the previous method IZ treated it as a direct intermediate destination and that the proposed route leads into the city center of Regensburg. On the routes shown, individual nodes are highlighted as thicker points along the route.

Description

Die Erfindung betrifft ein Verfahren und ein Navigationssystem zur Bestimmung einer aus mindestens zwei Teilrouten bestehenden Gesamtroute zwischen einem ersten und einem zweiten Ort mittels einer Routenberechnungseinrichtung, wobei die Teilrouten aus Knoten und Kanten bestehen und die Gesamtroute an einem indirekten Zwischenziel vorbeiführt.The invention relates to a method and a navigation system for determining an overall route comprising at least two partial routes between a first and a second location by means of a route calculation device, wherein the partial routes consist of nodes and edges and the overall route passes an indirect intermediate destination.

Unter einer Routenberechnungseinrichtung wird eine beliebige Vorrichtung verstanden, welche zur Ermittlung einer Route zwischen einem Start- und einem Zielort verwendet werden kann. Dies kann ein Navigationssystem in einem Kraftfahrzeug, ein ortsfester Computer mit entsprechend installierter Routenberechnungssoftware bzw. Zugang zum Internet oder auch ein tragbares Gerät, wie ein Handy oder ein PDA sein. Die Route kann beispielsweise für Autofahrer oder Fußgänger berechnet werden.A route calculation device is understood to be any device that can be used to determine a route between a start location and a destination location. This can be a navigation system in a motor vehicle, a stationary computer with correspondingly installed route calculation software or access to the Internet, or even a portable device, such as a mobile phone or a PDA. The route can be calculated, for example, for motorists or pedestrians.

Als indirektes Zwischenziel wird ein vom Bediener der Routenberechnungseinrichtung vorgegebener Ort bezeichnet, durch den die gewünschte Gesamtroute nicht direkt hindurchführen sondern in dessen Nähe sie vorbeilaufen soll. Die bisher im Handel erhältliche Software bzw. Geräte zur Routenberechnung erlauben lediglich die Vorgabe von direkt anzufahrenden Zwischenzielen, im folgenden direkte Zwischenziele genannt. Möchte beispielsweise ein Bediener von Frankfurt aus über die Autobahn nach Düsseldorf gelangen und dabei nicht wie von einer Routenberechnungseinheit vorgeschlagen über die A3 Richtung Köln/Bonn sondern über die A45 an Siegen vorbei fahren, so kann er momentan Siegen nur als direktes Zwischenziel auswählen. Dies führt dazu, dass die Streckenführung durch die Innenstadt von Siegen hindurch erfolgt. Alternativ könnte der Benutzer versuchen, über auf der Autobahn liegende direkte Zwischenziele, beispielsweise bestimmte Autobahnkreuze die Streckenführung zu beeinflussen. Doch dazu müssten ihm diese Autobahnkreuze bereits bekannt sein, was eine Vorkenntnis der ungefähren Route erfordert und damit im Widerspruch zum eigentlichen Verwendungszweck einer Routenberechnungseinheit steht.An indirect intermediate destination is a location predefined by the operator of the route calculation device, through which the desired overall route should not pass directly but in the vicinity of which it should pass. The hitherto commercially available software or devices for route calculation allow only the specification of directly approaching intermediate destinations, hereinafter referred to as intermediate destinations. For example, if an operator wants to get to Dusseldorf via the freeway and not drive past the A3 in the direction of Cologne / Bonn as suggested by a route calculation unit, but instead drives past the A45, he can currently only select Siegen as a direct stopover. As a result, the route passes through downtown Siegen. Alternatively, the user could try using direct on the highway Intermediate destinations, such as certain motorway junctions to influence the routing. But this would have him these intersections already known, which requires a prior knowledge of the approximate route and thus is in conflict with the actual intended use of a route calculation unit.

Abhilfe kann geschaffen werden, wenn die Routenberechnungseinheit die Vorgabe von indirekten Zwischenzielen erlaubt. Die DE-10036817-A1 schlägt in diesem Zusammenhang ein Verfahren vor, bei dem ausgehend von einem Startort eine Routenberechnung in Richtung eines indirekten Zwischenzieles, genannt Durchgangszielort, gestartet wird und so lange läuft, bis die Route einen sogenannten Fangbereich um den Durchgangszielort erreicht hat. Die Routenberechnung wird an dieser Stelle abgebrochen und ausgehend von dem so gefundenen Zwischenpunkt wird eine weitere Routenberechnung in Richtung eines nächsten Durchgangszielortes bzw. in Richtung des endgültigen Zielortes durchgeführt. Bei einer Integration eines solchen Verfahrens in ein bestehendes Routenberechnungssystem muss direkt in den Routenberechnungsalgorithmus eingegriffen werden, um dort die Abfrage auf ein Erreichen des Fangbereiches des Durchgangszielortes einzufügen. Dies erfordert einen erhöhten Entwicklungsaufwand, da es zum einen schwieriger ist, in ein bereits bestehendes Softwaremodul neue Teile einzufügen, als einfach ein neues Modul zu programmieren, und da zum anderen die gesamte Routenberechnung erneut getestet und verifiziert werden muss.
In der DE-10036817-A1 wird die Größe des Fangbereiches entweder fest vorgegeben oder an die Länge der berechneten Route bzw. an einen erforderlichen Wechsel der Straßenklasse, beispielsweise von der Autobahn zur Landstraße, angepasst. Bei einem derartigen Vorgehen kann die Routenberechnung dann problematisch werden, wenn ein Benutzer einen Durchgangszielort in einer ungewöhnlichen Lage zur optimalen Route, also der ohne Durchgangszielort ermittelten Route, wählt. So kann der Durchgangszielort beispielsweise sehr nahe an den Start- oder Zielort oder ziemlich dicht neben die optimale Route gelegt werden. Da in einem solchen Fall der nach den genannten Kriterien festgelegte Fangbereich um den Durchgangszielort die nähere Umgebung von Start- und Zielort bzw. optimaler Route mit hoher Wahrscheinlichkeit mit überdeckt, wird sich die berechnete Route nicht von der optimalen Route unterscheiden. Der Wunsch des Benutzers, von der optimalen Route abzuweichen, bleibt im Endeffekt unberücksichtigt.Remedy can be provided if the route calculation unit allows the specification of indirect interim destinations. The DE-10036817-A1 proposes in this context a method in which, starting from a starting point, a route calculation in the direction of an indirect intermediate destination, called transit destination, is started and runs until the route has reached a so-called capture area around the transit destination. The route calculation is aborted at this point and, starting from the intermediate point thus found, a further route calculation is carried out in the direction of a next transit destination or in the direction of the final destination. When integrating such a method into an existing route calculation system, it is necessary to intervene directly in the route calculation algorithm in order to insert the query there for reaching the capture area of the transit destination. This requires an increased development effort, since it is more difficult to insert new parts into an already existing software module than to simply program a new module, and secondly because the entire route calculation has to be re-tested and verified.
In the DE-10036817-A1 the size of the capture area is either fixed or adapted to the length of the calculated route or to a required change of road class, for example, from the highway to the highway. In such an approach, the route calculation can become problematic when a user selects a transit destination in an unusual location for the optimal route, ie the route determined without a transit destination. For example, the transit destination may be very close to the start or destination or be placed pretty close to the optimal route. Since, in such a case, the catching area around the transit destination determined by the above-mentioned criteria coincides with a high probability with the near surroundings of the starting and destination locations, the calculated route will not be different from the optimal route. The desire of the user to deviate from the optimal route is ultimately disregarded.

Aus der nicht vorveröffentlichten deutschen Anmeldung 10218340.6 sind ein Verfahren sowie ein Navigationssystem zur Bestimmung einer Route für ein Kraftfahrzeug bekannt, bei denen auf einer Landkarte ein indirektes Zwischenziel, hier Wegpunkt genannt, mittels einer verschiebbaren Markierung ausgewählt wird. Dieser Wegpunkt definiert einen bevorzugten Routenkorridor, der von der Routenberechnungseinheit so zwischen Start- und Zielort gelegt wird, dass dieser Wegpunkt in den Routenkorridor eingeschlossen ist. Anschließend wird eine Route zwischen Start- und Zielort berechnet, wobei der Bereich innerhalb des Routenkorridors bevorzugt wird. Eine solche Bevorzugung wird beispielsweise dadurch erreicht, dass die in der digitalen Straßenkarte den einzelnen Streckenabschnitten zugeordneten Widerstandswerte innerhalb des Korridors herabgesetzt werden. Den von der Routenberechnungseinheit vorgeschlagenen Routenkorridor kann der Benutzer nach Wunsch ändern, um damit den Verlauf der resultierenden Route weiter zu beeinflussen. Ein wichtiger Teil des Verfahrens läuft interaktiv ab, d.h. der Benutzer gibt das indirekte Zwischenziel grafisch vor, woraufhin ihm entweder ein vorgeschlagener Routenkorridor oder bereits eine vorgeschlagene Route angezeigt werden. Diese kann der Benutzer anschließend akzeptieren oder durch Veränderungen der Lage des indirekten Zwischenziels, Hinzufügen weiterer Zwischenziele oder durch Änderung der Größe des Routenkorridors beeinflussen. Dies bietet dem Benutzer die Möglichkeit, die Route ganz nach seinen Vorstellungen zu verformen, birgt auf der anderen Seite jedoch auch die Gefahr der zu aufwändigen Bedienung.From the not pre-published German application 10218340.6 For example, a method and a navigation system for determining a route for a motor vehicle are known in which an indirect intermediate destination, here called a waypoint, is selected on a map by means of a displaceable marking. This waypoint defines a preferred route corridor that is placed between start and destination by the route calculation unit such that this waypoint is included in the route corridor. Subsequently, a route between start and destination is calculated, with the area within the route corridor being preferred. Such a preference is achieved, for example, by reducing the resistance values within the corridor assigned to the individual route sections in the digital road map. The user can change the route corridor proposed by the route calculation unit as desired in order to further influence the course of the resulting route. An important part of the procedure is interactive, ie the user graphically sets the indirect waypoint, whereupon either a suggested route corridor or already a suggested route is displayed to him. The user can then accept these or influence them by changing the position of the indirect intermediate destination, adding further intermediate destinations or by changing the size of the route corridor. This offers the user the opportunity to deform the route according to his ideas, but on the other hand, also carries the risk of too complex operation.

Aufgabe der vorliegenden Erfindung ist es deshalb, ein Verfahren zur Bestimmung einer Route über ein indirektes Zwischenziel anzugeben, welches mit geringem Aufwand in einem bestehenden Routenberechnungssystem implementiert werden kann. Das Verfahren und ein gattungsgemäßes Navigationssystem sollen desweiteren eine einfache Bedienung erlauben.The object of the present invention is therefore to specify a method for determining a route via an indirect intermediate destination, which can be implemented with little effort in an existing route calculation system. The method and a generic navigation system should further allow easy operation.

Die Aufgaben werden gelöst durch ein gattungsgemäßes Verfahren mit den kennzeichnenden Merkmalen des Hauptanspruchs 1. Um den in einer Routenberechnungseinheit bereits bestehenden Standardalgorithmus zur Bestimmung einer Route zwischen zwei fest vorgegebenen Orten unangetastet zu lassen, wird ein Verfahren gewählt, bei dem das indirekte Zwischenziel durch ein direktes Zwischenziel ersetzt wird. Dies wird dadurch erreicht, dass in einem ersten Verfahrensschritt eine Zwischenroute zwischen dem ersten Ort, also dem Startort, und dem indirekten Zwischenziel berechnet wird. Dafür kann der Standardalgorithmus verwendet werden. Von dieser ersten Zwischenroute wird dann ein Knoten ausgewählt, wobei der Knoten dadurch bestimmt ist, dass er sich in einer nach verschiedenen Kriterien berechneten Entfernung von dem indirekten Zwischenziel befindet. Dieser Knoten wird als direktes Zwischenziel an die Stelle des indirekten Zwischenzieles gesetzt und der Abschnitt der Zwischenroute zwischen dem Startort und dem neu gefundenen direkten Zwischenziel wird als eine erste Teilroute definiert. Ausgehend von dem direkten Zwischenziel kann jetzt, wieder mit dem Standardalgorithmus, eine zweite Teilroute zum Zielort berechnet werden und diese mit der ersten Teilroute zu einer Gesamtroute zusammengefügt werden. Die Gesamtroute wird dem Bediener der Routenberechnungseinheit in bekannter Weise auf einer grafischen Ausgabeeinheit angezeigt, entweder in Form der Streckenführung auf einer Landkarte oder als Aufeinanderfolge von Navigationshinweisen in visueller oder Audioform.The objects are achieved by a generic method with the characterizing features of the main claim 1. In order to leave untouched in a route calculation unit standard algorithm for determining a route between two fixed locations, a method is selected in which the indirect intermediate destination by a direct Intermediate destination is replaced. This is achieved by calculating an intermediate route between the first location, ie the starting location, and the indirect intermediate destination in a first method step. The standard algorithm can be used for this. From this first intermediate route, a node is then selected, the node being determined to be at a distance calculated by various criteria from the indirect intermediate destination. This node is substituted for the indirect intermediate destination as a direct intermediate destination and the section of the intermediate route between the starting location and the newly found direct intermediate destination is defined as a first partial route. Starting from the direct intermediate destination, a second partial route to the destination can now be calculated, again using the standard algorithm, and these can be combined with the first partial route to form an overall route. The overall route is displayed to the operator of the route calculation unit in a known manner on a graphical output unit, either in the form of routing on a map or as a succession of navigation indications in visual or audio form.

Das erfindungsgemäße Verfahren bietet den Vorteil, dass große Teile des bestehenden Routenberechnungssystems in ihrer ursprünglichen Form genutzt werden können und lediglich zusätzliche Softwaremodule erstellt und sozusagen an das System angehängt werden. Das bereits implementierte Verfahren zur Berechnung einer Route zwischen einem Start- und einem Zielpunkt unter Einbeziehung eines direkten Zwischenzieles wird nur insoweit abgewandelt, als dass zusätzliche Funktionen erstellt werden müssen zur Berechnung der von unterschiedlichen Kriterien abhängigen Entfernung zwischen indirektem und zu suchendem direkten Zwischenziel, zum Suchen des direkten Zwischenziels auf der berechneten Zwischenroute und zum Kürzen der Zwischenroute an dem gefundenen Knoten. Insbesondere können der bereits bestehende Routenberechnungsalgorithmus sowie das festgelegte Format der Straßenkartendaten unverändert genutzt werden, d.h. eine ständige Abfrage auf ein Abbrechen der Routenberechnung bzw. eine Änderung der den Straßenabschnitten zugeordneten Widerstandswerte entfallen.The method according to the invention offers the advantage that large parts of the existing route calculation system can be used in their original form and only additional software modules are created and, so to speak, appended to the system. The method already implemented for calculating a route between a starting point and a destination point including a direct intermediate destination is only modified to the extent that additional functions must be created to calculate the distance between indirect and searchable direct intermediate destination, which depends on different criteria, for searching the intermediate waypoint on the calculated intermediate route and to shorten the intermediate route at the found node. In particular, the already existing route calculation algorithm as well as the specified format of the road map data can be used unchanged, i. a constant query on a cancellation of the route calculation or a change in the road sections associated resistance values omitted.

Ein vom Bediener auf herkömmliche Weite vorgegebenes Zwischenziel muss desweiteren lediglich durch Hinzufügen eines weiteren Attributes als indirektes Zwischenziel gekennzeichnet werden. Zur Vorgabe des Zwischenzieles können bekannte Eingabemöglichkeiten genutzt werden, wie das Eingeben per Tastatur, das Auswählen aus einer Liste von Orten oder die grafische Eingabe auf einer Landkarte über Cursor und Mausklick. Damit bietet das erfindungsgemäße Verfahren die Möglichkeit, die bekannten und bereits optimierten Bedienmöglichkeiten von Routenberechnungseinrichtungen zu nutzen. Die Kennzeichnung des Zwischenzieles als indirektes Zwischenziel erfordert nicht mehr als beispielsweise einen zusätzlichen Mausklick.Furthermore, an interim destination specified by the operator to a conventional distance must merely be identified by adding another attribute as an indirect intermediate destination. To specify the interim destination known input options can be used, such as typing by keyboard, selecting from a list of locations or the graphical input on a map via cursor and mouse click. Thus, the inventive method offers the possibility to use the known and already optimized operating options of route calculation facilities. The marking of the intermediate destination as an indirect intermediate destination requires no more than, for example, an additional mouse click.

Somit kann zur Lösung der zweiten Aufgabe ein Navigationssystem angegeben werden, welches eine Recheneinheit enthält, die zur Ausführung des erfindungsgemäßen Verfahrens ausgebildet ist. Diese Recheneinheit ist mit einer Eingabeeinheit, wie beispielsweise einer Tastatur, einer Maus, einem Touchscreen oder einer Bedieneinheit mit Dreh- und Funktionsschaltern zur Eingabe eines indirekten Zwischenzieles verbunden. Desweiteren ist die Recheneinheit mit einer optischen Ausgabeeinheit verbunden, auf der eine Landkarte anzeigbar ist. Auf dieser Landkarte sind mindestens der Start- und Zielort, das indirekte Zwischenziel und der Verlauf der Gesamtroute grafisch darstellbar. Der Bediener gibt in bekannter Weise seinen Start- und Zielort ein und wählt ein Zwischenziel aus, welches er nur noch als indirektes Zwischenziel kennzeichnen muss. Eine Festlegung von weiteren Merkmalen oder Attributen ist nicht erforderlich und auch ein iteratives Vorgehen zur Festlegung beispielsweise eines Routenkorridors entfällt.Thus, to solve the second problem, a navigation system can be specified, which contains a computing unit which is designed to carry out the method according to the invention. This arithmetic unit is equipped with an input unit, such as For example, a keyboard, a mouse, a touch screen or a control unit with rotary and function switches connected to the input of an indirect intermediate destination. Furthermore, the arithmetic unit is connected to an optical output unit, on which a map can be displayed. On this map, at least the start and finish, the indirect waypoint and the course of the entire route can be graphically displayed. The operator enters his start and destination in a known manner and selects an intermediate destination, which he only has to mark as an indirect intermediate destination. It is not necessary to specify further features or attributes, and an iterative procedure for specifying, for example, a route corridor is also dispensed with.

In einer Weiterbildung des erfindungsgemäßen Verfahrens wird der zu suchende Knoten der Zwischenroute aus einer Menge von potentiellen direkten Zwischenzielen ausgewählt. Diese Menge von potentiellen direkten Zwischenzielen entspricht der Menge von Knoten der Zwischenroute, welche sich innerhalb einer von bestimmten Kriterien abhängigen Entfernung vom indirekten Zwischenziel befinden. Die Entfernung, welche die Menge an potentiellen direkten Zwischenzielen bestimmt, ist dabei im allgemeinen größer als oder höchstens gleich groß wie die Entfernung, innerhalb der der anschließend zu suchende eine Knoten dieser Menge liegt. Gleich große Entfernungen ergeben sich dann, wenn zur Berechnung beider Entfernungen dieselben Kriterien herangezogen werden.In a development of the method according to the invention, the node to be searched for the intermediate route is selected from a set of potential direct intermediate destinations. This set of potential direct waypoints corresponds to the set of intermediate route nodes which are within a distance dependent on certain criteria from the indirect waypoint. The distance, which determines the amount of potential direct intermediate destinations, is generally greater than or at most equal to the distance within which the subsequently to be searched for a node of this amount. Equally long distances result if the same criteria are used to calculate both distances.

Aufgrund dieses Zwischenschritts der Definition einer Menge von potentiellen direkten Zwischenzielen wird der Suchalgorithmus zum Finden des einen Knotens, welcher das indirekte Zwischenziel als direktes Zwischenziel ersetzen soll, vereinfacht. Eine große Anzahl von Knoten der Zwischenroute kann so bereits von vornherein von der Suche ausgeschlossen werden, was die Rechenzeit reduziert.Due to this intermediate step of defining a set of potential intermediate direct destinations, the search algorithm for finding the one node which should replace the intermediate indirect destination as a direct intermediate destination is simplified. A large number of nodes of the intermediate route can thus be excluded from the outset of the search, which reduces the computing time.

In einer nächsten Ausgestaltung des Verfahrens ist es möglich, sowohl ein indirektes als auch ein direktes Zwischenziel bei der Routenberechnung zu berücksichtigen. Nachdem das indirekte Zwischenziel durch ein erstes direktes Zwischenziel ersetzt und damit eine erste Teilroute generiert wurde, werden zwei weitere Teilrouten zwischen dem ersten direkten und dem weiteren direkten Zwischenziel sowie zwischen dem weiteren direkten Zwischenziel und dem Zielort berechnet. Die Gesamtroute setzt sich wieder wie gewohnt aus den drei Teilrouten zusammen. Natürlich kann diese Reihenfolge der Berechnung auch umgedreht werden, je nachdem, ob das vom Benutzer vorgegebene indirekte oder das direkte Zwischenziel näher am Startort liegt. Die Berechnung kann desweiteren beliebig fortgeführt werden, je nach Anzahl der vorgegebenen Zwischenziele. Der Benutzer hat damit die Möglichkeit, eine Route ganz nach seinem Belieben zu gestalten.In a next embodiment of the method, it is possible to consider both an indirect and a direct intermediate destination in the route calculation. After the indirect intermediate destination has been replaced by a first direct intermediate destination and thus a first partial route has been generated, two further partial routes are calculated between the first direct and the further direct intermediate destination and between the further direct intermediate destination and the destination. The overall route is composed again as usual from the three sub-routes. Of course, this order of calculation can also be reversed, depending on whether the user-specified indirect or direct intermediate destination is closer to the start location. The calculation can furthermore be continued as desired, depending on the number of intermediate destinations specified. The user has the opportunity to design a route as he pleases.

Die zuerst beschriebene Abfolge der für die Route wesentlichen Orte, nämlich Startort, indirektes Zwischenziel, direktes Zwischenziel und Zielort dient als Grundlage für eine weitere Ausgestaltung des erfindungsgemäßen Verfahrens. Bei dieser Ausgestaltung wird das indirekte Zwischenziel nicht nur durch ein sondern durch zwei direkte Zwischenziele ersetzt. Dafür werden zwei Zwischenrouten berechnet, die erste zwischen dem Startort und dem indirekten Zwischenziel und die zweite zwischen dem indirekten Zwischenziel und dem Zielort. Auf beiden Zwischenrouten wird der Knoten bestimmt, welcher sich innerhalb einer nach verschiedenen Kriterien bestimmten Entfernung vom indirekten Zwischenziel befindet. Diese beiden Knoten ersetzen als direkte Zwischenziele das indirekte Zwischenziel. Die beiden Zwischenrouten werden an diesen Knoten gekürzt und zwischen den direkten Zwischenzielen wird die noch fehlende Teilroute berechnet.The first described sequence of the locations essential for the route, namely start location, indirect intermediate destination, direct intermediate destination and destination serves as a basis for a further embodiment of the method according to the invention. In this embodiment, the indirect intermediate goal is replaced not only by one but by two direct intermediate goals. For this purpose, two intermediate routes are calculated, the first between the starting point and the indirect intermediate destination and the second between the indirect intermediate destination and the destination. On both intermediate routes, the node is determined which is within a distance determined by different criteria from the indirect intermediate destination. These two nodes replace the indirect intermediate destination as direct intermediate destinations. The two intermediate routes are shortened at this node and between the direct intermediate destinations the still missing partial route is calculated.

Der Vorteil dieser Vorgehensweise liegt darin, dass sich bei einer Routenberechnung vom Startort SO über das indirekte Zwischenziel IZ zum Zielort ZO dieselbe Streckenführung ergibt wie bei einer Berechnung in der Gegenrichtung, von ZO über IZ nach SO. Bei nur einem direkten Zwischenziel ist dies nicht der Fall, was für einen Benutzer u.U. verwirrend sein kann, da er im allgemeinen für die Hinfahrt dieselbe Route erwartet wie für die Rückfahrt.The advantage of this procedure lies in the fact that, in the case of a route calculation from the starting point SO via the indirect intermediate destination IZ to the destination location ZO, the same route guidance results as in a calculation in the opposite direction, from ZO via IZ to SO. With only one direct stopover, this is not the case, which may be confusing for a user, as he generally expects the same route for the outward journey as for the return journey.

Das zweite direkte Zwischenziel als Ersatzknoten für das indirekte Zwischenziel kann natürlich ebenfalls wieder aus einer Menge von potentiellen direkten Zwischenzielen ausgewählt werden, welche sich alle innerhalb einer bestimmten Entfernung vom indirekten Zwischenziel befinden, um dadurch das Suchen des Ersatzknotens auf der zweiten Zwischenroute zu vereinfachen.Of course, the second direct waypoint as a substitute node for the indirect waypoint may also again be selected from among a set of potential intermediate waypoints which are all within a certain distance from the indirect waypoint, thereby simplifying the search for the replacement node on the second intermediate route.

Als ein Kriterium, welches die Entfernungen vom indirekten Zwischenziel bestimmt, wird in einer Ausgestaltung der Erfindung die flächenmäßige Ausdehnung des indirekten Zwischenzieles berücksichtigt. So wird i.a. das indirekte Zwischenziel als Ortsname vorgegeben werden, und den Dörfern oder Städten kann eine flächenmäßige Ausdehnung in Form eines den Ort umschließenden Kreises oder Rechteckes zugeordnet werden. Werden die indirekten Zwischenziele über besondere Punkte, wie beispielsweise Autobahnkreuze oder landschaftliche Sehenswürdigkeiten definiert, können diesen ebenfalls vordefinierte Ausdehnungenzugeordnet werden, da ja der Bediener auch diese Punkte bewusst als direkt anzufahrende Orte ausschließt.As a criterion which determines the distances from the indirect intermediate destination, in one embodiment of the invention the areal extent of the indirect intermediate destination is taken into account. So i.a. the indirect intermediate destination may be given as the place name, and the villages or towns may be assigned an areal extent in the form of a circle or rectangle enclosing the place. If the intermediate indirect destinations are defined via special points, such as motorway junctions or scenic sites, they can also be assigned predefined dimensions, since the operator also consciously excludes these points as places to be approached directly.

In einer weiteren Ausgestaltung wird als entfernungsbestimmendes Kriterium die Straßenklasse der Knoten der Zwischenroute betrachtet. Für kleinere Straßen, wie Durchfahrts- oder Landstraßen, ergeben sich kleinere Entfernungswerte und für Autobahnen und Bundesstraßen größere. Bei längeren Gesamtrouten, die hauptsächlich auf den größeren Straßen liegen, wird damit sichergestellt, dass für die Vorbeifahrt an dem indirekten Zwischenziel keine unnötigen Klassenwechsel zu kleineren Straßen hin erfolgen. Sollte die Gesamtroute eher kurz sein oder unter Umständen sowieso nur auf kleineren Straßen entlangführen, da beispielsweise der Bediener auf einer landschaftlich schönen Strecke fahren will, wird an das indirekte Zwischenziel auch näher herangefahren.In a further refinement, the road class of the nodes of the intermediate route is considered as distance-determining criterion. For smaller roads, such as thoroughfares or highways, smaller distances result and for motorways and main roads larger. For longer total routes, which are mainly on the larger roads, this ensures that no unnecessary change of class to smaller roads takes place when passing the intermediate indirect destination. Should the overall route be rather short or under certain circumstances anyway only on smaller roads lead along, for example, because the operator wants to drive on a scenic route, is approached to the indirect intermediate target also closer.

Ein weiteres Kriterium zur Bestimmung der Entfernung zum indirekten Zwischenziel sind die geometrischen Verhältnisse eines Dreieckes, welches durch den Startort, das indirekte Zwischenziel und den Zielort aufgespannt wird. So sind zum einen die Verhältnisse der Seitenlängen dieses Dreieckes zueinander von Interesse, da diese angeben, ob und in welchem Maße das indirekte Zwischenziel näher am Start- oder am Zielort liegt. Hat der Bediener das indirekte Zwischenziel sehr nahe an einen dieser Orte gelegt, so würde im Normalfall die Streckenführung dadurch nicht beeinflusst werden. Aus diesem Grund wird in so einem Fall der Entfernungswert ziemlich klein gewählt, um die Route tatsächlich in Richtung dieses Zwischenziels umzuleiten. Interessant ist auch eine Berücksichtigung der Winkel des Dreieckes. Ist beispielsweise der Winkel, dessen Scheitelpunkt am indirekten Zwischenziel liegt, eher klein, so befindet sich das indirekte Zwischenziel weit weg von der optimalen Route zwischen Start- und Zielort. Die Entfernung für den zu suchenden Ersatzknoten kann in diesem Fall relativ groß sein. Es ist nämlich davon auszugehen, dass bei einer Berechnung von zwei Einzelrouten zwischen dem Startort und dem Zwischenziel bzw. dem Zwischenziel und dem Zielort die beiden Routen in der Nähe des indirekten Zwischenzieles aufgrund dessen spitzwinkliger Lage aufeinandertreffen und identisch bis zum Zwischenziel weiterlaufen. Da der Bediener jedoch extra nicht auf ein- und derselben Straße hin- und wiederzurückfahren will, ist also ein Ersatzknoten für das indirekte Zwischenziel in einiger Entfernung zu suchen.
Ein weiterer Winkel von Interesse ist der Winkel mit dem Scheitelpunkt am Startpunkt. Ist dieser Winkel eher klein, so befindet sich das indirekte Zwischenziel nahe der optimalen Route zwischen Start- und Zielort. Auch in so einem Fall würde normalerweise die Streckenführung durch das Zwischenziel nicht beeinflusst werden. Um dies aber nach Wunsch des Bedieners doch zu erreichen, wird der Entfernungswert wieder ziemlich klein gewählt.
Die Betrachtung des Dreieckes zwischen Startort, Zwischenziel und Zielort bringt den Vorteil, dass gegenüber dem bekannten Verfahren auch eine ungewöhnlich gewählte Lage des indirekten Zwischenziels mitberücksichtigt wird und zu einer Veränderung der optimalen Route führt.Another criterion for determining the distance to the indirect intermediate destination are the geometric relationships of a triangle, which is spanned by the starting location, the indirect intermediate destination and the destination. Thus, on the one hand, the ratios of the side lengths of this triangle are of interest to each other, as these indicate whether and to what extent the indirect intermediate destination is closer to the start or the destination. If the operator has placed the indirect intermediate destination very close to one of these locations, normally the route would not be affected by this. For this reason, in such a case, the distance value is chosen to be quite small in order to actually redirect the route toward that intermediate destination. It is also interesting to consider the angle of the triangle. If, for example, the angle whose vertex lies at the indirect intermediate destination is rather small, then the indirect intermediate destination is far away from the optimal route between the start and destination. The distance for the replacement node to be searched can be relatively large in this case. It can be assumed that in a calculation of two individual routes between the starting point and the intermediate destination or the intermediate destination and the destination, the two routes in the vicinity of the indirect intermediate target due to its acute-angled position meet and continue identically to the interim destination. However, since the operator does not want to go back and forth on one and the same road, a substitute node for the indirect waypoint has to be found at some distance.
Another angle of interest is the angle with the vertex at the starting point. If this angle is rather small, the indirect intermediate destination is close to the optimal route between the start and destination. Even in such a case, normally the route through the intermediate destination would not be affected. But to the desire of the operator but to reach, the distance value is again chosen quite small.
The consideration of the triangle between start location, intermediate destination and destination has the advantage that compared to the known method, an unusually selected position of the indirect intermediate destination is taken into account and leads to a change in the optimal route.

All die genannten Kriterien können beliebig einzeln oder auch alle miteinander kombiniert werden, um die Entfernungswerte noch besser an die Wünsche des Bedieners anzupassen. Eine bevorzugte Kombination besteht darin, dass die durch die räumliche Ausdehnung des indirekten Zwischenzieles bestimmten Entfernungswerte multipliziert werden mit einem Faktor, welcher von der Straßenklasse der Knoten der Zwischenrouten abhängt. Das Ergebnis dieser Multiplikation kann über weitere Multiplikationen verändert werden, wobei die weiteren Faktoren von den Eigenschaften des oben beschriebenen Dreieckes bestimmt werden. Im optimalen Fall wird aufgrund der Kombination dieser Kriterien eine Route berechnet, welche vom Bediener sofort akzeptiert wird. Dies erspart ihm jegliche Versuche, durch Änderungen in der Vorgabe des indirekten Zwischenziels oder durch Eingabe zusätzlicher direkter oder indirekter Zwischenziele die Route nach seinen Vorstellungen zu gestalten.All these criteria can be combined individually or all together to better match the distance values to the wishes of the operator. A preferred combination is that the distance values determined by the spatial extent of the intermediate indirect destination are multiplied by a factor which depends on the road class of the nodes of the intermediate routes. The result of this multiplication can be changed by further multiplications, the other factors being determined by the properties of the triangle described above. In the optimal case, a route is calculated based on the combination of these criteria, which is immediately accepted by the operator. This saves him any attempts to design the route according to his ideas by changing the specification of the indirect intermediate destination or by entering additional direct or indirect intermediate destinations.

Da jedoch die Vorstellungen von Bediener zu Bediener stark unterschiedlich sein können, ist es in einer Weiterbildung des erfindungsgemäßen Verfahrens vorgesehen, bedienerabhängige Kriterien im Routenberechnungssystem abzuspeichern und je nach aktuellem Bediener die Routenberechnung entsprechend zu konfigurieren. So könnten beispielsweise die oben beschriebenen Faktoren bedienerabhängig ermittelt und festgehalten werden.However, since the ideas can vary greatly from operator to operator, it is provided in a further development of the method according to the invention to store operator-dependent criteria in the route calculation system and to configure the route calculation accordingly, depending on the current operator. For example, the factors described above could be determined and recorded operator-dependent.

Desweiteren ist es vorgesehen, die entfernungsbestimmenden Kriterien an die befahrene geographische Region anzupassen.Furthermore, it is intended to adapt the distance-determining criteria to the traveled geographical region.

So können kontinental- oder länderspezifische Konfigurationsdateien im Routenberechnungssystem gespeichert und jederzeit vor Beginn einer neuen Routenberechnung ladbar sein.Thus, continental or country-specific configuration files can be stored in the route calculation system and loadable at any time before the start of a new route calculation.

Das erfindungsgemäße Navigationssystem wird in einer Weiterbildung dadurch gekennzeichnet, dass die Recheneinheit zur Ausführung des Routenberechnungsverfahrens mit der Ersetzung des indirekten Zwischenzieles über zwei direkte Zwischenziele ausgebildet ist. Die Ausgabeeinheit zeigt bei diesem Navigationssystem dieselbe Gesamtroute für eine Routenberechnung vom Startort über das indirekte Zwischenziel zum Zielort wie für eine Berechnung vom Zielort über das indirekte Zwischenziel zum Startort an.The navigation system according to the invention is characterized in a development in that the arithmetic unit is designed to execute the route calculation method with the replacement of the indirect intermediate destination via two direct intermediate destinations. In this navigation system, the output unit displays the same overall route for a route calculation from the starting location via the indirect intermediate destination to the destination as for a calculation from the destination via the indirect intermediate destination to the starting location.

Eine weitere spezielle Ausgestaltung des Navigationssystems sieht vor, dass zusätzlich eine Speichereinheit zur Speicherung von Konfigurationsdateien im Navigationssystem enthalten ist, wobei die Konfigurationsdateien zur Festlegung der Entfernungen dienen, die die Mengen der potentiellen direkten Zwischenziele bestimmen bzw. die Knoten definieren, welche die indirekten Zwischenziele ersetzen.Another special embodiment of the navigation system provides that an additional storage unit for storing configuration files in the navigation system is included, the configuration files are used to determine the distances that determine the amounts of potential direct intermediate goals or define the nodes that replace the indirect intermediate goals ,

Die Erfindung wird nachfolgend anhand eines Ausführungsbeispiels und der Zeichnung näher erläutert. Es zeigen:

Fig. 1
eine Landkarte mit einer Gesamtroute sowie wesentlichen Knoten, insbesondere einem direkten Zwischenziel;
Fig. 2
eine Landkarte wie in Fig. 1, mit insbesondere zwei direkten Zwischenzielen;
Fig. 3
eine Darstellung von Kriterien zur Festlegung von Entfernungen vom indirekten Zwischenziel;
Fig. 4 bis 6
Sonderformen von entfernungsbestimmenden Dreiecken.
The invention will be explained in more detail with reference to an embodiment and the drawing. Show it:
Fig. 1
a map with an overall route and major nodes, in particular a direct interim destination;
Fig. 2
a map like in Fig. 1 , with in particular two direct intermediate destinations;
Fig. 3
a presentation of criteria for establishing distances from the indirect intermediate objective;
4 to 6
Special forms of distance-determining triangles.

In Fig. 1 ist im Hintergrund der Umriss einer Deutschlandkarte zu sehen. In stark vergrößertem Maßstab sind die von einem Bediener einer Routenberechnungseinrichtung vorgegebenen Startort SO, indirektes Zwischenziel IZ und Zielort ZO zu sehen. Zwischen SO und IZ wird eine Zwischenroute berechnet, die in dem dargestellten Fall aus nur vier wesentlichen Knoten zwischen SO und IZ bestehen soll. Anhand von Kriterien, wie beispielsweise der flächenmäßigen Ausdehnung von IZ, wird eine Entfernung E1 festgelegt, welche auch als Kreis um IZ mit dem Radius E1 betrachtet werden kann. Es wird nun derjenige von den vier Knoten der Zwischenroute zwischen SO und IZ ausgewählt, welcher am weitesten von IZ entfernt ist, aber noch innerhalb der Entfernung E1 liegt. Dieser Knoten wird als direktes Zwischenziel DZ1 definiert und die Zwischenroute wird an diesem Knoten gekürzt, so dass sich die erste Teilroute aus den Knoten SO, K1, K2, K3 und DZ1 zusammensetzt. Ausgehend von DZ1 wird danach eine zweite Teilroute zu ZO berechnet, welche die Knoten K4 bis K7 enthält. Die gestrichelt eingezeichnete Gesamtroute wird aus den beiden Teilrouten zusammengesetzt und führt in einer Entfernung, die ein wenig kleiner ist als E1, an dem indirekten Zwischenziel IZ vorbei.In Fig. 1 In the background you can see the outline of a map of Germany. On a greatly enlarged scale, the start location SO, indirect intermediate destination IZ and destination location ZO given by an operator of a route calculation device can be seen. Between SO and IZ an intermediate route is calculated, which in the case shown should consist of only four essential nodes between SO and IZ. On the basis of criteria, such as the areal extent of IZ, a distance E1 is defined, which can also be regarded as a circle around IZ with the radius E1. Now, one of the four nodes of the intermediate route between SO and IZ is selected which is farthest from IZ but still within the distance E1. This node is defined as a direct intermediate destination DZ1 and the intermediate route is shortened at this node, so that the first partial route consists of the nodes SO, K1, K2, K3 and DZ1. Starting from DZ1, a second partial route to ZO is then calculated, which contains the nodes K4 to K7. The dashed overall route is composed of the two sub-routes and leads at a distance that is slightly smaller than E1, past the indirect intermediate destination IZ.

Aus Fig. 2 geht die Vorgehensweise hervor, wenn IZ nicht durch ein sondern durch zwei direkte Zwischenziele DZ ersetzt wird. Zuerst wird, analog zu Fig. 1, eine erste Zwischenroute zwischen SO und IZ berechnet, dort der erste Knoten, der innerhalb E1 liegt, ausgewählt und als DZ1 definiert und die Zwischenroute an DZ1 zur ersten Teilroute abgekürzt. Anschließend wird eine zweite Zwischenroute zwischen IZ und ZO berechnet, auf der zweiten Zwischenroute wird der äußerste, innerhalb von E1 liegende Knoten bestimmt und als zweites direktes Zwischenziel DZ2 definiert. Die zweite Zwischenroute wird an DZ2 gekürzt, so dass sie zwischen DZ2 und ZO verläuft. Abschließend wird zwischen DZ1 und DZ3 eine dritte Teilroute berechnet und die gestrichelt dargestellte Gesamtroute aus den drei Teilrouten zusammengesetzt. Die Reihenfolge der einzelnen Schritte kann bis zu einem gewissen Grad variiert werden, da beispielsweise die Zwischenrouten beide gleichzeitig berechnet und DZ1 und DZ2 gleichzeitig bestimmt werden können.Out Fig. 2 the procedure emerges if IZ is not replaced by one but by two direct intermediate goals DZ. First, analogously to Fig. 1 , calculates a first intermediate route between SO and IZ, where the first node located within E1 is selected and defined as DZ1, and the intermediate route at DZ1 is abbreviated to the first partial route. Subsequently, a second intermediate route between IZ and ZO is calculated, on the second intermediate route the outermost node lying within E1 is determined and defined as a second direct intermediate destination DZ2. The second intermediate route is shortened to DZ2 so that it runs between DZ2 and ZO. Finally, a third partial route is calculated between DZ1 and DZ3 and the total route shown in dashed lines is composed of the three partial routes. The order of the individual steps can be varied to some extent For example, since the intermediate routes are both calculated simultaneously and DZ1 and DZ2 can be determined simultaneously.

Mit Fig. 3 wird verdeutlicht, wie die Entfernung zur Auswahl eines Knotens einer Zwischenroute festgelegt wird. Um das indirekte Zwischenziel IZ ist ein Rechteck gelegt, welches die flächenmäßige Ausdehnung von IZ kennzeichnet. Ausgehend von geometrischen Abmessungen dieses Rechtecks, beispielsweise einer Seitenlänge oder Diagonale, wird ein erster Wert als Entfernungwert festgelegt. Dieser wird im hier dargestellten Fall mit fünf unterschiedlichen Faktoren multipliziert, was zu fünf, unterschiedlich großen, gestrichelt eingezeichneten Kreisen um IZ führt. Jeder der fünf Faktoren entspricht einer Straßenklasse, wobei die höchste Straßenklasse, also die Autobahnen, mit dem größten Faktor verknüpft sind und damit auch zum äußersten Kreis führen.
Nachdem die Zwischenroute zwischen SO und IZ berechnet wurde, wird mit der Suche nach dem das indirekte Zwischenziel ersetzenden Knoten begonnen. Dafür wird der größte der fünf Radien als sogenannter zweiter Entfernungswert E2 festgelegt. Dieser Entfernungswert E2 bestimmt alle innerhalb des äußeren Kreises befindlichen Knoten der Zwischenroute zwischen SO und IZ als Menge der potentiellen direkten Zwischenziele, die IZ ersetzen können. An dem ersten außerhalb von E2 liegenden Knoten kann nun mit der Suche begonnen und in Richtung IZ durchgeführt werden. Dazu wird der jeweils nächste Knoten in Richtung IZ auf seine zugehörige Straßenklasse abgefragt und ihm entsprechend der Straßenklasse einer der fünf Radien zugeordnet. Liegt der betrachtete Knoten innerhalb des ihm zugeordneten Radius, so ist das direkte Zwischenziel gefunden. In Fig. 3 liegt ein Knoten K1 zwischen dem äußeren Radius E2 und dem nächstkleineren Radius. Dieser Knoten hat die zweithöchste Straßenklasse, d.h. der Straßenabschnitt, auf dem er liegt, ist eine Bundesstraße. Ihm wird also der zweitgrößte Radius als zu überprüfender Entfernungswert zugeordnet. Da K1 außerhalb des zweitgrößten Radius liegt, muss die Suche fortgesetzt werden. Der nächste, ebenfalls auf einer Bundesstraße befindliche Knoten liegt dann bereits innerhalb des ihm zugeordneten Radius, womit das direkte Zwischenziel DZ1 gefunden ist. Der ihm zugeordnete Radius wird als erster Entfernungswert E1 bezeichnet. Zwischen SO und DZ1 wird nun die erste Teilroute TR1 bestimmt und ausgehend von DZ1 die zweite Teilroute TR2 berechnet.With Fig. 3 Clarifies how to set the distance to select an intermediate route node. Around the indirect intermediate destination IZ is a rectangle, which indicates the areal extent of IZ. Based on geometric dimensions of this rectangle, such as a page length or diagonal, a first value is set as the distance value. In the case presented here, this is multiplied by five different factors, which leads to five differently sized dashed circles around IZ. Each of the five factors corresponds to a road class, with the highest road class, the highways, being linked to the largest factor, leading to the outermost circle.
After the intermediate route between SO and IZ has been calculated, the search for the node replacing the indirect intermediate destination is started. For this, the largest of the five radii is defined as the so-called second distance value E2. This distance value E2 determines all nodes of the intermediate route between SO and IZ within the outer circle as the set of potential direct intermediate destinations that can replace IZ. At the first node outside of E2, the search can now be started and carried out in the direction IZ. For this purpose, the next node in the direction of IZ is queried for its associated road class and assigned to one of the five radii corresponding to the road class. If the considered node lies within the radius assigned to it, the direct intermediate destination is found. In Fig. 3 A node K1 lies between the outer radius E2 and the next smaller radius. This node has the second highest road class, ie the stretch of road on which it lies is a federal highway. It is therefore assigned the second largest radius as the distance value to be checked. Since K1 is outside the second largest radius, the search must continue become. The next node, also located on a main road, is then already within the radius assigned to it, whereby the direct intermediate destination DZ1 is found. The radius assigned to it is referred to as the first distance value E1. Between SO and DZ1, the first partial route TR1 is determined and, starting from DZ1, the second partial route TR2 is calculated.

Das in Verbindung mit Fig. 3 beschriebene Vorgehen zur Suche nach dem das indirekte Zwischenziel IZ ersetzenden Knoten DZ1 auf einer Zwischenroute bedeutet für den in Fig. 2 gezeigten Fall von zwei Zwischenrouten und zwei zu suchenden Knoten DZ1 und DZ2, dass die Entfernungswerte für DZ1 und DZ2 je nach Straßenklasse der Knoten unterschiedlich groß ausfallen können. Dann müsste in Fig. 2 für DZ1 ein Radius E1 und für DZ2 beispielsweise ein größerer Radius E3 eingezeichnet werden.That in conjunction with Fig. 3 described procedure for the search for the indirect intermediate destination IZ replacing node DZ1 on an intermediate route means for the in Fig. 2 In the case shown of two intermediate routes and two nodes DZ1 and DZ2 to be searched, the distance values for DZ1 and DZ2 may vary in size depending on the road class of the nodes. Then it would have to be in Fig. 2 for DZ1 a radius E1 and for DZ2 for example a larger radius E3 are drawn.

In bestimmten Fällen kann es vorkommen, dass ausgehend vom größten Radius und der ihm zugeordneten Straßenklasse sich die Straßenklassen der betrachteten Knoten mehrfach ändern. Dann kann es sinnvoll sein, die Suche nach einer bestimmten Anzahl von Klassenwechseln gezielt abzubrechen, um eine sinnvolle Gesamtroute zu generieren. Der Benutzer hat bei der Wahl seines indirekten Zwischenzieles sicherlich nicht beabsichtigt, über mehrere Kreuze und Abzweigungen möglichst nah an dieses Zwischenziel herangeführt zu werden, sondern er möchte in vernünftiger Entfernung daran vorbeigeleitet werden.In certain cases, it may happen that, starting from the largest radius and the road class assigned to it, the road classes of the considered nodes change several times. Then it may be useful to cancel the search for a certain number of class changes in order to generate a meaningful overall route. The user has certainly not intended to be introduced as close as possible to this interim destination by means of several crosses and junctions when choosing his indirect interim destination, but he would like to be guided past it at a reasonable distance.

Die in Fig. 3 dargestellten, den einzelnen Straßenklassen zugeordneten Radien können über die Betrachtung des durch SO, IZ und ZO aufgespannten Dreieckes noch weiter verändert werden. Einige Sonderfälle dieses Dreieckes sind in den Figs. 4 bis 6 abgebildet. So befindet sich IZ in Fig. 4 relativ nah an SO. Wird zwischen SO und ZO eine Route möglichst über Autobahn gewählt, so wird der größte Radius um IZ relativ großzügig sein. Dies könnte jedoch dazu führen, dass das gefundene direkte Zwischenziel auf der Direktverbindung zwischen SO und ZO liegt, also auf der optimalen Route zwischen SO und ZO. Da der Benutzer jedoch eine Änderung der Route beabsichtigt, sollten die um IZ gelegten Radien eher klein ausfallen. Dies wird erreicht, indem das Verhältnis der Seiten a zu b betrachtet wird. Fällt dieses deutlich ungleich Eins aus, so befindet sich IZ nahe an SO oder ZO und die Radien werden klein gewählt.In the Fig. 3 radii assigned to the individual road classes can be further modified by considering the triangle formed by SO, IZ and ZO. Some special cases of this triangle are in the Figs. 4 to 6 displayed. So is IZ in Fig. 4 relatively close to SO. If a route between SO and ZO is selected via motorway, the largest radius around IZ will be relatively generous. However, this could lead to the found direct intermediate destination lies on the direct connection between SO and ZO, ie on the optimal route between SO and ZO. However, since the user intends to change the route, the radii around IZ should be rather small. This is achieved by considering the ratio of sides a to b. If this is clearly not equal to one, then IZ is close to SO or ZO and the radii are chosen to be small.

Einen anderen Sonderfall zeigt Fig. 5. Hier liegt IZ weit ab von der optimalen Route zwischen SO und ZO. Eine Betrachtung des Winkels α mit dem Scheitelpunkt in IZ macht dies deutlich. Da dieser Winkel nur eine geringe Größe aufweist, sind größere Radien um IZ zu legen, um ein unnötiges Hin- und Zurückfahren auf einer und derselben Strecke nahe IZ zu vermeiden.Another special case shows Fig. 5 , Here IZ is far from the optimal route between SO and ZO. A consideration of the angle α with the vertex in IZ makes this clear. Since this angle is small in size, larger radii are to be set around IZ to avoid unnecessary back and forth driving on the same distance near IZ.

Der Sonderfall aus Fig. 6 zeigt IZ zwar nahezu mittig zwischen SO und ZO, jedoch befindet sich IZ sehr nahe an der optimalen Route zwischen SO und ZO, was sich in einem kleinen Winkel β mit dem Scheitel an SO ausdrückt. Eine normale Berechnung der Radien nur anhand der flächenmäßigen Ausdehnung von IZ und der Straßenklassen könnte dazu führen, dass das gefundene direkte Zwischenziel ebenfalls genau auf der optimalen Route liegt. Um wiederum dem Wunsch des Bedieners zu folgen, werden die Radien um IZ bei kleinem Winkel β verkleinert.The special case Fig. 6 Although IZ is almost midway between SO and ZO, IZ is very close to the optimal route between SO and ZO, which is expressed at a small angle β with the vertex at SO. A normal calculation of the radii only on the basis of the areal extent of IZ and the road classes could lead to the found direct intermediate destination also being exactly on the optimal route. Again, to follow the operator's request, the radii are reduced by IZ at a small angle β.

Die Fig. 7 zeigt abschließend das tatsächlich auf einer Ausgabeeinheit eines Navigationssystems dargestellte Ergebnis einer erfindungsgemäßen Routenberechnung im Vergleich zu einer bisher mit demselben Navigationssystem möglichen Routenberechnung über Zwischenziele. Startort SO ist Nürnberg, indirektes Zwischenziel IZ ist Regensburg und Zielort ZO ist München. Wie in dem auf der rechten Seite herausgezogenen vergrößerten Bildausschnitt von IZ zu erkennen ist, führt die nach dem erfindungsgemäßen Verfahren berechnete Route in einem deutlichen Abstand an Regensburg vorbei. Ein Herunterfahren von der Autobahn wird vollständig vermieden. In dem linken Bildausschnitt ist zu erkennen, das nach dem bisherigen Verfahren IZ wie ein direktes Zwischenziel behandelt wurde und die vorgeschlagene Route bis ins Stadtzentrum von Regensburg hineinführt. Auf den dargestellten Routen sind einzelne Knoten als dickere Punkte entlang der Strecke hervorgehoben.The Fig. 7 finally shows the result actually displayed on an output unit of a navigation system of a route calculation according to the invention in comparison to a route calculation via intermediate destinations that was previously possible with the same navigation system. Start Location SO is Nuremberg, indirect stopover IZ is Regensburg and destination ZO is Munich. As can be seen in the magnified image section of IZ extracted on the right-hand side, the result calculated by the method according to the invention is Route at a considerable distance past Regensburg. A shutdown of the highway is completely avoided. It can be seen in the left-hand section of the picture that the previous method IZ treated it as a direct intermediate destination and that the proposed route leads into the city center of Regensburg. On the routes shown, individual nodes are highlighted as thicker points along the route.

Claims (17)

  1. Method for determining an overall route, consisting of at least two subroutes (TR1, TR2), between a first location (SO) and a second location (ZO/DZ2) by means of a route calculation device, the subroutes consisting of nodes and edges, and the overall route leading past an indirect intermediate destination (IZ), characterized by the steps of
    - calculating a first intermediate route between the first location and the indirect intermediate destination,
    - determining a node on the first intermediate route as a first direct intermediate destination, the node being located within a distance, dependent on first criteria, from the indirect intermediate destination,
    - stipulating the first subroute (TR1) between the first location (SO) and the first direct intermediate destination,
    - calculating the second subroute (TR2) between the first direct intermediate destination and a second location (ZO/DZ2), and
    - combining the first and the second subroutes to form the overall route.
  2. Method according to Claim 1, characterized in that the first direct intermediate destination is selected from a first set of potential direct intermediate destinations, the first set of potential direct intermediate destinations being composed of the nodes of the first intermediate route, which are located within a distance, dependent on second criteria, from the direct intermediate destination (IZ).
  3. Method according to Claim 1 or 2, characterized in that the second location is a second direct intermediate destination (DZ2), a third subroute to a third location (ZO) is calculated starting from this second direct intermediate destination, and the third subroute is added to the overall route.
  4. Method according to Claim 3, characterized in that the second direct intermediate destination (DZ2) is determined via the steps of
    - calculating a second intermediate route between the indirect intermediate destination and the third location, and
    - determining a node on the second intermediate route as the second direct intermediate destination, the node being located within a distance, dependent on first criteria, from the indirect intermediate destination.
  5. Method according to Claim 4, characterized in that the second direct intermediate destination (DZ2) is selected from a second set of potential direct intermediate destinations, the second set of potential direct intermediate destinations being composed of the nodes of the second intermediate route, which are located within a distance, dependent on second criteria, from the direct intermediate destination.
  6. Method according to one of the preceding claims, characterized in that the areal extent of the indirect intermediate destination (IZ) belongs to the first and/or second criteria.
  7. Method according to one of the preceding claims, characterized in that the classification of the roads belonging to the intermediate routes belongs to the first and/or second criteria.
  8. Method according to one of the preceding claims, characterized in that the geometrical relationships of a triangle defined by the first location (SO), the indirect intermediate destination (IZ) and the second location (ZO, DZ2) belong to the first and/or second criteria.
  9. Method according to one of the preceding Claims 3 to 7, characterized in that the geometrical relationships of a triangle defined by the first location (SO), the indirect intermediate destination (IZ) and the third location (ZO) belong to the first and/or second criteria.
  10. Method according Claim 8 or 9, characterized in that a ratio of the length of two sides of the triangle belongs to the first and/or second criteria.
  11. Method according to Claims 8 to 10, characterized in that the size of an angle of the triangle belongs to the first and/or second criteria.
  12. Method according to one of the preceding claims, characterized in that the first and/or second criteria can be adapted to different users of the route calculation unit and can be configured as a function of the current user.
  13. Method according to one of the preceding claims, characterized in that the first and/or second criteria can be adapted to different geographical regions and can be configured as a function of the geographical region currently to be travelled on.
  14. Navigation system having
    - an arithmetic logic unit for calculating an overall route, consisting of at least two subroutes (TR1, TR2), in accordance with the method according to one of Claims 1 to 13,
    - an input unit, connected to the arithmetic logic unit, for inputting an indirect intermediate destination (IZ), and
    - an optical output unit connected to the arithmetic logic unit.
  15. Navigation system according to Claim 14, characterized in that the optical output unit is designed for graphically displaying a map, it being possible for at least the indirect intermediate destination, the first location and the second or the third location, as well as the course of the overall route, to be graphically highlighted on the map.
  16. Navigation system according to Claim 15, characterized in that during a calculation of the overall route between the first and the third locations the output unit displays the same course of the overall route as in the case of a calculation of the overall route between the third and the first locations.
  17. Navigation system according to one of the preceding Claims 14 to 16, characterized in that the navigation system includes a memory unit for storing configuration files, the configuration files being used to determine the first and/or second criteria.
EP20040102432 2003-06-30 2004-06-01 Method and navigation apparatus to determine a route with intermediate destinations Expired - Fee Related EP1494193B8 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE2003129507 DE10329507A1 (en) 2003-06-30 2003-06-30 Method and navigation system for route determination with intermediate destinations
DE10329507 2003-06-30

Publications (4)

Publication Number Publication Date
EP1494193A2 EP1494193A2 (en) 2005-01-05
EP1494193A3 EP1494193A3 (en) 2006-10-18
EP1494193B1 true EP1494193B1 (en) 2008-02-13
EP1494193B8 EP1494193B8 (en) 2008-05-07

Family

ID=33426798

Family Applications (1)

Application Number Title Priority Date Filing Date
EP20040102432 Expired - Fee Related EP1494193B8 (en) 2003-06-30 2004-06-01 Method and navigation apparatus to determine a route with intermediate destinations

Country Status (2)

Country Link
EP (1) EP1494193B8 (en)
DE (2) DE10329507A1 (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080208445A1 (en) * 2007-02-28 2008-08-28 Garmin Ltd. Route shaping systems and methods
JP6020150B2 (en) * 2012-12-27 2016-11-02 日産自動車株式会社 Vehicle information providing device
US11747153B1 (en) 2022-07-21 2023-09-05 Travelshift ehf. Apparatus and associated method for determining a travel itinerary

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5712788A (en) * 1995-02-09 1998-01-27 Zexel Corporation Incremental route calculation
US6112154A (en) * 1997-05-22 2000-08-29 Siemens Aktiengesellschaft Method and apparatus for determining a route on a digitized road network stored in the memory of a navigation system
DE19928295A1 (en) * 1999-06-22 2000-12-28 Bosch Gmbh Robert Determining route from initial position to destination involves storing route borders optimised with route search algorithm in route table, specifying intermediate destination(s)
US6401034B1 (en) * 1999-09-02 2002-06-04 Navigation Technologies Corp. Method and system for finding intermediate destinations with a navigation system
DE10036817A1 (en) * 2000-07-28 2002-02-14 Bosch Gmbh Robert Route calculation method

Also Published As

Publication number Publication date
EP1494193A3 (en) 2006-10-18
EP1494193A2 (en) 2005-01-05
EP1494193B8 (en) 2008-05-07
DE10329507A1 (en) 2005-02-10
DE502004006162D1 (en) 2008-03-27

Similar Documents

Publication Publication Date Title
EP1105696B1 (en) Method and device for determining a route from a starting location to a final destination
DE4219326C2 (en) Traffic information display system
DE69935184T2 (en) Method and system for generating a navigation route
DE60130054T2 (en) Method and device for route guidance
DE102004020557B4 (en) Route recommendation calculation method and navigation device
DE102008061981B4 (en) navigation device
DE102012016768A1 (en) Technique for processing cartographic data for determining energy efficient routes
EP2020589A2 (en) Method for displaying a schematic representation of a maneuver in a navigation system
DE19703436A1 (en) Vehicle bound navigation arrangement
EP1272814A1 (en) Route planning method for use in a navigation system
DE102007038463A1 (en) Method for operating a navigation system
EP0942403B1 (en) Method and device for representation of information for a navigational apparatus
DE4334701A1 (en) Navigation system with a route determination process that is able to determine a desired route quickly and completely
DE112009005327T5 (en) Map drawing device
EP2288872A1 (en) Method and device for calculating a navigation route to associated destinations
EP1357359B1 (en) Navigation device and method for route planning
EP1423661A1 (en) Method for determining routes and associated navigation system
EP2156142B1 (en) Method and arrangement for displaying route guidance instructions
EP2423643B1 (en) Technique for monitor-based route manipulation
EP1494193B1 (en) Method and navigation apparatus to determine a route with intermediate destinations
EP1249992A2 (en) Method of operating an automated yellow pages system
DE102017207545A1 (en) Method for providing a text-based description of at least one route for a drive of a motor vehicle and control device and motor vehicle
WO2014184031A1 (en) Method for operating a navigation system, navigation system and motor vehicle
EP1359393B1 (en) Motor vehicle navigation system and method for selecting a designation
EP2288873A1 (en) Method for operating a navigation system

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL HR LT LV MK

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL HR LT LV MK

17P Request for examination filed

Effective date: 20061107

AKX Designation fees paid

Designated state(s): DE FR GB IT

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB IT

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: SIEMENS VDO AUTOMOTIVE AG

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

Free format text: NOT ENGLISH

RAP2 Party data changed (patent owner data changed or rights of a patent transferred)

Owner name: VDO AUTOMOTIVE AG

REF Corresponds to:

Ref document number: 502004006162

Country of ref document: DE

Date of ref document: 20080327

Kind code of ref document: P

RAP2 Party data changed (patent owner data changed or rights of a patent transferred)

Owner name: CONTINENTAL AUTOMOTIVE GMBH

ET Fr: translation filed
PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20081114

REG Reference to a national code

Ref country code: FR

Ref legal event code: TP

Owner name: CONTINENTAL AUTOMOTIVE GMBH, DE

Effective date: 20111104

Ref country code: FR

Ref legal event code: CD

Owner name: CONTINENTAL AUTOMOTIVE GMBH, DE

Effective date: 20111104

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20120622

Year of fee payment: 9

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: IT

Payment date: 20120626

Year of fee payment: 9

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20130601

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20130601

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20130601

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 13

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 14

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 15

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20180626

Year of fee payment: 15

REG Reference to a national code

Ref country code: DE

Ref legal event code: R084

Ref document number: 502004006162

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190630

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20200630

Year of fee payment: 17

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 502004006162

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220101