EP2002211A2

EP2002211A2 - Method for operating a navigation system

Info

Publication number: EP2002211A2
Application number: EP07704149A
Authority: EP
Inventors: Ernst-Peter Neukirchner
Original assignee: Robert Bosch GmbH
Current assignee: Robert Bosch GmbH
Priority date: 2006-03-23
Filing date: 2007-01-26
Publication date: 2008-12-17
Also published as: US8447515B2; WO2007107393A3; WO2007107393A2; US20090187334A1; DE102006013388A1

Abstract

The invention relates to a method for operating a navigation system (1), in particular a navigation system for a motor vehicle, comprising a memory (2), a display unit (3) and at least one control element (4). Map data from a map data memory (5) is uploaded to the memory (2), said map data (71) being sub-divided into first map data and second map data. The first map data contains geometric data (76) of the margins of a map network that is stored as a graph and the second map data contains topological data (78). Applications are carried out by means of the first and/or second map data that has been uploaded to the memory (2).

Description

description

title

Method for operating a navigation system

Technical area

The invention relates to a method for operating a navigation system, in particular a navigation system for a motor vehicle, as well as such a navigation system and a related storage medium with map data.

State of the art

Navigation systems use map data for displaying a map section on a display, for route display and determination, for destination input, destination finding and for destination guidance of a driver-controlled vehicle, such as a motor vehicle.

This map data may be digital map data. In the map data, for example, roads are represented as so-called edges, with crossing points or branches of roads being represented as so-called nodes. In this case, the real road course is approximated by the edges and nodes, wherein the edges are described, for example, by a juxtaposition of straight edge sections. The representation of road networks is thus realized by means of directed graphs with edges and nodes. Depending on the complexity of an intersection, this is described by one node or by several nodes. Also, edges may be present within an intersection.

Also, digital maps are divided into individual area-by-area partitions, so that the data to be loaded into the memory of, for example, a navigation system can be limited by the amount of data since the amount of data is the size of the required Memory and the charging speed or processing speed. Typically, a division of the map data in the partitions along lines of constant geografϊscher length or width, so that approximately wise rectangular areas are defined as partitions. Because of this division, however, it is necessary to divide edges that intersect one or more such boundaries between partitions and to assign the divided edges to the respective adjacent partitions or to redundantly store them in the adjacent partitions or to reference them from one of the participating adjacent partitions.

A division of map data into partitions and a division of edges

Partition limits have become known through WO 99/58934.

However, the division of the edges causes additional amounts of data, since in the division of an edge for connecting the two partial edges, a node of the card network must be inserted. This causes, for example, in applications of a navigation system for route calculation, an additional burden by additional algorithmic steps.

The redundant storage of edges in multiple partitions has the disadvantage of increasing the amount of data. Also, in this case, when reading several

Partitions in a memory the respective application determine the redundant edges and sort out some times existing edge data, which also requires additional processing power and thus slows down the overall process.

The referencing of elements of other partitions has the disadvantage that more data has to be loaded into the memory than is currently required, for example for map display, not only the partitions to be loaded into the memory to be displayed, but also all partitions loaded into memory referenced by a reference.

Presentation of the invention, object, solution, advantages

The object of the invention is to provide a method for operating a navigation system in which the disadvantages of the prior art are reduced or even eliminated be avoided. Furthermore, it is an object of the invention to provide a navigation system by means of which the method according to the invention can be carried out. It is also the object to provide a storage medium with stored map data, which allows an improved process flow using map data.

According to the invention, the object is achieved by a method for operating a navigation system, in particular a navigation system for a motor vehicle, having a memory, a display unit and at least one control element, wherein map data are loaded from a map data memory into the memory, wherein the map data in first map data and second Map data are divided, with the first

Map data contain geometric data of edges of a map network stored as graphs and the second map data contain topological data and applications are performed by means of the first and / or second map data loaded in the memory. Geometric data are preferably datasets with data-oriented graphs of edge segments that determine the position of an edge or its edge

Represent history. Topological data is data between a starting point and an end point of an edge or an edge portion, such as a distance between the start and end points, etc. It is particularly advantageous that the digital map is structured such that applications containing the geometric contents require map data, find the full content in each partition, and that applications that only require topological content do not always need to read all partitions between a start point and an end point into memory.

As a result of this inventive division between geometrical data and topological data, applications, such as application programs which only require geometrical data, can access exclusively geometrical data records. Such applications are, for example, the map display of an area of a map on a display unit or the map-based location function in navigation systems.

Applications which preferably use only topological data are, for example, applications of the route calculation or the route guidance function. - A -

An advantage over the prior art is further that a division of elements, such as edges, on boundaries of partitions are made only for the geometric data and the topological data is not shared at boundaries between partitions, and thus with respect to the topological data no further effort arises and no additional data is generated.

Applications that use only topological data only read the data of those partitions that contain nodes of the topological data, the partitions in between are not needed. This is particularly useful for route calculations over long distances where there are no junctions, such as ferry routes or routes through areas with very thin road networks, such as deserts.

It is particularly advantageous if relations exist or are formed between data sets of the first map data and the second map data. Thus, an easy transferability of results between different applications can be realized. It is particularly advantageous if the relations or the data underlying the formation of the relations are stored as third map data. It is also expedient if the relations or the data underlying the formation of the relations are assigned to the first and / or second map data sets.

It is particularly advantageous if the relations or the data underlying the formation of the relations are stored independently of the first and / or second map data records. In this case, the relations or the data usable to form the relations can only be read into the memory when needed.

It is particularly advantageous if first, second and / or third card data records are assigned to the respective partitions of the card. It is also advantageous if the topological data sets belonging to the geometric data sets and preferably also their partitions are stored and in particular stored in association therewith. It is also expedient if, furthermore, the partitions in which geometrical data records which belong to the topological data records are stored or are assigned to them in an associated manner.

For better handling, storage or better allocation, it is expedient if first and / or second and / or third data records and / or partitions are designated by means of identifications. Such identifications may be, for example, numerical identifications.

According to the invention, the object with regard to the navigation system is achieved by a navigation system having a memory, a display unit and at least one operating element, the memory serving to store selected map data from a map data memory and to access applications to the memory and the map data stored there for performing a method described above process.

The object according to the invention with regard to the storage medium is achieved by a storage medium having a digital map with map data, the map data being divided into first map data and second map data, the first map data containing geometric data of edges of a map network stored as graph and the second map data containing topological data contain.

Advantageous developments are described in the subclaims.

Brief description of the drawings

The invention will be explained in more detail on the basis of an embodiment with reference to the drawings. Show it:

Fig. 1 is a schematic representation of a navigation system according to the invention;

Fig. 2 is a map detail;

3 shows a map section;

4 shows a map detail; and

Fig. 5 is a schematic representation of the structure of the stored map data. Preferred embodiment of the invention

1 shows a navigation system 1 in a schematic representation with a memory 2, a display element 3, such as monitor or display, and at least one

Control element 4. The memory 2 serves to store selected map data from a map data memory 5, wherein applications access the memory 2 and the map data stored therein. The map data memory 5 can advantageously be a hard disk memory, a CD-ROM, a DVD, a semiconductor memory or another memory, on which at least selected map data of a digital map are stored.

The navigation system 1 generates, for example map displays on the display element 3, wherein calculated routes in a map display on the display element can be displayed.

By means of the control element 4, for example, a destination can be entered by the operator, a route guidance can be started, or another application can be started or carried out.

Map data are data or data records that contain the geometry of edges and possibly nodes of a network stored as graphs, and data that contain a topology.

Among the applications of geometric data is in navigation systems for

Motor vehicles, for example, the display of map content on a display unit and the support of the locating function on the road network, also called mapmatching. In contrast, the topological data are preferably used for the calculation of routes and for destination guidance.

FIG. 2 shows a section of a map 10 for explaining the method according to the invention, in which the geometry of a road section as a directed polygon 11 between a starting point 12a, 12b, 12c and an end point 13a, 13b, 13c as an edge 14 with corresponding edge sections 15a, 15b , 15c. there In addition to the starting point 12a and the end point 13c, a predefinable number of intermediate points 16a, 16b are generated and / or stored. The map data is divided into areas, also called partitions 17, 18, 19. In partition 17 is thus the polygon with the starting point 12a and the end point 13a and the intermediate points 16a. In partition 18 is thus the traverse with the starting point 12b and the

End point 13b and the intermediate points 16b. In partition 19, the polyline is located at the starting point 12c and the end point 13c. At the partition boundaries, the endpoints of one partition are equal to the starting point of the other partition. Thus, the geometry data for those road sections that intersect a partition boundary are shared at that boundary between the partitions. The present embodiment of Figure 2 has three partitions Pl, P2 and P3, which are designated by the reference numerals 17 to 19. Each partition contains a data set 20,21,22 with geometric data of the road section in the partition. Depending on the course of the road, it is also possible to use a plurality of geometric data records for the course of the road section in the partition, see also FIG. 3.

FIG. 3 shows two partitions 30, 31, wherein in both partitions the course of the road or the course of the edge is divided into two sections 32 a, 32 b and 33 a and 33 b. Thus, two data sets of geometrical data are available for each partition, since the curvy shape of the road in both partitions makes it two

Has areas. The partitions 30, 31 thus contain exactly those data of the geometry component which is also present in each case.

The topology of road sections is stored by their links with intersections or with the data sets describing them, being advantageous for one

Road section only a single topology data set is used. For this purpose, this topology data record can be stored either only in or to the partition in which the respective road section begins or ends. In another embodiment, the topology dataset may also be linked or stored with other partitions.

FIG. 4 shows a road section 50 which corresponds to the road section of FIG. In this case, a topology data record 56 is only allocated or stored in the partition 51, since the topology data record only contains data of the road segment between the two intersections 54 and 55 contains. These may be, for example, data relating to the distance or length of the section or the required travel time for this section. The topology data record therefore does not need any intermediate points, since only data between the start and end points are relevant. Therefore, the data of the partition 51 and 53 is needed to form or map the topology between the intersections 54 and 55, but the data of the partition 52 is not needed for it and therefore not read into a memory.

It is advantageous in the method according to the invention that each partition and each geometrical and topological data record is characterized by means of an identification, such as identifier, wherein a numerical identification can be used with particular advantage. This identification uniquely identifies the record. Through this identification, a relation between data sets can be generated in each case.

For example, relations between geometrical datasets and topological datasets may be used if the locating function has determined the position of a vehicle along the geometric course of a road and from that position a route is to be determined using topological datasets or if a route guidance function continues to adhere to the route should pursue.

Also, relations between topological and geometric data sets can be used if a route calculated in the topological network is to be displayed geometrically in a map display.

According to the invention, the identification of the topological data record to which it belongs is stored for the purpose of generating relations of geometric data records to topological data records for each geometric data record. It is also expedient for the identification of the topological data record to store the identification of the partition to which it belongs, since the topological data record may belong to a different partition than the geometric data record.

This allows a given geometric data set to be accessed directly on the partition in which the topological data set is stored. The identifications of the topological data sets and their partition identifications can be stored in a list, table, database or file kept separate from the geometrical data records, so that they only have to be read if such a relation is required.

Preferably, for each topological data set, the identifications of all those partitions are stored in which geometrical data records are contained which describe the course of the road section represented by the topological data record. It is not absolutely necessary to store the identifications of all the associated geometric data records since it can be assumed that a partition will always be read in or loaded into memory, such as main memory, of the system, such as the navigation system, as a whole. As a result, all data sets can be found via the first described relations of geometric data records to topological data records.

Furthermore, it can be advantageous if identifications of the partitions in which geometrical data records lie or are assigned to them are stored in separate or separate lists, tables, files or databases. In this case, these data can be read when they are needed or need not be read when they are not needed.

FIG. 5 shows a schematic representation of an embodiment of an inventive division of a digital map into partitions. For this purpose, the map data 71 are stored in a memory 70, such as a CD-ROM, a DVD, a hard disk memory, a semiconductor memory or other memory.

The data 71 of the card is divided on a first level into data sets 72, 73, 74, ... of individual partitions, whereby a data record 75 may also be present, which may contain or comprise non-geometrically partitioned data. The data sets 72, 73 and 74 stand for data records of the partitions P1, P2,... And Pn, where n is a natural number as a run index of the partition numbering.

In a second stage, the structuring of the data records for this partition can be recognized by way of example for the partition Pn. In block 76, the geometric data records are stored. In block 77 is a table, list or file of the geometric Data records belonging topological data sets and preferably also stored their partitions. Block 78 illustrates the stored topological data sets. In block 79, the table, list or file of the partitions containing geometric data sets belonging to the topological data sets is shown. Block 80 identifies the other stored records of a partition.

Claims

claims

1. A method for operating a navigation system (1), in particular a navigation system for a motor vehicle, comprising a memory (2), a display unit (3) and at least one operating element (4), wherein map data from a map data memory (5) into the memory (5). 2), characterized in that the map data (71) are divided into first map data and second map data, the first map data including geometric data (76) of edges of a map network stored as graphs and the second map data containing topological data (78) and applications are performed by means of the first and / or second map data loaded in the memory (2).

2. The method according to claim 1, characterized in that there are relations between data sets of the first map data and the second map data.

3. The method according to claim 2, characterized in that the relations as a third

Map data are stored.

4. The method according to claim 2 or 3, characterized in that the relations are preferably stored independently of the first and / or second map data records.

5. The method according to any one of the preceding claims, characterized in that the map data (71) in partitions (Pl, P2, ... Pn) are divided and first, second and / or third map data sets partitions of the map data are assigned.

6. The method according to any one of the preceding claims, characterized in that further belonging to the geometric data sets topological data sets and preferably also their partitions (Pl, P2, ... Pn) are stored.

7. The method according to any one of the preceding claims, characterized in that further the partitions (Pl, P2, ... Pn), in which geometric data sets are located, which belong to the topological data sets, are stored.

8. The method according to any one of the preceding claims, characterized in that first, second, third data sets and / or partitions are designated by means of identifications.

9. Navigation system with a memory (2), a display element (3) and at least one operating element (4), wherein the memory of storing selected map data from a map data memory (5) and applications to the memory (2) and stored there Map data access for performing a method according to at least one of the preceding claims.

10. Storage medium with a digital map with map data, characterized in that the map data (71) are divided into first map data and second map data, the first map data containing geometric data (76) of edges of a map network stored as graph and the second map data topological Data (78), wherein with the map data, a method according to at least one of the preceding claims 1 to 8 is feasible.