EP2002211A2 - Procédé pour faire fonctionner un système de navigation - Google Patents

Procédé pour faire fonctionner un système de navigation

Info

Publication number
EP2002211A2
EP2002211A2 EP07704149A EP07704149A EP2002211A2 EP 2002211 A2 EP2002211 A2 EP 2002211A2 EP 07704149 A EP07704149 A EP 07704149A EP 07704149 A EP07704149 A EP 07704149A EP 2002211 A2 EP2002211 A2 EP 2002211A2
Authority
EP
European Patent Office
Prior art keywords
data
map data
map
memory
partitions
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.)
Ceased
Application number
EP07704149A
Other languages
German (de)
English (en)
Inventor
Ernst-Peter Neukirchner
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.)
Robert Bosch GmbH
Original Assignee
Robert Bosch GmbH
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 Robert Bosch GmbH filed Critical Robert Bosch GmbH
Publication of EP2002211A2 publication Critical patent/EP2002211A2/fr
Ceased legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/38—Electronic maps specially adapted for navigation; Updating thereof
    • G01C21/3863—Structures of map data
    • G01C21/387—Organisation of map data, e.g. version management or database structures
    • G01C21/3881—Tile-based structures
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/38—Electronic maps specially adapted for navigation; Updating thereof
    • G01C21/3804—Creation or updating of map data
    • G01C21/3807—Creation or updating of map data characterised by the type of data
    • G01C21/3815—Road data
    • G01C21/3819—Road shape data, e.g. outline of a route

Definitions

  • 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.
  • 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.
  • roads are represented as so-called edges, with crossing points or branches of roads being represented as so-called nodes.
  • 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.
  • 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.
  • 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.
  • Partition limits have become known through WO 99/58934.
  • 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.
  • 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.
  • 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.
  • 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
  • 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.
  • applications such as application programs which only require geometrical data, can access exclusively geometrical data records.
  • 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.
  • relations or the data underlying the formation of the relations are stored as third map data.
  • the relations or the data underlying the formation of the relations are assigned to the first and / or second map data sets.
  • relations or the data underlying the formation of the relations are stored independently of the first and / or second map data records.
  • the relations or the data usable to form the relations can only be read into the memory when needed.
  • 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.
  • first and / or second and / or third data records and / or partitions are designated by means of identifications.
  • identifications may be, for example, numerical identifications.
  • 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.
  • Fig. 1 is a schematic representation of a navigation system according to the invention
  • Fig. 2 is a map detail
  • Fig. 5 is a schematic representation of the structure of the stored map data. Preferred embodiment of the invention
  • FIG. 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
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • partition 17 is thus the polygon with the starting point 12a and the end point 13a and the intermediate points 16a.
  • partition 18 is thus the traverse with the starting point 12b and the
  • FIG. 19 End point 13b and the intermediate points 16b.
  • the polyline is located at the starting point 12c and the end point 13c.
  • the endpoints of one partition are equal to the starting point of the other partition.
  • 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.
  • 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.
  • the partitions 30, 31 thus contain exactly those data of the geometry component which is also present in each case.
  • 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.
  • this topology data record can be stored either only in or to the partition in which the respective road section begins or ends.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • topological data set 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.
  • 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.
  • 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.
  • 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.
  • the structuring of the data records for this partition can be recognized by way of example for the partition Pn.
  • the geometric data records are stored.
  • 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.
  • 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.

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Automation & Control Theory (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Navigation (AREA)
  • Instructional Devices (AREA)
  • Processing Or Creating Images (AREA)

Abstract

L'invention concerne un procédé pour faire fonctionner un système de navigation (1), en particulier un système de navigation pour un véhicule à moteur, qui comprend une mémoire (2), une unité d'affichage (3) et au moins un élément de commande (4), des données cartographiques d'une mémoire de données cartographiques (5) étant chargées dans ladite mémoire (2), ces données cartographiques (71) étant subdivisées en premières données cartographiques et en secondes données cartographiques, les premières données cartographiques contenant des données géométriques (76) d'arêtes d'un réseau cartographique enregistré sous forme de graphes, les secondes données cartographiques contenant des données topologiques (78) et des applications étant exécutées à l'aide des premières et/ou secondes données cartographiques chargées en mémoire (2).
EP07704149A 2006-03-23 2007-01-26 Procédé pour faire fonctionner un système de navigation Ceased EP2002211A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102006013388A DE102006013388A1 (de) 2006-03-23 2006-03-23 Verfahren zum Betrieb eines Navigationssystems
PCT/EP2007/050756 WO2007107393A2 (fr) 2006-03-23 2007-01-26 Procédé pour faire fonctionner un système de navigation

Publications (1)

Publication Number Publication Date
EP2002211A2 true EP2002211A2 (fr) 2008-12-17

Family

ID=38438327

Family Applications (1)

Application Number Title Priority Date Filing Date
EP07704149A Ceased EP2002211A2 (fr) 2006-03-23 2007-01-26 Procédé pour faire fonctionner un système de navigation

Country Status (4)

Country Link
US (1) US8447515B2 (fr)
EP (1) EP2002211A2 (fr)
DE (1) DE102006013388A1 (fr)
WO (1) WO2007107393A2 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9892660B2 (en) 2010-06-03 2018-02-13 Here Global B.V. Navigable topological maps
DE102019132374A1 (de) * 2019-11-28 2021-06-02 Bayerische Motoren Werke Aktiengesellschaft Verfahren zum Bereitstellen von Kartendaten für mindestens zwei Typen an Zonen

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6112200A (en) * 1998-03-16 2000-08-29 Navigation Technologies Corporation Interleaving of data types in a geographic database and methods for application
DE69924249T2 (de) * 1998-05-08 2006-05-18 Robert Bosch Gmbh Verfahren zum herstellen eines speichermediums mit einer karte
US7089162B2 (en) * 2001-11-07 2006-08-08 Harman International Industries, Incorporated Navigation map creation system
US7263438B2 (en) * 2003-12-23 2007-08-28 Honda Motor Co., Ltd. Smart storage and transmission of navigation information

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2007107393A2 *

Also Published As

Publication number Publication date
US8447515B2 (en) 2013-05-21
DE102006013388A1 (de) 2007-09-27
WO2007107393A3 (fr) 2008-05-15
US20090187334A1 (en) 2009-07-23
WO2007107393A2 (fr) 2007-09-27

Similar Documents

Publication Publication Date Title
DE69934301T2 (de) Wegesuchsystem
DE69828339T2 (de) Programm zum Erzeugen von Manövern
DE69733151T2 (de) Kartendatenbankgerät
EP2507589B1 (fr) Procédé pour simplifier une description d'un itinéraire routier
EP2641061B1 (fr) Procédé de détermination automatique d'une délimitation d'une surface partielle d'une surface globale
EP2075781A1 (fr) Procédé de production d'une carte géographique numérique
DE102009019498A1 (de) Verfahren zur Erzeugung einer digitalen Straßenkarte, Navigationssystem und Verfahren zum Betrieb eines Navigationssystems
WO2003016823A1 (fr) Procede pour determiner des itineraires et systeme de navigation associe
EP2002211A2 (fr) Procédé pour faire fonctionner un système de navigation
EP1837628A2 (fr) Procédé destiné au fonctionnement d'un système de navigation
EP2087316B1 (fr) Support de données géographiques, procédé de fonctionnement d'un appareil de navigation, et appareil de navigation
DE102007048264A1 (de) Verfahren zum Betrieb eines Navigationssystems
DE102007062991B3 (de) Verfahren zur Erzeugung einer elektronisch speicherbaren, digitalen Landkarte und Navigationsgerät mit digitaler Landkarte
DE102006013297B4 (de) Verfahren zum Betrieb eines Navigationssystems
DE102006059626A1 (de) Verfahren zum Auslesen von Daten aus einem Speichermedium
WO2009059574A1 (fr) Procédé d'utilisation d'un système de navigation
EP1979837B1 (fr) Procede et dispositif pour la sortie de jeux de données
DE102020101445A1 (de) Bestimmen einer Route auf einer Karte
EP2013580B1 (fr) Procédé et dispositif pour déterminer le coût minimum pour aller d'un point de départ à un point de destination
DE102005045020A1 (de) Verfahren zur Aktualisierung von digitalen Karten
EP1329692B1 (fr) Procédé pour déterminer des données cartographiques
EP1883024A1 (fr) Procédé destiné au fonctionnement d'un système de navigation
DE102013008936B4 (de) Erstellung und Verwendung einer Datenstruktur für die Pfadermittlung in einem Verkehrswegenetz
DE102006013387A1 (de) Verfahren zum Betrieb eines Navigationssystems
DE102013008383B4 (de) Korridorbasierte Routenberechnung

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 IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR MK RS

RIN1 Information on inventor provided before grant (corrected)

Inventor name: NEUKIRCHNER, ERNST-PETER

17P Request for examination filed

Effective date: 20081117

DAX Request for extension of the european patent (deleted)
R17D Deferred search report published (corrected)

Effective date: 20080515

RBV Designated contracting states (corrected)

Designated state(s): DE ES FR GB IT

RBV Designated contracting states (corrected)

Designated state(s): DE ES FR GB IT

17Q First examination report despatched

Effective date: 20100827

REG Reference to a national code

Ref country code: DE

Ref legal event code: R003

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

Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED

18R Application refused

Effective date: 20121116