Methods for layer-based mapping and optimized download strategy for higher functionality and reduced download costs

Abstract

The invention relates to a method for obtaining map information, which is divided into tiles on a map (K), by a vehicle (100) from a backend device (200), comprising: 110 requests of a, preferably initially complete, tile depending on a current position (P) of the vehicle (100) at the backend device (200), 120 Receiving the requested tile from the back end device (200), 130 Performing a localization of the vehicle (100), e.g. optically, within the requested tile in order to determine a current category (K1, K2, K3, K4) of a street (S) on which the vehicle (100) is located, 140 requests of at least one adjacent tile at the backend device (200) based on the current category (K1, K2, K3, K4) at the backend device (200), 150 Retrieving specific layers (L) with map information depending on the current category (K1, K2, K3, K4) from the backend device (200), wherein in particular the specific layers (L) with a classification (L1, L2, L3, L4) one level higher (+1) if available, and one level lower (-1) if available, than the current category (K1, K2, K3, K4) are provided by the backend device (200).

Description

[0001] The invention relates to a method for obtaining map information, which is divided into tiles on a map, from a backend device by a vehicle. The invention further relates to a corresponding computer program product, a corresponding control unit, and a corresponding vehicle for carrying out this method.

[0002] The invention further relates to a method for providing map information, which is divided into tiles on a map, by means of a backend device. The invention further relates to a corresponding computer program product, a corresponding control unit, and a corresponding backend device for carrying out such a method.

[0003] Modern vehicles are equipped with various sensors, such as cameras, radar, and ultrasound. Furthermore, modern vehicles can utilize swarm data, for example, from a (high-definition) map, to support lateral and longitudinal assistance systems, such as Travel Assist, pACC, and VZF. Swarm data can include, for example, swarm trajectories, traffic light information, and so on. This swarm data can be used to improve the stability and availability of corresponding driving functions.

[0004] In most cases, swarm data is downloaded tile-based. This means the entire tile must always be downloaded, even if only partial information is needed.

[0005] This download strategy is currently reaching its limits because the maximum bandwidth for transmitting map data in the vehicle is limited, for example, to around 15 KB / s. However, a map tile (e.g., approximately 1x1 km) in densely populated cities can be up to 800 KB in size. In the worst-case scenario, such as driving at high speed (e.g., over 100 km / h) through a densely populated area (e.g., the city center of a large city), data is not transmitted in time, and the driving functions are either unavailable or only partially available. Furthermore, every kilobyte transmitted consumes data, puts a strain on the network, generates costs for the data provider, and so on.

[0006] Examples of well-known publications are DE 10 2019 103 671 A1, DE 10 2017 218 394 A1, US 2007 / 0 244 636 A1 and DE 10 2004 009 463 A1.

[0007] It is therefore the object of the invention to overcome at least one of the disadvantages described above, at least partially.

[0008] Furthermore, the invention aims to provide an improved method for obtaining map information, which is divided into tiles on a map, from a backend device by a vehicle. This method enables an optimized download strategy, allows for targeted requests of map information, reduces data volume during download, relieves network load, and ensures the reliable provision of driving functions. The invention also aims to provide a corresponding computer program, a corresponding control unit, and a corresponding vehicle for carrying out this method.

[0009] Furthermore, the invention aims to provide an improved method for supplying map information, which is divided into tiles on a map, via a backend device. This method enables an optimized download strategy, facilitates the efficient and reliable provision of targeted map information, reduces data volume during map information downloads, relieves network load, and increases the availability of targeted map information for requesting vehicles. The invention also aims to provide a corresponding computer program, a corresponding control unit, and a corresponding vehicle for carrying out this method.

[0010] The preceding problem is solved by: a method for obtaining map information, which is divided into tiles on a map, by a vehicle from a backend device.

[0011] The map information can include traffic-related information, in particular swarm trajectories, road markings, traffic light sequences, road signs and / or traffic signs.

[0012] The map information can be advantageously used for lateral and / or longitudinal driving functions of the vehicle.

[0013] The procedure includes the following actions / procedural steps: 110 Requesting a tile, preferably initially complete, depending on the current position (e.g., GPS position) of the vehicle from the backend device; 120 Receiving (e.g., downloading) the requested tile from the backend device. 130 Performing a localization of the vehicle within the requested tile, e.g. optically, to determine a current category of a street on which the vehicle is located (a previous categorization by the backend device may be taken into account), 140 requests from at least one adjacent tile (e.g., viewed in the direction of travel) to the backend device based on the current category at the backend device (the vehicle can communicate the current category to the backend device or transmit it with the request). 150 Retrieve (e.g. download) specific (not all, only targeted) layers (layers can also be referred to as strata) containing map information depending on the current category from the backend device.

[0014] Advantageously, the specific layers can be provided by the backend device with a classification one level higher, if available, and one level lower, if available, than the current category.

[0015] This allows for an improved download strategy in the vehicle.

[0016] In the first step (e.g. when starting a driving function), the vehicle can download a complete tile and therefore all layers based on the initial GPS position.

[0017] Within this tile, the vehicle's precise positioning and thus the currently driven road class (according to a previous categorization by the backend device) can be determined by means of, for example, optical localization.

[0018] Later on (e.g., during normal operation of a driving function), only specific layers of another required tile can be downloaded, and not the complete tile with all available layers, for example, while localization is active.

[0019] The further course of events could look like this, for example: - Download a layer with the same classification as the category of a currently traveled road, and - Download of available layers with a classification one level higher and one level lower than the currently driven road.

[0020] Another required tile can be determined based on further characteristics in the vehicle, e.g., based on turn signal indication for departure / turning, a position of the vehicle on a swarm trajectory for departure / turning, etc.

[0021] The backend device can preferably decide which layers are made available for download.

[0022] Furthermore, it is conceivable that the layers for download are prioritized by the vehicle, e.g. based on turn signal indication for departure / turning, a position of the vehicle on a swarm trajectory for departure / turning, etc.

[0023] If no layer exists with a classification one level higher or one level lower, e.g., if the vehicle is already on the highest or lowest layer, it will not be downloaded.

[0024] Furthermore, the procedure may provide for: 160 Using map information from specific layers for a lateral and / or longitudinal driving function of the vehicle.

[0025] As mentioned above, in step (110) a complete tile can first be requested and / or obtained with all available layers. Advantageously, the procedure can be started when a lateral and / or longitudinal driving function of the vehicle is initiated, for example, if the currently driven road class is unknown.

[0026] Advantageously, steps (140, 150) can be performed repeatedly and / or on an event-specific basis, e.g., when: - the current category (e.g., in another required tile) is changed and / or - no tile is available in advance.

[0027] Preferably, the steps (140, 150) can be carried out during the operation of a transverse and / or longitudinal driving function of the vehicle, preferably repeatedly and / or event-specifically.

[0028] Furthermore, to perform a localization of the vehicle, e.g. optically, at least one sensor information from the vehicle can be taken into account, e.g. from at least one of the following sensors: - an optical sensor, e.g. a camera, e.g. a front camera, - a radar, - a lidar and / or - an acoustic sensor, e.g. an ultrasonic sensor.

[0029] In this way, the vehicle can be quickly located, and thus the current category of a street can be determined accurately and efficiently.

[0030] Furthermore, when requesting at least one adjacent tile, at least one piece of operating information from the vehicle can be taken into account: - Turn signal information, - Position of the vehicle on a swarm trajectory for departure / turning, - Direction of travel, - Navigation information, - Calendar information of a user of the vehicle and / or - User profile and / or driving profile of a user of the vehicle.

[0031] In this way, a further required tile can be determined in an improved, especially forward-looking, manner.

[0032] The above problem is further solved by: A computer program product comprising instructions which, when executed by a computer, cause the computer to carry out the method, which can proceed as described above. The same advantages can be achieved as described above in connection with the method according to the invention.

[0033] The above task will continue to be solved by: A control unit comprising a processing unit and a storage unit in which instructions are stored which, when at least partially executed by the processing unit, perform a process that can proceed as described above. The same advantages can be achieved as described above in connection with the method according to the invention. For example, the control unit can be implemented in a navigation device and / or a camera device of the vehicle.

[0034] The above problem is further solved by: A vehicle, e.g., an automated or autonomous vehicle, with a corresponding control unit. The same advantages can be achieved as described above in connection with the method according to the invention.

[0035] The preceding problem is solved by: a method for providing map information, which is divided into tiles on a map, by a backend device.

[0036] The map information can include traffic-related information, in particular swarm trajectories, road markings, traffic light sequences, road signs and / or traffic signs.

[0037] Advantageously, the map information can be used for lateral and / or longitudinal driving functions of the vehicle.

[0038] The process involves the following actions / procedural steps: 210 Creating a map, especially a geographical one, with map information on different roads, 220 Categorizing the different roads (entirely or segment by segment) depending on at least one traffic parameter, such as official road classes, average speed, average traffic volume, etc., 230 Classifying different layers depending on the categorization.

[0039] For example, four categories are conceivable: K1 is a first (highest) category, e.g. for main roads / urban highways, K2 is a second (second highest) category, e.g. for directly adjacent road segments of a main road / urban motorway, K3 is a third (second lowest) category, e.g. for city streets without a speed limit, K4 is a fourth (lowest) category, e.g. for roads with a speed limit, such as streets in a residential area.

[0040] The layers can then be assigned appropriate classifications, e.g. L1 for the first (highest) category K1, L2 for the second (second highest) category K2, L3 for the third (second lowest) category K3, L4 for the fourth (lowest) category K4.

[0041] Advantageously, the procedure can also provide for: 240 Providing specific layers of map information to a requesting vehicle depending on a category communicated by the requesting vehicle.

[0042] Advantageously, step (220) can incorporate a hierarchy of roads with different categories. This avoids loss of localization at transitions between different road segments. For example, it can be stipulated that the category can change by a maximum of one level when transitioning from one road segment to another. If, for instance, after an initial classification, a road segment of the third category borders a road segment of the first category, then the segment of the third category must be upgraded to the second category.

[0043] In this way, in step (220) an adjustment of different categories can be carried out, in particular an intelligent one, at transitions between adjacent road segments.

[0044] Preferably, step (220) can ensure that categories change by a maximum of one level at transitions between adjacent road segments.

[0045] It is conceivable, for example, that in step (220) a category is adjusted, preferably raised, if categories change by more than one level when transitioning from a current road segment to an adjacent road segment.

[0046] Furthermore, in step (220), a minimum length of a corresponding section can be taken into account when transitioning from one road segment of one category to another, particularly when categories change by more than one level. This ensures that when transitioning from a road segment of first category to another road segment of second category and then to a further road segment of third category, the minimum length of a corresponding section is maintained, or otherwise the third category road segment is reassigned to the second category.

[0047] Furthermore, in step (240), the specific layers can be provided to the requesting vehicle by the backend device with a classification one level higher, if available, and one level lower, if available, than the communicated category. This allows for an optimized download strategy based on dividing (i.e., categorizing) roads into categories so that map information can be transferred in individual layers.

[0048] In principle, it is conceivable that the backend device can decide, depending on the communicated current category of the requesting vehicle, which layers are needed and made available for download.

[0049] Furthermore, it is conceivable that the vehicle can decide, depending on the communicated current category, which layers are needed and requested for download.

[0050] The above problem is further solved by: A computer program product comprising instructions which, when executed by a computer, cause the computer to carry out the method, which can proceed as described above. The same advantages can be achieved as described above in connection with the method according to the invention.

[0051] The above task will continue to be solved by: A control unit comprising a processing unit and a storage unit in which instructions are stored which, when at least partially executed by the processing unit, perform a process that can proceed as described above. The same advantages can be achieved that have been described above in connection with the method according to the invention. For example, the control unit can be implemented in a backend device.

[0052] The above problem is further solved by: a backend device with a corresponding control unit. The same advantages can be achieved as described above in connection with the method according to the invention.

[0053] Further advantages and features of the invention will become apparent from the following description, in which several embodiments of the invention are described in detail with reference to the drawings. The drawings schematically illustrate: Fig. 1. An exemplary procedure for obtaining map information and Fig. 2 an exemplary procedure for providing map information.

[0054] In the following figures, identical reference numerals are used for the same technical features, even for different embodiments.

[0055] As it is Fig. Figure 1 illustrates a method developed for obtaining map information, which is divided into tiles on a map K, by a vehicle 100 from a backend device 200.

[0056] The map information can include traffic-related information, in particular swarm trajectories, road markings, traffic light sequences, road signs and / or traffic signs.

[0057] The map information can advantageously be used for lateral and / or longitudinal driving functions of the vehicle 100.

[0058] As it is Fig. As illustrated in point 1, the procedure comprises the following actions / procedural steps: 110 requests for a tile, preferably initially complete, depending on a current position (e.g. GPS position) of the vehicle; 100 at the backend device; 200 120 Receive (e.g., download) the requested tile from the backend device 200, 130 Performing a localization of the vehicle 100, e.g. optically, within the requested tile in order to determine a current category K1, K2, K3, K4 of a street S on which the vehicle 100 is located, (a previously carried out categorization 220 by the backend device 200 can be taken into account), 140 requests of at least one (e.g. seen in the direction of travel) adjacent tile at the backend device 200 based on the current category K1, K2, K3, K4 at the backend device 200, (the vehicle can communicate the current category K1, K2, K3, K4 to the backend device 200 or transmit it with the request), 150 Retrieve (e.g. download) specific (not all, only selectively determined) layers L (layers can also be referred to as strata) with map information depending on the current category K1, K2, K3, K4 from the backend device 200.

[0059] As it is Fig. As illustrated by examples, the specific layers L with a classification L1, L2, L3, L4 can be provided by the backend device 200 one level higher, if available, and one level lower, if available, than the current category K1, K2, K3, K4.

[0060] This enables an improved download strategy in vehicle 100.

[0061] In the first step, vehicle 100 (e.g., when starting a driving function) can download a complete tile and therefore all layers L1, L2, L3, L4 based on the initial GPS position.

[0062] Within this tile, an exact positioning of the vehicle 100 and thus the currently driven road class K1, K2, K3, K4 (whereby a previously carried out categorization 220 by the backend device 200 can be taken into account) can be determined by means of a localization 130, e.g. optical.

[0063] In the further course of 150 (e.g. during the operation of a driving function), only specific layer L of another required tile can be downloaded and no longer the complete tile with all available layers L1, L2, L3.

[0064] The further course of events 150 can include, for example, the following actions: - Download a layer L (L = L1, L2, L3 or L4) with the same classification as the category of a currently traveled road S, and - Download of available layers L+1, L-1 with a classification one level +1 higher and one level -1 lower than the one level -1 lower of the currently traveled road.

[0065] Another required tile can be determined based on further features in vehicle 100, e.g. based on turn signal indication for departure / turning, a position of the vehicle on a swarm trajectory for departure / turning, etc.

[0066] The backend device 200 can preferably decide which layers are made available for download, as the Fig. 2 suggests.

[0067] Furthermore, it is conceivable that the layers for download are prioritized by the vehicle, e.g. based on turn signal indication for departure / turning, a position of the vehicle on a swarm trajectory for departure / turning, etc., and communicated to the backend device 200 with request 140 (not shown for the sake of simplicity).

[0068] If no layer L exists with a classification L1, L2, L3, L4 one level higher (+1) or one level lower (-1), e.g., if the vehicle is already on the highest or lowest layer, it will not be downloaded.

[0069] Furthermore, the Fig. 1. The procedure may provide for: 160 Using map information from the specific layers L for a lateral and / or longitudinal driving function of the vehicle 100.

[0070] As mentioned above, in step 110 a complete tile can first be requested and / or obtained with all available layers L. Advantageously, the procedure can be started when a lateral and / or longitudinal driving function of the vehicle 100 is initiated, for example, if the currently driven road class is unknown.

[0071] Firstly, it is conceivable that steps 140 and 150 can be performed repeatedly and / or on an event-specific basis, e.g., if: - the current category K1, K2, K3, K4 (e.g. in another required tile) is changed and / or - no tile is available in advance.

[0072] On the other hand, it is conceivable that steps 140, 150 can be carried out during the operation of a transverse and / or longitudinal driving function of the vehicle 100, preferably repeatedly and / or event-specifically.

[0073] The following sensors can be used in step 130: - an optical sensor, e.g. a camera, e.g. a front camera, - a radar, - a lidar and / or - an acoustic sensor, e.g. an ultrasonic sensor.

[0074] In step 140, the following operating information of vehicle 100 can be taken into account: - Turn signal information, - Position of the vehicle on a swarm trajectory for departure / turning, - Direction of travel, - Navigation information, - Calendar information of a user of the vehicle and / or - User profile and / or driving profile of a user of the vehicle.

[0075] A corresponding computer program product, a corresponding control unit ECU1 and a corresponding vehicle 100 also represent aspects of the invention.

[0076] As it is Fig. As illustrated in Figure 2, a method is proposed which was developed to provide map information, which is divided into tiles on a map K, by a backend device 200.

[0077] The map information can include traffic-related information, in particular swarm trajectories, road markings, traffic light sequences, road signs and / or traffic signs.

[0078] Advantageously, the map information can be used for lateral and / or longitudinal driving functions of the vehicle 100.

[0079] As it is Fig. As illustrated in section 2, the procedure involves the following actions / procedural steps: 210 Creating a map, especially a geographical one, K with map information on different roads S, 220 Categorizing the different roads S or road segments (i.e., whole or segment by segment) depending on at least one traffic parameter VP, preferably in the form of an average traffic volume, 230 Classifying different layers L depending on the categorization.

[0080] For example, four categories K1, K2, K3, K4 are conceivable: K1 is a first (highest) category, e.g. for main roads / urban highways, K2 is a second (second highest) category, e.g. for directly adjacent road segments of a main road / urban motorway, K3 is a third (second lowest) category, e.g. for city streets without a speed limit, K4 is a fourth (lowest) category, e.g. for roads with a speed limit, such as streets in a residential area.

[0081] The layers L can then receive corresponding classifications L1, L2, L3, L4, e.g. L1 for the first (highest) category K1, L2 for the second (second highest) category K2, L3 for the third (second lowest) category K3, L4 for the fourth (lowest) category K4.

[0082] Advantageously, the procedure can also provide for: 240 Providing specific layers L with map information to a requesting vehicle 100 depending on a communicated category K1, K2, K3, K4 by the requesting vehicle 100.

[0083] Advantageously, in step 220, a hierarchy of roads S with different categories K1, K2, K3, K4 can be considered to avoid a loss of localization at transitions between different road segments, so that when transitioning from one road segment to another, the category can change by a maximum of one level (+1, -1). For example, if, after an initial classification, a road segment of the third category K3 borders a road segment of the first category K1, then the segment of the third category K3 must be upgraded to the second category K2.

[0084] In this way, in step 220, an adjustment of different categories K1, K2, K3, K4 can be carried out, in particular an intelligent one, at transitions between adjacent road segments.

[0085] Preferably, step 220 can ensure that categories K1, K2, K3, K4 change by a maximum of one level (+1, -1) at transitions between adjacent road segments.

[0086] It is conceivable, for example, that in step 220 a category K1, K2, K3, K4 is adjusted, preferably increased (e.g. from K4 to K3, from K3 to K2), if categories K1, K2, K3, K4 change by more than one level (+1, -1) when transitioning from a current road segment to an adjacent road segment.

[0087] When transitioning from one road segment to another, the category K1, K2, K3, K4 may change by a maximum of one level (+1, -1). For example, if, after an initial classification, a road segment of category K3 borders one of category K1, the segment of category K3 must be upgraded to category K2.

[0088] Furthermore, in step 220, when transitioning (e.g., from K4 to K2, K3 to K1) from one road segment with a category K1, K2, K3, K4 to another road segment with a different category K1, K2, K3, K4, a minimum length of a corresponding route can be taken into account, especially if categories K1, K2, K3, K4 change by more than one level (+1, -1). This ensures that when transitioning from a road segment with a first category K1 to another road segment with a second category K2 and to a further road segment with a third category K3, the minimum length of a corresponding route is maintained; otherwise, the road segment of the third category K3 is assigned to the second category K2.

[0089] As it is Fig. As indicated in 2, in step 240 the specific layers L with a classification L1, L2, L3, L4 one level (+1) higher, if available, and one level (-1) lower, if available, than the communicated category K1, K2, K3, K4 can be provided by the backend device 200 to the requesting vehicle 100.

[0090] An example might unfold as follows: Vehicle 100 drives through the map tile on a main road / urban highway. The vehicle remains on a road S of category K1 throughout, therefore layer L1 and layer L2 (one level lower) are downloaded. Category K0 does not exist, so in this case only two layers, L1 and L2, are transferred. Map information for the main road and the directly adjacent roads / road segments is transferred from backend device 200 to vehicle 100. This approach can save approximately 50% of the map information compared to downloading all four layers: L1, L2, L3, and L4.

[0091] Another example might proceed as follows: A vehicle 100 first drives on the urban motorway and then on the connecting main road through the map tile. The vehicle is on a road S of category K1 and then on a road S of category K2; therefore, layers L1, L2, and layer L3 (one level lower) are downloaded. Category 0 does not exist, so in this case, only three layers—L1, L2, and L3—are transferred. In this case, all map information for the tile is transferred, except for the map information about streets in the quieter residential area.

[0092] Another example could proceed as follows: Vehicle 100 drives through a residential area within the map tile. Vehicle 100 remains on a Category 4 road (S), therefore layer L4 and layer L3 (one level higher) are downloaded. Category 5 does not exist, so in this case only layers L3 and L4 are transferred. The map information for the residential area and the directly adjacent roads / road segments is then transferred from the backend to the vehicle. Approximately 50% of the data can be saved here.

[0093] In principle, it is conceivable that the backend device 200 can decide, depending on the communicated current category K1, K2, K3, K4 of the requesting vehicle 100, which layer L is required and made available for download, as the Fig. 2 suggests.

[0094] However, it is also conceivable that, depending on the communicated current category K1, K2, K3, K4, the vehicle 100 can decide which layer L is needed and requested for download in step 140.

[0095] A corresponding computer program product, a corresponding control unit ECU2 and a corresponding backend device 200 also represent aspects of the invention.

[0096] The preceding explanation of the embodiments describes the present invention solely by way of examples. Naturally, individual features of the embodiments can be freely combined with one another, provided this is technically feasible, without departing from the scope of the present invention. Reference symbol list 100 vehicles 200 Back end device K card K1 Category K2 Category K3 Category K4 Category S Street L Layer L1 classification L2 classification L3 classification L4 classification ECU1 control unit ECU2 control unit VP traffic parameters

Claims

[1] Method for obtaining map information, which is divided into tiles on a map (K), by a vehicle (100) from a backend device (200), the map information includes traffic-relevant information, in particular swarm trajectories, road markings, traffic light sequences, road signs and / or traffic signs, and wherein the map information is used for use in lateral and / or longitudinal driving functions of the vehicle (100), demonstrating the procedure: 110 requests of a, preferably initially complete, tile depending on a current position (P) of the vehicle (100) at the backend device (200), 120 Receiving the requested tile from the back end device (200), 130 Performing a localization of the vehicle (100), e.g. optically, within the requested tile in order to determine a current category (K1, K2, K3, K4) of a street (S) on which the vehicle (100) is located, 140 requests of at least one adjacent tile at the backend device (200) based on the current category (K1, K2, K3, K4) at the backend device (200), 150 Obtaining specific layers (L) containing map information depending on the current category (K1, K2, K3, K4) from the backend device (200), wherein in particular the specific layers (L) with a classification (L1, L2, L3, L4) one level higher (+1) if available and one level lower (-1) if available than the current category (K1, K2, K3, K4) are provided by the backend device (200). [2] Method according to the preceding claim, further comprising: 160 Using the map information from the specific layers (L) for a lateral and / or longitudinal driving function of the vehicle (100). [3] Method according to any one of the preceding claims, where in step (110) a complete tile is first requested and / or obtained with all available layers (L), and / or wherein the procedure is started when a lateral and / or longitudinal driving function of the vehicle (100) is started, and / or the steps (140, 150) are performed repeatedly and / or on an event-specific basis, especially if: - the current category (K1, K2, K3, K4) is changed and / or - no tile is available in advance, and / or the steps (140, 150) are carried out during the operation of a transverse and / or longitudinal driving function of the vehicle (100). [4] Method according to one of the preceding claims, wherein, for example, optical localization of the vehicle (100), at least one sensor information from the vehicle (100) is taken into account, in particular from at least one of the following sensors: - an optical sensor, e.g. a camera, e.g. a front camera, - a radar, - a lidar and / or - an acoustic sensor, e.g. an ultrasonic sensor. [5] Method according to one of the preceding claims, wherein when querying at least one adjacent tile at least one operating information of the vehicle (100) is taken into account: - Turn signal information, - Position of the vehicle (100) on a swarm trajectory for departure / turn, - Direction of travel, - Navigation information, - Calendar information of a user of the vehicle and / or - User profile and / or driving profile of a user of the vehicle. [6] Computer program product comprising instructions which, when executed by a computer, cause the computer to carry out the method according to any of the preceding method claims. [7] Control unit (ECU1) comprising at least one storage unit in which instructions are stored which, when at least partially executed by a computing unit, perform a method according to one of the preceding method claims, wherein, for example, the control unit (ECU) is provided in a navigation device and / or a camera device of the vehicle (100). [8] Vehicle (100) comprising a control unit (ECU1) according to the preceding claim. [9] Method for providing map information divided into tiles on a map (K) by a backend device (200), the map information includes traffic-relevant information, in particular swarm trajectories, road markings, traffic light sequences, road signs and / or traffic signs, and wherein the map information is used for use in lateral and / or longitudinal driving functions of the vehicle (100), demonstrating the procedure: 210 Creating a map, especially a geographical one (K), with map information on different roads (S), 220 Categorizing the different roads (S) depending on at least one traffic parameter (VP), such as official road classes, average speed, average traffic volume, etc., 230 Classifying different layers (L) depending on the categorization. [10] Method according to the preceding claim, further comprising: 240 Providing specific layers (L) with map information to a requesting vehicle (100) depending on a communicated category (K1, K2, K3, K4) by the requesting vehicle (100). [11] Method according to claim 9, where in step (220) a hierarchy of streets (S) with different categories (K1, K2, K3, K4) is taken into account, and / or wherein in step (220) an adjustment, in particular an intelligent adjustment of different categories (K1, K2, K3, K4) is carried out at transitions between adjacent road segments, and / or wherein step (220) ensures that at transitions between adjacent road segments categories (K1, K2, K3, K4) change by a maximum of one level (+1, -1), and / or wherein in step (220) a category (K1, K2, K3, K4) is adjusted, preferably increased (e.g. from K4 to K3, from K3 to K2), if categories (K1, K2, K3, K4) change by more than one level (+1, -1) when transitioning from a current road segment to an adjacent road segment, and / or wherein in step (220) a minimum length of a corresponding route is taken into account when transitioning (e.g. K4 to K2, K3 to K1) from one road segment with one category (K1, K2, K3, K4) to another road segment with a different category (K1, K2, K3, K4), especially when categories (K1, K2, K3, K4) change by more than one level (+1, -1), to ensure, for example, that when transitioning from a road segment with a first category (K1) to another road segment with a second category (K2) and to a further road segment with a third category (K3), the minimum length of a corresponding route is maintained, or otherwise the road segment of the third category (K3) is assigned to the second category (K2). [12] Method according to claim 10, wherein in step (240) the specific layers (L) with a classification (L1, L2, L3, L4) one level higher (+1) if available and one level (-1) lower, if available, than the communicated category (K1, K2, K3, K4) are provided by the backend device (200) to the requesting vehicle (100). [13] Computer program product comprising instructions which, when the computer program product is executed by a computer, cause it to carry out the method according to any one of the preceding method claims 9 to 12. [14] Control unit (ECU2) comprising at least one storage unit in which instructions are stored which, when at least partially executed by a computing unit, carry out a method according to one of the preceding method claims 9 to 12, wherein, for example, the control unit (ECU) is provided in a backend device (200). [15] Backend device (200) comprising a control unit (ECU2) according to the preceding claim.

Images