A parking lot map use method, device and electronic equipment

Abstract

This application relates to the field of intelligent driving technology, and in particular to a method, apparatus, and electronic device for using a parking lot map. The method includes: acquiring the real-time speed of a target vehicle; acquiring the real-time distance between the target vehicle and at least one candidate parking lot within a predetermined range; when the latest acquired speed meets preset parking conditions, acquiring map tag information of at least one candidate parking lot within a predetermined range around the target vehicle from a navigation system; wherein the map tag information indicates whether the map of the corresponding candidate parking lot has been downloaded and used; and determining the download order of the latest acquired at least one candidate parking lot map based on the latest acquired distance to the candidate parking lot and the map tag information. This ensures that the parking lot map is downloaded before the vehicle enters the parking lot, avoiding extra time and thus improving the efficiency of valet parking services.

Description

Technical Field

[0001] This application relates to the field of intelligent driving technology, and in particular to a method, device and electronic device for using a parking lot map. Background Technology

[0002] With the development of artificial intelligence technology, people are increasingly relying on intelligent driving when traveling by car, and valet parking services are gradually entering people's lives.

[0003] Currently, when a vehicle equipped with a valet parking program arrives at a parking lot that provides valet parking services, the parking lot's service system can provide fully automated parking services without the need for manual operation, thus providing convenience for users' daily travel.

[0004] Specifically, when a vehicle arrives at a parking lot, the valet parking program inside the vehicle connects with the parking lot's service system, downloads a parking lot map, searches for parking spaces based on the map, and controls the vehicle to move until it is safely parked in a space.

[0005] However, the above service method has the following problems:

[0006] Because the valet parking process only begins downloading the parking map after the vehicle has arrived at the parking lot and established a connection with the parking lot's service system, it takes extra time, resulting in parking delays and thus reducing the efficiency of valet parking services.

[0007] In view of this, it is necessary to propose a method for using parking lot maps with high map acquisition efficiency to address the above problems. Summary of the Invention

[0008] This application provides a method, device, and electronic device for using a parking lot map to improve the efficiency of valet parking services.

[0009] In a first aspect, embodiments of this application provide a method for using a parking lot map, the method comprising:

[0010] Real-time acquisition of the target vehicle's speed;

[0011] Real-time acquisition of the driving distance between the target vehicle and at least one candidate parking lot within a defined surrounding area;

[0012] When the newly obtained driving speed meets the preset parking conditions, the system retrieves map label information for at least one candidate parking lot within a set range around the target vehicle from the navigation system; wherein, the map label information indicates whether the map of the corresponding candidate parking lot has been downloaded and used.

[0013] Based on the driving distance of at least one newly obtained candidate parking lot, and combined with map label information, determine the map download order of at least one newly obtained candidate parking lot;

[0014] Based on the map download order, at least one map is selected from the most recently obtained candidate parking lot maps for download.

[0015] Optionally, the preset parking condition is that the duration of the state where the latest obtained driving speed is lower than the first speed threshold reaches the first preset duration threshold.

[0016] Optionally, based on the driving distance of the most recently obtained candidate parking lot and in conjunction with map label information, the map download order of the most recently obtained candidate parking lot is determined, including:

[0017] Based on map tag information, the maps of at least one newly obtained candidate parking lot are divided into a first group and a second group, respectively. The first group contains maps of candidate parking lots that have been downloaded and used, and the second group contains maps of candidate parking lots that have not been downloaded and used.

[0018] Based on the driving distance of at least one newly obtained candidate parking lot, the maps in the first group and the second group are sorted in order of driving distance from near to far.

[0019] Based on the sorted first and second groups, determine the map download order of the most recently obtained candidate parking lot.

[0020] Optionally, based on the sorted first and second groups, the map download order of the most recently obtained candidate parking lot is determined, including:

[0021] If the number of maps in the first group is zero, then the order of the maps in the second group is determined by the download order of the most recently obtained candidate parking lot map;

[0022] If the number of maps in the second group is zero, then the order of the maps in the first group is determined by the download order of the most recently obtained candidate parking lot.

[0023] If the number of maps in both the first and second groups is not zero, the download order for the latest candidate parking lot map is determined as follows: download the first group first, then download the second group.

[0024] Optionally, based on the map download order, at least one map is selected for download from the most recently obtained maps of at least one candidate parking lot, including:

[0025] If the number of newly obtained at least one candidate parking lot is less than the preset download number, then download all maps of the newly obtained at least one candidate parking lot.

[0026] If the number of newly obtained candidate parking lots is not less than the preset download limit, then a map that meets the preset download limit will be selected for download.

[0027] Optionally, the map download operation can be stopped when the latest obtained driving speed meets the preset departure conditions. The preset departure conditions are: the duration for which the latest obtained driving speed is higher than the second speed threshold reaches the second preset duration threshold.

[0028] Optionally, before downloading the map, if it is detected that the data storage capacity required by the target vehicle is greater than the remaining data storage capacity, the map currently stored in the target vehicle to be deleted is deleted; the map to be deleted is characterized by: a map that has not been used for more than the preset number of days.

[0029] Optionally, if the map to be deleted has corresponding map label information, the corresponding map label information of the map to be deleted can be saved;

[0030] Select map tag information that meets the preset deletion conditions from the map tag information stored in the target vehicle and delete it; the preset deletion conditions are: the corresponding map has not been downloaded for more than a preset interval of days.

[0031] Secondly, embodiments of this application also provide a device for using a parking lot map, the device comprising:

[0032] The acquisition module is used to acquire the driving speed of the target vehicle in real time; acquire the driving distance between the target vehicle and at least one candidate parking lot within a set range in real time; when the latest acquired driving speed meets the preset parking conditions, acquire the map label information of at least one candidate parking lot within a set range around the target vehicle from the navigation system; wherein, the map label information indicates whether the map of the corresponding candidate parking lot has been downloaded and used.

[0033] The determination module is used to determine the map download order of the most recently obtained candidate parking lot based on the driving distance of at least one candidate parking lot and in combination with map label information;

[0034] A module is used to select at least one map from at least one candidate parking lot map obtained most recently for download, based on the map download order.

[0035] Optionally, based on the driving distance of the most recently obtained candidate parking lot and in conjunction with map label information, the map download order of the most recently obtained candidate parking lot is determined. This determination module is used for:

[0036] Based on map tag information, the maps of at least one newly obtained candidate parking lot are divided into a first group and a second group, respectively. The first group contains maps of candidate parking lots that have been downloaded and used, and the second group contains maps of candidate parking lots that have not been downloaded and used.

[0037] Based on the driving distance of at least one newly obtained candidate parking lot, the maps in the first group and the second group are sorted in order of driving distance from near to far.

[0038] Based on the sorted first and second groups, determine the map download order of the most recently obtained candidate parking lot.

[0039] Optionally, based on the sorted first and second groups, the map download order of the most recently obtained candidate parking lot is determined, and the determining module is further used to:

[0040] If the number of maps in the first group is zero, then the order of the maps in the second group is determined by the download order of the most recently obtained candidate parking lot map;

[0041] If the number of maps in the second group is zero, then the order of the maps in the first group is determined by the download order of the most recently obtained candidate parking lot.

[0042] If the number of maps in both the first and second groups is not zero, the download order for the latest candidate parking lot map is determined as follows: download the first group first, then download the second group.

[0043] Optionally, based on the map download order, at least one map is selected from the most recently obtained maps of at least one candidate parking lot for download, using the module for:

[0044] If the number of newly obtained at least one candidate parking lot is less than the preset download number, then download all maps of the newly obtained at least one candidate parking lot.

[0045] If the number of newly obtained candidate parking lots is not less than the preset download limit, then a map that meets the preset download limit will be selected for download.

[0046] Optionally, the module can also be used for:

[0047] When the newly obtained driving speed meets the preset departure conditions, the map download operation is stopped; the preset departure conditions are: the duration of the state where the newly obtained driving speed is higher than the second speed threshold reaches the second preset duration threshold.

[0048] Optionally, the module can also be used for:

[0049] Before downloading the map, if the data storage capacity required by the target vehicle is greater than the remaining data storage capacity, the map currently stored in the target vehicle that is to be deleted is deleted; the map to be deleted is characterized by: a map that has not been used for more than a preset number of days.

[0050] Optionally, the module can also be used for:

[0051] When the map to be deleted has corresponding map label information, save the corresponding map label information of the map to be deleted;

[0052] Select map tag information that meets the preset deletion conditions from the map tag information stored in the target vehicle and delete it; the preset deletion conditions are: the corresponding map has not been downloaded for more than a preset interval of days.

[0053] Thirdly, embodiments of this application provide an electronic device, including a memory, a processor, and a computer program stored in the memory and executable by the processor, wherein the processor executes the computer program to implement the method as described in any of the first aspects.

[0054] Fourthly, embodiments of this application provide a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of any of the methods in the first aspect.

[0055] Fifthly, embodiments of this application provide a computer program product that, when invoked by a computer, causes the computer to execute the method as described in the first aspect.

[0056] In this embodiment, the driving speed of the target vehicle and the driving distance between the target vehicle and at least one candidate parking lot within a predetermined range are acquired in real time. When the latest acquired driving speed meets the preset parking conditions, the map label information of at least one candidate parking lot within the predetermined range of the target vehicle is acquired. Then, the map download order of the at least one candidate parking lot is determined. Finally, at least one map is selected for download. In this way, by monitoring the driving speed of the target vehicle in real time and automatically starting the download process, and by automatically searching for surrounding parking lots and sorting the map download order, a more optimized and suitable parking lot selection scheme is provided for valet parking. At the same time, starting the download process before the target vehicle establishes a connection with the parking lot service system ensures that the parking lot map is downloaded before the vehicle enters the parking lot, avoiding extra time consumption and thus improving the service efficiency of valet parking. Attached Figure Description

[0057] Figure 1 This is a schematic diagram of the application scenario in the embodiments of this application;

[0058] Figure 2This is a first flowchart illustrating a method for using a parking lot map according to an embodiment of this application;

[0059] Figure 3 This is a schematic diagram illustrating the real-time acquisition of the target vehicle's speed in an embodiment of this application;

[0060] Figure 4 This is a schematic diagram illustrating the real-time acquisition of the driving distance between the target vehicle and at least one candidate parking lot within a defined surrounding area, as described in this application embodiment.

[0061] Figure 5 This is a schematic diagram illustrating the acquisition of map label information for at least one candidate parking lot within a defined range surrounding the target vehicle, as described in this embodiment of the application.

[0062] Figure 6 This is a schematic diagram illustrating the process of obtaining the map download order in an embodiment of this application;

[0063] Figure 7 This is a schematic diagram illustrating the grouping of at least one recently obtained candidate parking lot map in an embodiment of this application;

[0064] Figure 8 This is a schematic diagram illustrating the sorting of the maps in each group in an embodiment of this application;

[0065] Figure 9 This is a flowchart illustrating the process of determining the map download order of at least one newly obtained candidate parking lot in an embodiment of this application;

[0066] Figure 10 This is a schematic diagram illustrating the determination of map download order when the number of maps in the first group is zero in this embodiment of the application;

[0067] Figure 11 This is a schematic diagram illustrating the determination of map download order when the number of maps in the second group in this embodiment is zero;

[0068] Figure 12 This is a schematic diagram illustrating the determination of map download order when the number of maps in both the first and second groups in this embodiment is not zero.

[0069] Figure 13 This is a schematic diagram illustrating the process of selecting at least one map for download in an embodiment of this application;

[0070] Figure 14 This is a schematic diagram illustrating the determination of the number of maps downloaded in an embodiment of this application;

[0071] Figure 15 This is a second flowchart illustrating a method for using a parking lot map according to an embodiment of this application;

[0072] Figure 16This is a schematic diagram illustrating the process of deleting the currently stored map to be deleted for the target vehicle in an embodiment of this application;

[0073] Figure 17 This is a schematic diagram of the structure of a parking lot map usage device according to an embodiment of this application;

[0074] Figure 18 This is a schematic diagram of the structure of the electronic device in the embodiments of this application. Detailed Implementation

[0075] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of this application, and not all of the embodiments. Based on the embodiments of this application, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of this application.

[0076] The following explanations of some terms used in the embodiments of this application are provided to facilitate understanding by those skilled in the art.

[0077] (1) After establishing a connection with a parking lot that offers valet parking, the valet parking program downloads a parking lot map and searches for parking spaces based on the downloaded map. It then plans a path from its current location to the parking space and finally controls the vehicle to automatically drive to the parking space, achieving fully automated parking. During the parking process, the valet parking program generates a driving path through a path planning algorithm. Based on the response to obstacles and the vehicle's dynamic constraints, it can ensure the safety and comfort of autonomous parking.

[0078] (2) Map tag information: Map tag information stored by the vehicle navigation system. Figure 1 A corresponding tag indicates whether the map has been downloaded and used, ensuring that drivers can easily and quickly find previously downloaded and used maps.

[0079] The design concept of the embodiments of this application is briefly introduced below:

[0080] With the development of artificial intelligence technology, people are increasingly relying on intelligent driving when traveling by car, and valet parking services are gradually entering people's lives.

[0081] Currently, when a vehicle equipped with a valet parking program arrives at a parking lot that provides valet parking services, the parking lot's service system can provide fully automated parking services without the need for manual operation, thus providing convenience for users' daily travel.

[0082] Specifically, when a vehicle arrives at a parking lot, the valet parking program inside the vehicle connects with the parking lot's service system, downloads a parking lot map, searches for parking spaces based on the map, and controls the vehicle to move until it is safely parked in a space.

[0083] However, the above service method has the following problems:

[0084] Because the valet parking process only begins downloading the parking map after the vehicle has arrived at the parking lot and established a connection with the parking lot's service system, it takes extra time, resulting in parking delays.

[0085] Furthermore, because parking lot maps are highly accurate while vehicle data storage capacity is limited, if the valet parking program downloads too many maps, causing excessive data storage usage in the vehicle, the valet parking program may experience slow operation or crashes.

[0086] In view of this, this application provides a method, apparatus, device, and storage medium for using a parking lot map. The method involves real-time acquisition of the target vehicle's speed and the distance between the target vehicle and at least one candidate parking lot within a predetermined range. When the latest acquired speed meets preset parking conditions, map tag information for at least one candidate parking lot within the predetermined range around the target vehicle is retrieved from the navigation system. Then, the download order of the newly acquired at least one candidate parking lot map is determined. Finally, at least one map is selected from the newly acquired at least one candidate parking lot map for download. This ensures that the parking lot map is downloaded before the vehicle enters the parking lot, avoiding extra time consumption and improving the efficiency of valet parking services. Furthermore, before downloading the map, maps that have not been used for more than a preset number of consecutive days are deleted based on the vehicle's required data storage capacity. This ensures that the vehicle has sufficient data storage capacity to store the parking lot maps to be downloaded, preventing valet parking program malfunctions and improving valet parking service performance.

[0087] The preferred embodiments of this application will now be described in detail with reference to the accompanying drawings.

[0088] like Figure 1The diagram illustrates an application scenario of an embodiment of this application. The application scenario diagram includes a server 110, a target vehicle 120, and parking lots P1, P2, P3, P4, and P5. The target vehicle 120 establishes a connection with the server 110, and the server obtains the target vehicle 120's driving speed and the driving distance between the target vehicle 120 and at least one candidate parking lot within a set surrounding range in real time. When the latest obtained driving speed meets preset parking conditions, the server obtains map tag information of at least one candidate parking lot within a set surrounding range from the navigation system. Based on the latest obtained driving distance of at least one candidate parking lot and the map tag information, the server determines the map download order of the latest obtained at least one candidate parking lot. Based on the map download order, the server selects at least one map from the maps of the latest obtained at least one candidate parking lot for download.

[0089] Server 110 can be a standalone physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, content delivery networks (CDN), and big data and artificial intelligence platforms.

[0090] Based on the above embodiments, see Figure 2 The diagram shown is a first flowchart illustrating a method for using a parking lot map according to an embodiment of this application, specifically including:

[0091] Step 20: Obtain the real-time speed of the target vehicle.

[0092] In this embodiment of the application, the driving speed of the target vehicle is obtained in real time from the vehicle speed measurement module or navigation system of the target vehicle.

[0093] For example, such as Figure 3 The diagram shows a real-time acquisition of the target vehicle's speed. The target vehicle's speed is acquired every 0.5 seconds from its speed measuring device, or every 0.1 seconds from the navigation system.

[0094] Step 21: Obtain the driving distance between the target vehicle and at least one candidate parking lot within the surrounding set range in real time.

[0095] In this embodiment of the application, the target vehicle establishes a connection with the server and obtains the driving distance between the target vehicle and at least one candidate parking lot within a set range in real time from the server.

[0096] For example, such as Figure 4 The diagram shows the real-time acquisition of the driving distance between the target vehicle and at least one candidate parking lot within a defined radius. The real-time driving distances to the five candidate parking lots within a 2-kilometer radius of the vehicle are 0.3 km, 0.8 km, 1.5 km, 2 km, and 2.5 km, respectively.

[0097] Step 22: When the newly obtained driving speed meets the preset parking conditions, obtain the map label information of at least one candidate parking lot within a set range around the target vehicle from the navigation system.

[0098] The map tag information indicates whether the map of the corresponding candidate parking lot has been downloaded and used.

[0099] In this embodiment of the application, when the duration of the state in which the newly obtained driving speed is lower than the first speed threshold reaches the first preset duration threshold, map label information of at least one candidate parking lot within a set range around the target vehicle is obtained from the navigation system.

[0100] For example, such as Figure 5 The diagram illustrates the acquisition of map label information for at least one candidate parking lot within a set range around a target vehicle. Assuming a speed threshold of 20 km / h and a preset time threshold of 20 seconds, when the target vehicle travels at a speed between 10 km / h and 15 km / h for 20 seconds, the target vehicle will acquire map label information for four candidate parking lots within a set range around the target vehicle from the parking lot map database of the navigation system: Map Label Information 1, Map Label Information 2, Map Label Information 3, and Map Label Information 4.

[0101] Step 23: Based on the driving distance of the most recently obtained candidate parking lot, and in combination with the map label information, determine the map download order of the most recently obtained candidate parking lot.

[0102] Specifically, during step 23, the valet parking procedure performs the following operations: Figure 6 This is a schematic diagram illustrating the process of obtaining the map download order in an embodiment of this application. The following is in conjunction with the attached diagram. Figure 6 The specific operations to be performed will be explained in detail:

[0103] Step 230: Based on the map label information, divide the maps of at least one newly obtained candidate parking lot into the first group and the second group respectively.

[0104] The first group contains maps of candidate parking lots that have been downloaded and used, and the second group contains maps of candidate parking lots that have not been downloaded and used.

[0105] In this embodiment of the application, the valet parking program installed on the target vehicle divides the map of at least one newly obtained candidate parking lot into a map of candidate parking lots that has been downloaded and used or a map of candidate parking lots that has not been downloaded and used, depending on whether the map has corresponding map label information.

[0106] For example, such as Figure 7 The diagram shown illustrates the grouping of maps containing at least one newly acquired candidate parking lot. Figure 1 , 3 5. It has corresponding map label information, Figure 2 , 4 If there is no corresponding map label information, then the location will be... Figure 1 , 3 Divide the land into two groups, number 5 and number 6, and place the land in the first group. Figure 2 , 4 6 and 6 are divided into the second group.

[0107] Step 231: Based on the driving distance of at least one newly obtained candidate parking lot, sort the maps in the first group and the second group in order of driving distance from near to far.

[0108] In this embodiment of the application, the valet parking program first sorts the maps in the first group in order of the driving distance between the target vehicle and the corresponding parking lot from near to far, and then sorts the maps in the second group in order of the driving distance between the target vehicle and the corresponding parking lot from near to far.

[0109] For example, such as Figure 8 The diagram shows the sorting of maps in each group. The first group contains... Figure 1 , 3 The travel distances of maps 2, 3, and 4 are 0.3 km, 0.8 km, and 0.5 km respectively. Therefore, the maps in the first group should be sorted as follows: Figure 1 ,land Figure 5 ,land Figure 3 The second group Figure 2 , 4 The travel distances of maps 1 km, 0.6 km, and 1.2 km are respectively. Therefore, the maps in the second group should be sorted as follows: Figure 4 ,land Figure 2 ,land Figure 6 .

[0110] Step 232: Based on the sorted first and second groups, determine the map download order of the most recently obtained candidate parking lots.

[0111] Specifically, during step 232, the valet parking procedure performs the following operations. See also... Figure 9As shown, this is a flowchart illustrating the process of determining the map download order of at least one recently obtained candidate parking lot in an embodiment of this application. The following is a detailed explanation in conjunction with the attached diagram. Figure 9 The specific operations to be performed will be explained in detail:

[0112] Step 2320: Determine if the number of maps in the first group is zero. If yes, proceed to step 2321; otherwise, proceed to step 2322.

[0113] Step 2321: Determine the order of the maps in the second group as the download order of the most recently obtained candidate parking lot map.

[0114] In this embodiment of the application, if it is determined that the number of maps in the first group is zero, then the number of maps in the second group is not zero. Therefore, the order of the maps in the second group is determined to be the download order of the most recently obtained candidate parking lot maps.

[0115] For example, such as Figure 10 As shown, this diagram illustrates how the map download order is determined when the number of maps in the first group is zero. If the number of maps in the first group is 0, the order of the three maps in the second group is as follows: Figure 4 ,land Figure 2 ,land Figure 6 The map download order for the most recently obtained candidate parking lot is determined as follows: Figure 4 ,land Figure 2 ,land Figure 6 .

[0116] Step 2322: Determine if the number of maps in the second group is 0. If yes, proceed to step 2323; otherwise, proceed to step 2324.

[0117] Step 2323: Determine the order of the maps in the first group as the download order of the most recently obtained candidate parking lot map.

[0118] In this embodiment of the application, if it is determined that the number of maps in the second group is zero, then the number of maps in the first group is not zero, and the order of the maps in the first group is determined to be the download order of the most recently obtained candidate parking lot maps.

[0119] For example, such as Figure 11 As shown, this diagram illustrates how the map download order is determined when the number of maps in the second group is zero. If the number of maps in the second group is 0, the order of the three maps in the first group is as follows: Figure 1 ,land Figure 5 ,land Figure 3 The map download order for the most recently obtained candidate parking lot is determined as follows: Figure 1 ,land Figure 5 ,land Figure 3 .

[0120] Step 2324: Determine the download order of the maps for the latest at least one candidate parking lot as follows: download the first group first, then download the second group.

[0121] In this embodiment of the application, if it is determined that the number of maps in both the first group and the second group is not zero, then the download order of the latest obtained at least one candidate parking lot map is determined to be: download the first group first, and then download the second group.

[0122] For example, such as Figure 12 As shown, this diagram illustrates how the download order of maps is determined when the number of maps in both the first and second groups is not zero. The three maps in the first group are arranged in the following order: Figure 1 ,land Figure 5 ,land Figure 3 The three maps in the second group are arranged in the following order: Figure 4 ,land Figure 2 ,land Figure 6 The map download order for the most recently obtained candidate parking lot is determined as follows: Figure 1 ,land Figure 5 ,land Figure 3 ,land Figure 4 ,land Figure 2 ,land Figure 6 .

[0123] Step 24: Based on the map download order, select at least one map from the most recently obtained candidate parking lot maps for download.

[0124] Specifically, during step 24, the valet parking procedure performs the following operations. (See also...) Figure 12 As shown, this is a schematic diagram illustrating the process of selecting at least one map from at least one recently obtained candidate parking lot map for download in an embodiment of this application. The following is a detailed explanation in conjunction with the attached diagram. Figure 13 The specific operations to be performed will be explained in detail:

[0125] Step 240: Determine whether the number of the latest obtained candidate parking lots is less than the preset download number. If yes, proceed to step 241; otherwise, proceed to step 242.

[0126] Step 241: Download all the latest maps of at least one candidate parking lot.

[0127] In this embodiment of the application, it is determined whether the number of the latest obtained at least one candidate parking lot is less than the preset download number. If the number of the latest obtained at least one candidate parking lot is less than the preset download number, then all the maps of the latest obtained at least one candidate parking lot are downloaded.

[0128] For example, such as Figure 14As shown, assuming the preset download quantity is 5, and the number of newly obtained at least one candidate parking lot is 3, since the number of newly obtained at least one candidate parking lot (3) is less than the preset download quantity of 5, then all maps of the 3 newly obtained candidate parking lots will be downloaded.

[0129] Step 242: Select maps that meet the preset download quantity and download them.

[0130] In this embodiment of the application, it is determined whether the number of the latest obtained at least one candidate parking lot is less than the preset download number. If the number of the latest obtained at least one candidate parking lot is not less than the preset download number, then a map that meets the preset download number is selected for download.

[0131] For example, such as Figure 14 As shown, assuming the preset download quantity is 5, the number of newly obtained at least one candidate parking lot is 7, and the number of newly obtained at least one candidate parking lot 7 is not less than the preset download quantity of 5, then 5 maps are selected for download.

[0132] Based on the above embodiments, see Figure 15 The diagram shown is a second flowchart illustrating a method for using a parking lot map according to an embodiment of this application, specifically including:

[0133] Step 1500: Obtain the real-time speed of the target vehicle.

[0134] Step 1501: Obtain in real time the driving distance between the target vehicle and at least one candidate parking lot within a set range.

[0135] Step 1502: When the newly obtained driving speed meets the preset parking conditions, obtain the map label information of at least one candidate parking lot within a set range around the target vehicle from the navigation system.

[0136] Step 1503: Based on the map label information, divide the maps of at least one newly obtained candidate parking lot into the first group and the second group respectively.

[0137] Step 1504: Based on the driving distance of at least one newly obtained candidate parking lot, sort the maps in the first group and the second group in order of driving distance from near to far.

[0138] Step 1505: Determine if the number of maps in the first group is zero. If yes, proceed to step 1506; otherwise, proceed to step 1507.

[0139] Step 1506: Determine the order of the maps in the second group as the download order of the most recently obtained candidate parking lot maps.

[0140] Step 1507: Determine if the number of maps in the second group is zero. If yes, proceed to step 1508; otherwise, proceed to step 1509.

[0141] Step 1508: Determine the order of the maps in the first group as the download order of the most recently obtained candidate parking lot maps.

[0142] Step 1509: Determine the download order of the maps for at least one newly obtained candidate parking lot as follows: download the first group first, then download the second group.

[0143] Step 1510: Determine whether the number of the latest obtained candidate parking lots is less than the preset download number. If yes, proceed to step 1511; otherwise, proceed to step 1512.

[0144] Step 1511: Download all the latest maps of at least one candidate parking lot.

[0145] Step 1512: Select maps that meet the preset download quantity and download them.

[0146] Based on the above embodiments, in practical applications, step 25 can also be performed: before downloading the map, if it is detected that the data storage capacity required by the target vehicle is greater than the remaining data storage capacity, the map currently stored by the target vehicle can also be deleted.

[0147] Specifically, during step 25, the valet parking procedure performs the following operations. (See attached diagram.) Figure 16 The specific operations to be performed will be explained in detail:

[0148] Step 250: Before downloading the map, it was detected that the data storage capacity required by the target vehicle was greater than the remaining data storage capacity.

[0149] For example, before map detection, the target vehicle requires 50MB of data storage capacity, and the remaining data storage capacity is 30MB. When the target vehicle is detected, the required data storage capacity of 50MB is greater than the remaining data storage capacity of 30MB.

[0150] Step 251: Delete the currently stored map to be deleted for the target vehicle. The map to be deleted is characterized as a map that has not been used for more than the preset number of days.

[0151] For example, assuming the preset usage period is 30 days, and the target vehicle currently has 5 maps that have not been used for 60, 50, 40, 20, and 10 consecutive days respectively, then the 3 maps with 60, 50, and 40 consecutive days of unused data will be deleted.

[0152] Step 252: If the map to be deleted has corresponding map label information, save the corresponding map label information of the map to be deleted.

[0153] For example, two of the three maps to be deleted have map label information, namely: "Map". Figure 1 ","land Figure 2 If one map does not have map label information, then save the map label information "map". Figure 1 ","land Figure 2 "The corresponding two maps."

[0154] Step 253: Select map tag information that meets the preset deletion conditions from the map tag information stored in the target vehicle and delete it. The preset deletion conditions are: the corresponding map has not been downloaded for more than a preset interval of days.

[0155] For example, assuming the preset interval is 60 days, if the number of days the corresponding maps have not been downloaded in the 6 map tag information stored in the target vehicle is 150 days, 100 days, 95 days, 50 days, 45 days, and 30 days respectively, then the map tag information with the corresponding number of days the maps have not been downloaded is selected.

[0156] In practical applications, step 26 can also be performed:

[0157] Once the newly obtained driving speed meets the preset departure conditions, stop the map download operation.

[0158] The preset departure condition is: the duration of the state where the latest obtained driving speed is higher than the second speed threshold reaches the second preset duration threshold.

[0159] For example, assuming the second speed threshold is 40 km / h and the second preset duration threshold is 10 seconds, when the target vehicle travels at a speed between 45 km / h and 50 km / h for 10 seconds, the valet parking program will stop the map download operation.

[0160] Based on the same technical concept, see [reference] Figure 17 As shown in the figure, this application embodiment also provides a parking lot map usage device, the device comprising:

[0161] Acquisition module 1701: used to acquire the driving speed of the target vehicle in real time; acquire the driving distance between the target vehicle and at least one candidate parking lot within a set range in real time; when the latest acquired driving speed meets the preset parking conditions, acquire the map label information of at least one candidate parking lot within a set range around the target vehicle from the navigation system; wherein, the map label information indicates whether the map of the corresponding candidate parking lot has been downloaded and used.

[0162] Determine module 1702: Based on the driving distance of the latest candidate parking lot and combined with map label information, determine the map download order of the latest candidate parking lot.

[0163] Use module 1703: to select at least one map from the most recently acquired candidate parking lot maps for download based on the map download order.

[0164] Optionally, based on the driving distance of the most recently obtained candidate parking lot and in conjunction with map label information, the map download order of the most recently obtained candidate parking lot is determined. Module 1702 is used for:

[0165] Based on map tag information, the maps of at least one newly obtained candidate parking lot are divided into a first group and a second group, respectively. The first group contains maps of candidate parking lots that have been downloaded and used, and the second group contains maps of candidate parking lots that have not been downloaded and used.

[0166] Based on the driving distance of at least one newly obtained candidate parking lot, the maps in the first group and the second group are sorted in order of driving distance from near to far.

[0167] Based on the sorted first and second groups, determine the map download order of the most recently obtained candidate parking lot.

[0168] Optionally, based on the sorted first and second groups, the map download order of the most recently obtained candidate parking lot is determined, and the determining module 1702 is further configured to:

[0169] If the number of maps in the first group is zero, then the order of the maps in the second group is determined by the download order of the most recently obtained candidate parking lot map;

[0170] If the number of maps in the second group is zero, then the order of the maps in the first group is determined by the download order of the most recently obtained candidate parking lot.

[0171] If the number of maps in both the first and second groups is not zero, the download order for the latest candidate parking lot map is determined as follows: download the first group first, then download the second group.

[0172] Optionally, based on the map download order, at least one map is selected from the most recently acquired candidate parking lot maps for download, using module 1703 for:

[0173] If the number of newly obtained at least one candidate parking lot is less than the preset download number, then download all maps of the newly obtained at least one candidate parking lot.

[0174] If the number of newly obtained candidate parking lots is not less than the preset download limit, then a map that meets the preset download limit will be selected for download.

[0175] Optionally, module 1703 can also be used for:

[0176] The map download operation stops when the newly acquired driving speed meets the preset departure conditions. The preset departure conditions are: the duration for which the newly acquired driving speed is higher than the second speed threshold reaches the second preset duration threshold.

[0177] Optionally, module 1703 can also be used for:

[0178] Before downloading the map, if the data storage capacity required by the target vehicle is greater than the remaining data storage capacity, the map currently stored in the target vehicle that is to be deleted is deleted; the map to be deleted is characterized by: a map that has not been used for more than a preset number of days.

[0179] Optionally, module 1703 can also be used for:

[0180] When the map to be deleted has corresponding map label information, save the corresponding map label information of the map to be deleted;

[0181] Select map tag information that meets the preset deletion conditions from the map tag information stored in the target vehicle and delete it; the preset deletion conditions are: the corresponding map has not been downloaded for more than a preset interval of days.

[0182] Based on the same technical concept, this application also provides an electronic device that can implement the method flow for using the parking map provided in the above embodiments of this application.

[0183] In one embodiment, the electronic device may be a server, a terminal device, or other electronic devices.

[0184] See Figure 18 As shown, the electronic device may include:

[0185] At least one processor 1801 and a memory 1802 connected to at least one processor 1801. In this embodiment, the specific connection medium between the processor 1801 and the memory 1802 is not limited. Figure 18 The example shown is the connection between processor 1801 and memory 1802 via bus 1800. Bus 1800 is... Figure 18 The connections between other components are shown in thick lines only and are not intended to be limiting. The 1800 bus can be divided into address bus, data bus, control bus, etc., for ease of representation. Figure 18The term is represented by a single thick line, but this does not imply that there is only one bus or one type of bus. Alternatively, the processor 1801 can also be called a controller; there is no restriction on the name.

[0186] In this embodiment, memory 1802 stores instructions executable by at least one processor 1801. By executing the instructions stored in memory 1802, at least one processor 1801 can perform a parking map usage method described above. Processor 1801 can implement... Figure 17 The functions of each module in the device shown.

[0187] The processor 1801 is the control center of the device. It can connect to various parts of the control device through various interfaces and lines. By running or executing instructions stored in memory 1802 and calling data stored in memory 1802, the processor can monitor the device's various functions and process data.

[0188] In one possible design, processor 1801 may include one or more processing units. Processor 1801 may integrate an application processor and a modem processor, wherein the application processor mainly handles the operating system, user interface, and applications, and the modem processor mainly handles wireless communication. It is understood that the modem processor may also not be integrated into processor 1801. In some embodiments, processor 1801 and memory 1802 may be implemented on the same chip; in some embodiments, they may also be implemented on separate chips.

[0189] The processor 1801 can be a general-purpose processor, such as a CPU, digital signal processor, application-specific integrated circuit, field-programmable gate array or other programmable logic device, discrete gate or transistor logic device, or discrete hardware component, capable of implementing or executing the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor can be a microprocessor or any conventional processor. The steps of a parking map usage method disclosed in the embodiments of this application can be directly manifested as execution by a hardware processor, or execution by a combination of hardware and software modules within the processor.

[0190] Memory 1802, as a non-volatile computer-readable storage medium, can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. Memory 1802 may include at least one type of storage medium, such as flash memory, hard disk, multimedia card, card-type memory, random access memory (RAM), static random access memory (SRAM), programmable read-only memory (PROM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), magnetic storage, magnetic disk, optical disk, etc. Memory 1802 can be any other medium capable of carrying or storing desired program code in the form of instructions or data structures that can be accessed by a computer, but is not limited thereto. In the embodiments of this application, memory 1802 can also be a circuit or any other device capable of implementing storage functions for storing program instructions and / or data.

[0191] By designing and programming the processor 1801, the code corresponding to the parking map usage method described in the foregoing embodiments can be embedded into the chip, thereby enabling the chip to execute the code during runtime. Figure 2 The illustrated embodiment describes the steps of using a parking map. How to design and program the processor 1801 is a technique well-known to those skilled in the art and will not be described further here.

[0192] Based on the same inventive concept, embodiments of this application also provide a storage medium storing computer instructions that, when executed on a computer, cause the computer to perform a parking map usage method described above.

[0193] In some possible implementations, various aspects of the parking map usage method provided by this application can also be implemented in the form of a program product, which includes program code that, when the program product is run on a device, causes the control device to perform the steps in the parking map usage method according to the various exemplary embodiments of this application described above.

[0194] It should be noted that although several units or sub-units of the device have been mentioned in the detailed description above, this division is merely exemplary and not mandatory. In fact, according to embodiments of this application, the features and functions of two or more units described above can be embodied in one unit. Conversely, the features and functions of one unit described above can be further divided and embodied by multiple units.

[0195] Furthermore, although the operations of the method of this application are described in a specific order in the accompanying drawings, this does not require or imply that these operations must be performed in that specific order, or that all the operations shown must be performed to achieve the desired result. Additionally or alternatively, certain steps may be omitted, multiple steps may be combined into one step, and / or one step may be broken down into multiple steps.

[0196] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0197] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to this application. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0198] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0199] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0200] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the spirit and scope of this application. Therefore, if such modifications and variations fall within the scope of the claims of this application and their equivalents, this application also intends to include such modifications and variations.

Claims

1. A method of using a parking lot map, characterized by, The method is applied to a target vehicle, and comprises the following steps of: obtaining a driving speed of the target vehicle in real time; obtaining a driving distance between the target vehicle and at least one candidate parking lot within a preset range around the target vehicle in real time; when a latest obtained driving speed meets a preset parking condition, obtaining map label information of at least one candidate parking lot within the preset range around the target vehicle from a navigation system, wherein the map label information represents whether a corresponding map of the candidate parking lot has been downloaded and used; based on the map label information, dividing maps of the latest obtained at least one candidate parking lot into a first group and a second group respectively, wherein the first group comprises maps of candidate parking lots that have been downloaded and used, and the second group comprises maps of candidate parking lots that have not been downloaded and used; based on the driving distance of the latest obtained at least one candidate parking lot, sorting the maps in the first group and the second group in order from short to long driving distance respectively; based on the sorted first group and second group, determining a map downloading order of the latest obtained at least one candidate parking lot; based on the map downloading order, selecting at least one map from the maps of the latest obtained at least one candidate parking lot for downloading.

2. The method of claim 1, wherein, The preset parking condition is that a state in which the latest obtained driving speed is lower than a first speed threshold lasts for a first preset time threshold.

3. The method of claim 1, wherein, The method further comprises the following steps of: if the number of maps in the first group is zero, determining an arrangement order of the maps in the second group as the map downloading order of the latest obtained at least one candidate parking lot; if the number of maps in the second group is zero, determining an arrangement order of the maps in the first group as the map downloading order of the latest obtained at least one candidate parking lot; if the number of maps in the first group and the second group is not zero, determining the map downloading order of the latest obtained at least one candidate parking lot as downloading the first group first and then downloading the second group.

4. The method according to any one of claims 1 to 3, characterized in that, The method further comprises the following steps of: if the number of the latest obtained at least one candidate parking lot is less than a preset downloading number, downloading all the maps of the latest obtained at least one candidate parking lot; if the number of the latest obtained at least one candidate parking lot is not less than the preset downloading number, selecting maps meeting the preset downloading number for downloading.

5. The method of claim 4, wherein, The method further comprises the following steps of: when a latest obtained driving speed meets a preset driving-off condition, stopping the map downloading operation, wherein the preset driving-off condition is that a state in which the latest obtained driving speed is higher than a second speed threshold lasts for a second preset time threshold.

6. The method of claim 4, wherein, The method further comprises the following steps of: Before downloading the map, when it is detected that the required data storage capacity of the target vehicle is greater than the remaining data storage capacity, the target vehicle currently stores a to-be-deleted map; wherein the to-be-deleted map represents a map whose consecutive non-use days exceed a preset use day number.

7. The method of claim 6, wherein, The method further comprises: When the to-be-deleted map has corresponding map label information, saving the corresponding map label information of the to-be-deleted map; From the map label information stored by the target vehicle, selecting map label information that meets a preset deletion condition for deletion; the preset deletion condition is that the corresponding map has not been downloaded for more than a preset interval day number.

8. A parking lot map use device characterized by comprising: Comprise: An acquisition module is configured to acquire a driving speed of a target vehicle in real time; The driving distance between the target vehicle and at least one candidate parking lot within a set range around the target vehicle is acquired in real time; When the newly acquired driving speed meets a preset parking condition, map label information of at least one candidate parking lot within a set range around the target vehicle is acquired from a navigation system; wherein the map label information represents whether the corresponding candidate parking lot has been downloaded and used; A determination module is configured to divide the map of the at least one newly acquired candidate parking lot into a first group and a second group based on the map label information, wherein the first group contains the map of the candidate parking lot that has been downloaded and used, and the second group contains the map of the candidate parking lot that has not been downloaded and used; based on the driving distance of the at least one newly acquired candidate parking lot, the maps in the first group and the second group are sorted in order from near to far according to the driving distance; based on the sorted first group and second group, a map download order of the at least one newly acquired candidate parking lot is determined; A use module is configured to select at least one map from the at least one newly acquired candidate parking lot for downloading based on the map download order.

9. An electronic device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, The processor executes the computer program to implement the method of any one of claims 1-7.

10. A computer-readable storage medium having stored thereon a computer program, characterized in that, The computer program is executed by the processor to implement the steps of the method of any one of claims 1-7.

11. A computer program product, characterised in that, The computer program product, when invoked by a computer, causes the computer to perform the method of any one of claims 1-7.

Images