DE102011075327A1 - Method for determining route from location to another location for e.g. portable navigation system in motor vehicle, involves determining sub route from target node point to location, and determining route based on sub route - Google Patents

Abstract

The method involves determining (S5) geographical regions e.g. city regions, based on locations. An output node point and a target node point are determined (S9) from groups of node points based on the regions, respectively. A sub route from the output node point to the target node point, another sub route from one of the locations to the output node point, and a third sub route from the target node point to the other location are determined (S11) by digital card data, which is preset for quantities of road hierarchy planes e.g. main roads. A route is determined (S13) based on the sub routes. An independent claim is also included for a route determining device.

Description

The invention relates to a method and a route determining device for determining at least a first route.

For example, a navigation system may plan a route and guide a user of the navigation system along a predetermined route. Navigation systems are predominantly designed, depending on a start position or a current position and a target position to calculate a route between the start and end position. Often use in such navigation systems optimization algorithms for determining the route. For example, if the navigation system is used in a motor vehicle, the route may be calculated such that a traveling time of the route is as small as possible.

It is an object of the invention to provide a method and a route determining device for determining at least one first route, which enables a rapid determination of an advantageous route.

The object is solved by the features of the independent claims. Advantageous embodiments of the invention are specified in the subclaims.

The invention is characterized by a method and a corresponding route determining device for determining at least one first route from a first location to a second location. Depending on the first location, a first geographic area is identified, which comprises the first location and to which a first group of predetermined first nodes is assigned. Furthermore, depending on the second location, a second geographical area is determined which comprises the second location and to which a second group of predetermined second nodes is assigned. Depending on the second geographical area, an exit node is determined from the first group of the first nodes of the first geographic area. Furthermore, depending on the first geographical area, a destination node is determined from the second group of the second nodes of the second geographical area. A first partial route from the parent node to the destination node is determined by means of digital map data given for a predetermined first set of street hierarchy levels. A second sub-route from the first location to the exit node is determined by digital map data given for a predetermined second set of street hierarchy levels, and a third sub-route from the destination node to the second location is determined by digital map data corresponding to a predetermined third set are predefined by street hierarchy levels. The first route is determined depending on the first, second and third partial route.

Advantageously, the first route can thus be determined very quickly. The first, second and / or third partial route can be determined simultaneously. Depending on the second geographic area, the parent node may be selected from the first group of first nodes of the first geographic area. Depending on the first geographic area, the destination node may be selected from the second group of second nodes of the second geographic area.

Depending on a geographical location of the first and / or the second location, the first location and / or the second location may be assigned to a first geographical area or a second geographical area. In this case, the first and second geographical areas may represent an agglomeration area and / or a catchment area of a large city in which the first or the second location is located. For example, a node represents a transition from a street of a specific street hierarchy level to a street of another street level hierarchy. The node may also represent a transition from one street of a specific street hierarchy level to another street of the same street hierarchy level, for example a motorway interchange. For example, a first level of street hierarchy may include freeways and highways, a second level of street hierarchy, for example, highways and main roads, and a third level of street hierarchy, for example, residential streets and / or minor streets. A set of street hierarchy levels may include, for example, the first and / or the second and / or the third street hierarchy level. In particular, the first nodes of the first group represent the nodes that are frequently used for route connection between the first area and other areas, the respective second areas. With a longer route that connects two places in different areas, roads with different levels of street hierarchy are likely to be used. Therefore, the longer route is likely to include characteristic nodes that are part of the route due to their nature, for example, a geographical location, transition from a highway to a specific highway, even if the route is determined several times. On the basis of this knowledge, in the method according to the invention at least a part of these nodes are predetermined, so that a determination of these nodes can be omitted and thus the determination of the first route can be made much faster. These nodes can be determined independently of the determination of the first route and stored in a suitably trained database, so that, for example, a suitably trained navigation device can access it when determining the first route.

Preferably, the method according to the invention is used to determine the first route if the area determined for the first location is not equal to the second area determined for the second location. Preferably, the at least one first route is determined for a motor vehicle. The route determining device may be, for example, a navigation system, which may be a mobile navigation system or may be permanently installed in a motor vehicle. For example, route guidance can be carried out on the basis of the determined route.

In an advantageous embodiment, the first partial route, the second partial route and / or the third partial route are each determined such that the first partial route, the second partial route and / or the third partial route is optimal with respect to at least one predetermined parameter. By way of example, the parameter may include a journey duration and / or a fuel consumption and / or a travel distance of a journey from a respective starting point to a corresponding destination point of the respective sub-route. For this purpose, a cost function for each sub-route can be determined in each case, which is optimized with respect to one or more of the parameters.

In a further advantageous refinement, the first partial route, the second partial route and / or the third partial route is determined for a group of predefined parameters for the respective parameter in such a way that it is optimal in relation to this parameter and optimized as a function of the parameter used Partial routes the first route is determined. This allows for a vehicle user to provide multiple first routes so that the vehicle user can select a desired route. For example, the vehicle user can select a route with the shortest travel time.

In a further advantageous embodiment, at least the first route and / or at least a majority of the first routes determined for the group of parameters are output by means of an output unit.

In a further advantageous embodiment, the second and the third set of street hierarchy levels are the same. The second and third sets may include a plurality of road hierarchy levels such that, for example, the second set and the third set include all types of roads, for example minor roads, residential roads, main roads, highways, highways, and highways. Advantageously, this allows a reliable determination of an advantageous first route.

In a further advantageous embodiment, the first set of street hierarchy levels is a subset of the second and / or the third set. This makes it possible to quickly determine the first route, since a small number of possible routes from the first exit node to the destination node are determined for the first partial route. For example, for this purpose, the first set may include only first street hierarchy levels, and the first and second sets may include the first, second, and third street hierarchy levels.

In an advantageous embodiment, the first partial route is predetermined from the starting node to the destination node. This allows a very fast determination of the first route. The first partial route may in this case be stored, for example, in a memory of the route determination device.

Embodiments of the invention are explained in more detail below with reference to schematic drawings. Show it:

1 a route determining device,

2 a flow chart of a program for determining a first route,

3 a flowchart of a program for determining a plurality of first routes,

4 a schematic representation of a first geographical area and a second geographical area with first nodes or second nodes and

5 a node table.

Elements of the same construction or function are identified across the figures with the same reference numerals.

A route determination device 1 ( 1 ) comprises an output unit 30 and at least one operating unit 20 , Furthermore, the route determining device 1 a memory 12 and an interface 40 exhibit. The route determination device 1 For example, it may be a mobile navigation device and / or a navigation device permanently installed in a motor vehicle. The route determination device 1 includes, for example, a control unit 10 indicating the operations in the route determining device 1 controls.

the interface 40 includes, for example, a wireless communication interface and / or a memory card interface and / or a serial data interface and / or a CD and / or DVD drive. By means of the interface 40 For example, predefined files can be read in which have data that can be used for route determination.

The output unit 30 has, for example, an optical display device, for example a screen and / or a touchscreen. Furthermore, the output unit 30 an acoustic signaling device, for example a loudspeaker. By means of the optical display device, for example, maps and / or selection menus and / or directories can be displayed. For example, by means of a menu, a determined travel route and / or a plurality of determined travel routes can be output. This can allow the user, for example a driver of the motor vehicle, in a particularly simple and advantageous manner to select a route from the plurality of routes. For example, the travel route and / or a plurality of travel routes can be displayed on the screen. For example, the routes may be displayed as multicolored routes in a map. By way of example, driving instructions can be output acoustically to a vehicle driver by means of the acoustic display device.

The operating unit 20 For example, it may include a plurality of buttons and / or one or more knobs, by means of which a vehicle user may initiate one or more function calls, for example. If the output unit 30 is a touchscreen, the control element can also be displayed on the touchscreen and operated via the touchscreen. If the navigation device comprises a voice control or a gesture control, the control element can also have a microphone or a photosensor. User inputs, such as a first location A (starting point) and a second location Z (destination point) of a route, can be accessed via the operating unit 20 done, for example by means of the button, the touch screen and / or voice control. The route determination device 1 then determines, for example georeference data of the current position of the route determining device 1 and / or the motor vehicle in which the route determining device 1 is arranged. In particular, the first location, the second location, a first T1, second T2, and / or third partial route T3 can thus be assigned to a digital map, so that they are used by the route determination facility for route planning and / or route guidance 1 be taken into account.

In the store 12 For example, data is stored which can be used for route determination.

In the store 12 the route determining device 1 is preferably a program ( 2 ) for operating the route determining device 1 stored. The program serves that the route determining device 1 at least a first route R from a first location A to a second location Z determined. Furthermore, in the memory 12 Data are stored, for example, have predetermined node tables that can be used for route determination with the program.

The program is preferably started in a step S1 in which variables are initialized if necessary.

In a step S3, it is first checked whether the first location and / or the second location are present, that is to say assigned to predefined digital map data.

This can be done, for example, by activating the route determination device 1 be recognized, for example, by a user input of the first location A and the second location Z, for example by an input via the button, the touch screen and / or voice control. Alternatively or additionally, it is also possible that the route determining device 1 is formed, depending on a position signal or other sensor signals, a current location of the route determining device 1 and / or of the motor vehicle and this is used as the first place A.

If the operation of the step S3 is satisfied, the processing is continued in a step S5. If the operation of step S3 is not fulfilled, the processing can be continued again in step S3.

In a step S5, depending on the first location A, a first geographical area B1 comprising the first location A and, depending on the second location Z, a second geographical area B2 comprising the second location Z are determined. The first geographical area B1 is associated with a first group of first nodes K1 and the second geographical area B2 is associated with a second group of second nodes K2.

In a step S7, it is first checked whether the first geographical area B1 and the second geographical area B2 are not identical and thus the first location A and the second location Z can be assigned to different geographical areas. The first location A may be, for example Be suburb of a first city and the second place Z may for example be a suburb of a second city. Depending on, for example, the geographical data and / or a postal code of the first location A, this can for example be assigned to a first city or a first catchment area. In an analogous manner, the second location can be assigned to a second metropolis or to a second catchment area.

If the condition of step S7 is satisfied, the processing in step S9 is continued. If the condition of step S7 is not satisfied, the processing in step S15 is ended.

In step S9, depending on the second geographical area B2, an output node K1_A is determined from the first group of the first nodes K1 of the first area. Furthermore, depending on the first geographical area B1, a destination node K2_Z is determined from the second group of the second nodes K2 of the second geographical area B2.

In the store 12 For example, a node table ( 5 ), from which the respective output node K1_A and destination node K2_Z for predetermined first geographical areas B1 and second geographical areas B2 can be taken. The geographical areas B1, B2 can be assigned to a country, e.g. B. Germany, or belong to a larger region, eg. Eg Europe. Assuming that in each case the first geographical areas B1 are entered in the first column and the second geographical areas B2 are in the first line, the starting node K1_A can be taken from the respective table field. In some cases, a first output node K1_A and a second output node K1_A are indicated, with the second output node K1_A being considered as an alternative. Assuming that in each case the second geographical areas B2 are entered in the first column and the first geographical areas B1 are in the first line, the destination node K2_Z can be taken from the respective table field. In some cases, a first destination node K2_Z and a second destination node K2_Z are indicated, wherein the second destination node K2_Z is to be regarded as an alternative.

In a step S11, the first partial route T1 is determined from the output node K1_A to the destination node K2_Z by means of digital map data, which are predetermined for a predetermined first set of street hierarchy levels. Further, the second partial route T2 is determined from the first location A to the exit node K1_A by means of digital map data predetermined for a predetermined second set of street hierarchy levels. Furthermore, the third partial route T3 is determined from the destination node K2_Z to the second location Z by means of digital map data which are predetermined for a predetermined third set of street hierarchy levels.

Here, for example, the first partial route T1, the second partial route T2 and / or the third partial route T3 can each be determined such that the first partial route T1, the second partial route T2 and / or the third partial route T3 are optimal with respect to at least one predetermined characteristic. The partial routes T1, T2, T3 can be determined, for example, by means of a Dijkstra algorithm or a modified Dijkstra algorithm. The partial routes T1, T2, T3 can also be determined by means of an A * algorithm or a modified A * algorithm. These algorithms allow a particularly reliable and fast determination of a shortest path between a starting point and a destination point.

It is also possible that the predetermined parameter for the first T1 and / or second T2 and / or third partial route T3 is the same or different.

Alternatively, it is also possible that the first partial route T1 is predetermined. The route data for the first partial route T1 may be in the memory, for example 12 be saved.

The first set of street hierarchy levels is, for example, a subset of the second and / or third set. The second amount and the third amount are the same, for example. Thus, for example, only highways and highways can be taken into account when determining the first partial route T1, while all types of streets are taken into account when determining the second partial route T2 and third partial route T3.

In a step S13, the first route R is determined as a function of the first T1, second T2 and third partial route T3, for example by an arrangement of the partial routes T1, T2, T3 in a correct sequence. The first route R can by means of the output unit 30 be issued.

If the node table has, for example, two node pairs for the connection of the first geographical area B1 and the second geographical area B2, the program can continue in the step S11 and start the partial routes T1, T2 from a further exit node K1_A and a further destination node K2_Z. Determine T3.

In a step S15, the program can be ended. Preferably, the program regularly during operation of the route calculation device 2 processed.

On the storage medium of the route calculating device 2 is preferably another program ( 3 ) for operating the route calculation device 2 stored. The further program serves that the route calculation device 2 determined for a group of predetermined characteristics for the respective characteristic, the first route R from the first location A to the second location Z, so that a vehicle user can select one of the first routes R.

The steps S21 to S29 of the second program correspond to the steps S1 to S9 of the first program.

In a step S31, the first partial route T1, the second partial route T2 and the third partial route T3 are determined and optimized with respect to a predefined first parameter PAR from a group of predefined parameters. In a step S33, the first route R is determined as a function of the partial routes T1, T2, T3, for example by an arrangement of the partial routes T1, T2, T3 in a correct sequence.

In a step S34, the program is continued again in step 31 by means of a loop instruction NEXT, in which case the partial routes T1, T2, T3 are determined and optimized with respect to another predetermined additional parameter next_PAR.

The first or the further parameter may be the same or different for the first T1 and / or second T2 and / or third partial route T3.

The first routes R can by means of the output unit 30 be issued.

In a step S35, the program can be ended. Preferably, the program regularly during operation of the route calculation device 2 processed.

In 4 is an example of the first geographical area B1, for example, the Greater Munich, and the second geographical area B2, for example, Greater Milan, shown.

The first geographical area comprises the first group of first nodes K1, for example the most important motorway intersections or highway entrances in the Greater Munich area. Depending on the second geographical area B2, one of the first nodes K1 has been identified as an output node K1_A, for example a southern highway access to a given highway in the south.

The second geographical area comprises the second group of second nodes K2, for example the most important motorway junctions or motorway exits in the metropolitan area of Milan. Depending on the second geographical area B2, one of the second nodes K2 was determined to be the destination node K2_Z, for example a northern motorway exit from a given highway from the north. The first partial route T1 connects the output node K1_A with the destination node K2_Z. The second partial route T2 connects the first location A with the outlet node K1_A and the third partial route T3 connects the destination node K2_Z with the second location Z.

LIST OF REFERENCE NUMBERS

1

Route determination device

10

control unit

12

Storage

20

operating unit

30

output unit

40

interface

A

first place

B1

first geographic area

B2

second geographical area

K1

first node

K1_A

Output node

K2

second node

K2_Z

Destination node

next_PAR

further parameter

PAR

first parameter

R

first route

T1

first partial route

T2

second partial route

T3

third partial route

Z

second place

Claims (8)

Method For determining a first route (R) from a first location (A) to a second location (Z), in which - depending on the first location (A), a first geographical area (B1) is determined, which determines the first location (A) A) and to which a first group of predefined first nodes (K1) is assigned, - a second geographical area (B2) is determined depending on the second location (Z), which comprises the second location (Z) and a second group is assigned from predetermined second nodes (K2), - an output node (K1_A) is determined from the first group of the first nodes (K1) of the first area (B1), depending on the second geographical area (B2), Depending on the first geographical area (B1), a destination node (K2_Z) from the second group of second nodes (K2) of the second area (B2) is determined, - a first partial route (T1) from the starting node (K1_A) to the destination node (K2_A) is determined by means of digital map data, which are predetermined for a given first set of road hierarchy levels, - a second partial route (T2) from the first location (A) to the output node (K1_A) is determined by means of digital map data, which is for a given a third sub-route (T3) is determined from the destination node (K2_A) to the second location (Z) by means of digital map data predetermined for a predetermined third set of street hierarchy levels, - the first route (R ) is determined depending on the first (T1), second (T2) and third partial route (T3). Method according to Claim 1, in which the first partial route (T1), the second partial route (T2) and / or the third partial route (T3) are respectively determined such that the first partial route (T1), the second partial route (T2) and / or the third partial route (T3) are optimal with respect to at least one predetermined parameter. Method according to one of the preceding claims, in which the first partial route (T1), the second partial route (T2) and / or the third partial route (T3) is determined for a group of predefined parameters for the respective characteristic such that they relate to these Characteristics is optimal, and depending on the optimized for each characteristic sub-routes (T1, T2, T3), the first route (R) is determined. Method according to one of the preceding claims, in which at least the first route (R) and / or at least a majority of the first routes (R) which were determined for the group of parameters are determined by means of an output unit ( 30 ). A method according to any preceding claim, wherein the second and third sets of street hierarchy levels are the same. Method according to one of the preceding claims, wherein the first set of street hierarchy levels is a subset of the second and / or the third set. Method according to one of the preceding claims, in which the first partial route (T1) is predetermined from the output node (K1_A) to the destination node (K2_Z). Route determination device ( 1 ) for determining a first route (R) from a first location (A) to a second location (Z), which is designed to determine - depending on the first location (A), a first geographical area (B1) containing the first Location (A) and to which a first group of predetermined first nodes (K1) are assigned, - depending on the second location (Z) to determine a second geographical area (B2), which includes the second location (Z) and the one second group of predetermined second nodes (K2) is assigned, - depending on the second geographical area (B2) to determine an output node (K1_A) from the first group of the first nodes (K1) of the first geographical area (B1), - depending on the first geographical area (B1) to determine a destination node (K2_Z) from the second group of second nodes (K2) of the second geographical area (B2), - a first partial route (T1) from the parent node (K1_A) to the destination node p to determine a second partial route (T2) from the first location (A) to the exit node (K1_A) by means of digital map data predetermined for a given first set of street hierarchy levels predetermined second set of road hierarchy levels are specified, - a third partial route (T3) from the destination node point (K2) to the second location (Z) to be determined by means of digital map data, which are predetermined for a predetermined third set of street hierarchy levels, - the first route ( R) depending on the first (T1), second (T2) and third partial route (T3).

Images