Vehicle loading and unloading point identification method and device, computer equipment and storage medium

Through the Internet of Vehicles data, the database is built and clustering algorithms and geographical distance calculations are applied to identify loading and unloading points, solving the cost and adaptability problems of relying on external sensors in the existing technology, and achieving efficient and accurate loading and unloading management and logistics optimization.

CN119026805APending Publication Date: 2024-11-26FAW JIEFANG AUTOMOTIVE CO
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411222510.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-09-02
Publication Date
2024-11-26

AI Technical Summary

Technical Problem

The prior art relies on external sensors in vehicle loading and unloading point identification, resulting in high cost and adaptability challenges, and traditional methods are time-consuming and error-prone.

Method used

Obtain vehicle driving data and parking data through the Internet of vehicles, build a bicycle loading and unloading point database and a comprehensive loading and unloading point database, and use DBSCAN clustering algorithm and semi-vector formula to identify loading and unloading points, reduce dependence on external equipment and improve identification accuracy and adaptability.

Benefits of technology

It realizes accurate identification of loading and unloading points, optimizes vehicle scheduling and path planning, reduces air driving and waiting time, reduces transportation costs, improves the intelligence and response speed of logistics management, and reduces operational risks and costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119026805A_ABST
    Figure CN119026805A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of Internet of Vehicles, in particular to a vehicle loading and unloading point identification method and device, computer equipment, a computer readable storage medium and a computer program product. The method comprises the following steps: acquiring vehicle driving data and parking data of the Internet of Vehicles; according to the vehicle driving data and the parking data of the Internet of Vehicles, constructing a single vehicle loading and unloading point database; obtaining a comprehensive loading and unloading point database according to the single vehicle loading and unloading point database of all vehicles in the Internet of Vehicles; acquiring newly added parking data; and according to the comprehensive loading and unloading point database, analyzing the newly added parking data to obtain a loading and unloading point identification result. By adopting the method, when the starting point and the ending point of loading and unloading are identified, the dependence on external equipment can be reduced, and the universality and the reliability are enhanced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of vehicle networking, and in particular to a vehicle loading and unloading point identification method, device, computer equipment, computer-readable storage medium and computer program product. Background Art

[0002] In the logistics industry, the identification of vehicle loading and unloading points is a key technical issue, which involves the efficiency and accuracy of cargo loading and unloading.

[0003] Traditional methods rely on video surveillance, clocking in at fixed points or manual statistics, which are time-consuming, costly, and error-prone. Some current solutions collect vehicle stop and cargo loading data, calculate cargo volume and loading acceleration, establish cargo loading models, analyze loading volume change trends, and identify the start and end points of loading and unloading, but this method relies on external sensors, which brings cost and adaptability challenges.

[0004] Therefore, there is an urgent need for a vehicle loading and unloading point identification method, device, computer equipment, computer readable storage medium and computer program product that can reduce dependence on external equipment when identifying the starting and ending points of loading and unloading and enhance universality and reliability. Summary of the invention

[0005] Based on this, it is necessary to provide a vehicle loading and unloading point identification method, device, computer equipment, computer-readable storage medium and computer program product that can reduce dependence on external equipment and enhance universality and reliability when identifying the starting and ending points of loading and unloading in response to the above-mentioned technical problems.

[0006] In a first aspect, the present application provides a method for identifying a vehicle loading and unloading point, comprising:

[0007] Obtain vehicle driving data and parking data from the Internet of Vehicles;

[0008] Building a single vehicle loading and unloading point database based on vehicle driving data and parking data of the Internet of Vehicles;

[0009] Obtaining a comprehensive loading and unloading point database based on the single-vehicle loading and unloading point database of all vehicles in the vehicle network;

[0010] Get new parking data;

[0011] The newly added parking data is analyzed according to the comprehensive loading and unloading point database to obtain a loading and unloading point identification result.

[0012] In one embodiment, before constructing a single vehicle loading and unloading point database based on the vehicle driving data and parking data of the vehicle network, the method further includes:

[0013] Acquiring vehicle oil level change data based on vehicle driving data of the connected vehicle network;

[0014] Determining a stop and refueling point based on the oil level change data;

[0015] The parking data of the Internet of Vehicles is simplified according to the parking and refueling point.

[0016] In one embodiment, the simplified processing of the parking data of the Internet of Vehicles according to the parking and refueling point includes:

[0017] According to the parking data of the Internet of Vehicles, obtaining a first parking time of the vehicle at a non-parking refueling point other than the parking refueling point;

[0018] When the first parking time is less than a preset time, the relevant parking data of the corresponding non-parking refueling point is deleted from the parking data of the connected vehicle network.

[0019] In one embodiment, the step of constructing a single vehicle loading and unloading point database based on vehicle driving data and parking data of the Internet of Vehicles includes:

[0020] Calculating a first geographical distance between parking spots of a single vehicle using a haversine formula according to the parking data of the Internet of Vehicles;

[0021] According to the first geographical distance between the parking points, a clustering algorithm is used to obtain a minimum number of points and a neighborhood radius;

[0022] Calculate the center point of each cluster point group according to the minimum number of points and the neighborhood radius;

[0023] According to the center point of each cluster point group, a single vehicle loading and unloading point database will be constructed.

[0024] In one embodiment, after acquiring the newly added parking data, the method further includes:

[0025] According to the newly added parking data, obtaining a second parking time of the vehicle at the newly added parking spot;

[0026] When the second parking time is less than a preset time, the relevant parking data of the corresponding newly added parking spot is deleted from the newly added parking data.

[0027] In one embodiment, the analyzing the newly added parking data according to the comprehensive loading and unloading point database to obtain the loading and unloading point identification result includes:

[0028] When the second parking time is not less than the preset time, using the haversine formula, calculating the second geographical distance between the newly added parking point and each loading and unloading point in the comprehensive loading and unloading point database;

[0029] When the second geographical distance is less than a preset distance threshold, the newly added parking point is a loading and unloading point.

[0030] In a second aspect, the present application also provides a vehicle loading and unloading point identification device, comprising:

[0031] An acquisition module, used to acquire vehicle driving data and parking data of the Internet of Vehicles;

[0032] A database construction module, used to construct a single vehicle loading and unloading point database based on vehicle driving data and parking data of the Internet of Vehicles;

[0033] The database construction module is further used to obtain a comprehensive loading and unloading point database based on the single-vehicle loading and unloading point database of all vehicles in the vehicle network;

[0034] The acquisition module is also used to obtain newly added parking data;

[0035] The identification module is used to analyze the newly added parking data according to the comprehensive loading and unloading point database to obtain a loading and unloading point identification result.

[0036] In a third aspect, the present application further provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0037] Obtain vehicle driving data and parking data from the Internet of Vehicles;

[0038] Building a single vehicle loading and unloading point database based on vehicle driving data and parking data of the Internet of Vehicles;

[0039] Obtaining a comprehensive loading and unloading point database based on the single-vehicle loading and unloading point database of all vehicles in the vehicle network;

[0040] Get new parking data;

[0041] The newly added parking data is analyzed according to the comprehensive loading and unloading point database to obtain a loading and unloading point identification result.

[0042] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the following steps are implemented:

[0043] Obtain vehicle driving data and parking data from the Internet of Vehicles;

[0044] Building a single vehicle loading and unloading point database based on vehicle driving data and parking data of the Internet of Vehicles;

[0045] Obtaining a comprehensive loading and unloading point database based on the single-vehicle loading and unloading point database of all vehicles in the vehicle network;

[0046] Get new parking data;

[0047] The newly added parking data is analyzed according to the comprehensive loading and unloading point database to obtain a loading and unloading point identification result.

[0048] In a fifth aspect, the present application further provides a computer program product, including a computer program, which implements the following steps when executed by a processor:

[0049] Obtain vehicle driving data and parking data from the Internet of Vehicles;

[0050] Building a single vehicle loading and unloading point database based on vehicle driving data and parking data of the Internet of Vehicles;

[0051] Obtaining a comprehensive loading and unloading point database based on the single-vehicle loading and unloading point database of all vehicles in the vehicle network;

[0052] Get new parking data;

[0053] The newly added parking data is analyzed according to the comprehensive loading and unloading point database to obtain a loading and unloading point identification result.

[0054] The above-mentioned vehicle loading and unloading point identification method, device, computer equipment, computer-readable storage medium and computer program product can optimize vehicle scheduling and route planning, reduce idle driving and waiting time, and thus improve overall loading and unloading efficiency by accurately identifying loading and unloading points. Accurate identification of loading and unloading points helps logistics companies reduce unnecessary transportation costs. By optimizing resource allocation, reducing fuel consumption and labor costs, and building a single vehicle and comprehensive loading and unloading point database, combined with real-time analysis of newly added parking data, it can realize intelligent logistics management and improve response speed and decision-making quality. The system has the ability to dynamically update, and can continuously optimize the identification results of loading and unloading points according to the newly added parking data, maintaining the timeliness and accuracy of the database. The application of the DBSCAN clustering algorithm enables the system to effectively process loading and unloading point data with scattered and sparse characteristics, improving adaptability and recognition accuracy in complex scenarios.

[0055] Through these technical effects, more refined and intelligent loading and unloading management can be achieved, resource allocation can be optimized, service quality can be improved, and operational risks and costs can be reduced. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the drawings required for use in the embodiments of the present application or related technical descriptions will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0057] Figure 1 A diagram showing an application environment of a method for identifying a vehicle loading and unloading point in one embodiment;

[0058] Figure 2 A schematic diagram of a process flow of a method for identifying a vehicle loading and unloading point in one embodiment;

[0059] Figure 3 A schematic diagram of a flow chart of a method for identifying a vehicle loading and unloading point in another embodiment;

[0060] Figure 4 is a structural block diagram of a vehicle loading and unloading point identification device in one embodiment;

[0061] Figure 5 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0062] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0063] The vehicle loading and unloading point identification method provided in the embodiment of the present application can be applied to Figure 1 In the application environment shown, the terminal 102 communicates with the server 104 through a network. The data storage system can store data that the server 104 needs to process. The data storage system can be integrated on the server 104, or placed on the cloud or other network servers.

[0064] Server 104 obtains vehicle driving data and parking data of the Internet of Vehicles; constructs a single-vehicle loading and unloading point database based on the vehicle driving data and parking data of the Internet of Vehicles; obtains a comprehensive loading and unloading point database based on the single-vehicle loading and unloading point database of all vehicles in the Internet of Vehicles; obtains newly added parking data; analyzes the newly added parking data based on the comprehensive loading and unloading point database to obtain loading and unloading point identification results.

[0065] The terminal 102 may be, but is not limited to, various personal computers, laptops, smart phones, tablet computers, IoT devices, and portable wearable devices. The IoT devices may be smart speakers, smart TVs, smart air conditioners, smart car devices, projection devices, etc. Portable wearable devices may be smart watches, smart bracelets, head-mounted devices, etc. Head-mounted devices may be virtual reality (VR) devices, augmented reality (AR) devices, smart glasses, etc. The server 104 may be an independent physical server, a server cluster or distributed system consisting of multiple physical servers, or a cloud server that provides cloud computing services.

[0066] In an exemplary embodiment, Figure 2 As shown, a method for identifying vehicle loading and unloading points is provided, and the method is applied to Figure 1 The server in the example is used to illustrate, including the following steps S202 to S210. Among them:

[0067] Step S202, obtaining vehicle driving data and parking data of the Internet of Vehicles.

[0068] Specifically, the data comes from the Vehicle Networking, which is the connection and data exchange between the vehicle and the external network through the on-board information terminal and other communication equipment.

[0069] Among them, driving data includes various parameters of the vehicle during driving, such as:

[0070] Driving time: the driving time of the vehicle in different time periods.

[0071] Speed: The speed change of a vehicle during driving.

[0072] Fuel tank level: The change in the amount of fuel in the vehicle's fuel tank reflects fuel consumption.

[0073] Parking data includes relevant data of the vehicle when it is parked, such as:

[0074] Latitude and longitude: The geographical location of the parking spot, obtained through positioning systems such as GPS.

[0075] Parking time: the specific time when the vehicle starts and ends parking.

[0076] Parking duration: The length of time a vehicle stays at each parking spot.

[0077] Step S204: construct a single-vehicle loading and unloading point database based on the vehicle driving data and parking data of the Internet of Vehicles.

[0078] Specifically, the embodiment of the present application can use clustering algorithms such as DBSCAN to perform spatial clustering on the filtered parking data. An independent database is established for each vehicle to record all possible loading and unloading points of the vehicle. The records in the database may include information such as the latitude and longitude, frequency of occurrence, and parking duration of each loading and unloading point.

[0079] Step S206, obtaining a comprehensive loading and unloading point database based on the single-vehicle loading and unloading point database of all vehicles in the Internet of Vehicles.

[0080] Specifically, first, the single-vehicle loading and unloading point databases of all vehicles need to be aggregated to form a comprehensive database. This database will contain information such as the loading and unloading location, time, and frequency of each vehicle at different time points. The integrated data is analyzed in depth to identify locations that appear frequently and have loading and unloading characteristics. This may involve the analysis of multi-dimensional data such as parking duration, number of stops, and vehicle type.

[0081] For example, using clustering algorithms such as DBSCAN, take n months of data for analysis, and set the parameters of the DBSCAN algorithm: minimum number of points minPts = round up ⌈n / 2⌉, neighborhood radius eps = 500 meters. According to the parking behavior of vehicles and the spatial distribution of loading and unloading points, similar loading and unloading points are classified into one category. This helps to identify loading and unloading points with common characteristics. All potential loading and unloading points and their characteristic information are integrated into a comprehensive loading and unloading point database. The comprehensive loading and unloading point database needs to be updated regularly to reflect new loading and unloading behaviors and pattern changes to ensure the timeliness and accuracy of the data.

[0082] Step S208, obtaining newly added parking data.

[0083] Step S210: Analyze the newly added parking data according to the comprehensive loading and unloading point database to obtain the loading and unloading point identification result.

[0084] Specifically, as the vehicle continues to operate, new parking data will be generated. This data may include information such as new parking locations, parking duration, and parking time points. The vehicle status is monitored in real time through the Internet of Vehicles system, and the newly added parking data is collected, and the newly added parking data is cleaned and preprocessed to ensure data quality. This may include steps such as removing outliers, filling missing values, and unifying formats. Using the comprehensive loading and unloading point database as a reference, the newly added parking data is matched with the existing loading and unloading points in the database. To identify whether the newly added parking point is close to the known loading and unloading points. If the distance between the newly added parking point and the known loading and unloading point is within a certain threshold range (for example, within 1 km), it can be considered to be a loading and unloading point. The identification results may include confirming the new loading and unloading point or classifying the newly added parking point as a non-loading and unloading point.

[0085] Furthermore, the comprehensive loading and unloading point database is updated based on the analysis results. If it is confirmed to be a new loading and unloading point, it is added to the database; if it is not a loading and unloading point, it may not be updated or only recorded.

[0086] In the above-mentioned vehicle loading and unloading point identification method, by accurately identifying the loading and unloading points, the vehicle scheduling and route planning can be optimized, and the idle driving and waiting time can be reduced, thereby improving the overall loading and unloading efficiency. Accurately identifying loading and unloading points helps logistics companies reduce unnecessary transportation costs. By optimizing resource allocation, reducing fuel consumption and labor costs, and building a single vehicle and comprehensive loading and unloading point database, combined with real-time analysis of newly added parking data, it can realize intelligent logistics management and improve response speed and decision-making quality. The system has the ability to dynamically update, and can continuously optimize the identification results of loading and unloading points according to the newly added parking data to maintain the timeliness and accuracy of the database. The application of the DBSCAN clustering algorithm enables the system to effectively process loading and unloading point data with scattered and sparse characteristics, improving adaptability and recognition accuracy in complex scenarios.

[0087] In an exemplary embodiment, before constructing a single vehicle loading and unloading point database based on vehicle driving data and parking data of the Internet of Vehicles, the method further includes:

[0088] According to the vehicle driving data of the Internet of Vehicles, the vehicle's oil level change data is obtained;

[0089] Determine the parking and refueling point based on the oil level change data;

[0090] The parking data of the Internet of Vehicles is simplified according to the parking and refueling points.

[0091] Specifically, the vehicle driving data collected by the Internet of Vehicles, especially the tank level information, can be used to track the changes in the vehicle's oil volume during driving. By analyzing the vehicle's oil level data, it is monitored whether there is a significant increase in oil volume during parking, so as to infer whether the vehicle has been refueled. By comparing the oil level before and after parking, if it is found that the oil volume has increased by more than a certain threshold (for example, 50% of the total tank volume), the parking point can be identified as a refueling point. This judgment is based on the actual situation of oil volume changes and helps to distinguish the purpose of the vehicle's parking, whether it is loading and unloading or refueling.

[0092] After the refueling point is determined, the parking data of the connected vehicle is simplified, including removing or marking the parking records that have been determined as refueling points. The purpose of the simplification is to filter out parking events that are not related to loading and unloading, so that the subsequent analysis can focus on possible loading and unloading points.

[0093] In this embodiment, through the above steps, places where parking is done for refueling can be excluded, and when building a loading and unloading point database, parking behaviors related to loading and unloading can be more accurately identified and analyzed.

[0094] In an exemplary embodiment, the parking data of the Internet of Vehicles is simplified according to the parking and refueling points, including:

[0095] According to the parking data of the Internet of Vehicles, the first parking time of the vehicle at a non-parking refueling point other than the parking refueling point is obtained;

[0096] When the first parking time is less than the preset time, the relevant parking data of the corresponding non-parking refueling point is deleted from the parking data of the Internet of Vehicles.

[0097] Specifically, in addition to the determined parking and refueling points, other parking events need to be identified. These parking events may be related to loading and unloading, or may be parking for other reasons, such as temporary parking or rest.

[0098] For each non-stop refueling point, record the length of time the vehicle stops for the first time, which is called the "first parking duration". This duration is the time interval from when the vehicle stops moving to when it starts again. Set a duration threshold (for example, 30 minutes), which is determined based on business needs and data analysis. For example, if loading and unloading usually takes a long time, you can set a reasonable duration threshold to filter out those short-term parking data. If the first parking duration of a non-stop refueling point is less than the preset duration threshold, these parking events may not be related to loading and unloading, so these records can be deleted from the parking data. This helps to remove parking that may be caused by traffic signals, temporary breaks, or other short-term reasons.

[0099] By deleting these short parking records, the quality of the data can be improved, so that the remaining data is more concentrated on possible loading and unloading points, thus providing a clearer data basis for subsequent cluster analysis and loading and unloading point identification. The simplified parking data will more accurately reflect the actual loading and unloading behavior of the vehicle, help optimize the identification results of the loading and unloading points, and reduce misjudgments and missed judgments.

[0100] In this embodiment, through the above steps, the parking data of the Internet of Vehicles can be effectively cleaned and optimized, which helps logistics companies to more effectively manage and optimize the loading and unloading processes and improve logistics efficiency and service quality.

[0101] In an exemplary embodiment, Figure 3 As shown in the figure, based on the vehicle driving data and parking data of the Internet of Vehicles, a single vehicle loading and unloading point database is constructed, including:

[0102] Step S302, calculating the first geographical distance between parking spots of a single vehicle using the haversine formula according to the parking data of the Internet of Vehicles;

[0103] Step S304, using a clustering algorithm to obtain a minimum number of points and a neighborhood radius according to the first geographical distance between each parking point;

[0104] Step S306, calculating the center point of each cluster point group according to the minimum number of points and the neighborhood radius;

[0105] Step S308: construct a single vehicle loading and unloading point database based on the center point of each cluster point group.

[0106] Specifically, the Haversine Formula is used to calculate the geographic distance between different parking spots. This formula takes into account the curvature of the earth and is suitable for calculating the great circle distance between two points on the earth's surface, ensuring the accuracy of the distance calculation.

[0107] Next, a clustering algorithm, such as DBSCAN, is used to perform spatial cluster analysis on the parking spots. Clustering algorithms can help identify parking spots that are close in space, which may represent the loading and unloading points of vehicles. In the clustering process, two key parameters need to be determined: the minimum number of points (minPts) and the neighborhood radius (eps).

[0108] Among them, minPts defines the minimum number of parking points required to form a cluster. eps defines the maximum geographical distance considered when searching for neighborhoods. For example, take n months of data for analysis and set the parameters of the DBSCAN algorithm: minimum number of points minPts = round up ⌈n / 2⌉, neighborhood radius eps = 500 meters.

[0109] For each cluster point group identified by the clustering algorithm, the mean of its geographic coordinates (for example, the mean of longitude and latitude) is calculated to obtain the center point of the cluster point group. This center point represents the typical location of the cluster point group and can be regarded as a potential loading and unloading point.

[0110] The calculated cluster centers, along with their geographic coordinates, cluster information, and other relevant features, are stored in a single vehicle loading and unloading point database. This database records all potential loading and unloading points for a single vehicle. As vehicles continue to operate and generate new parking data, the database should be updated regularly to reflect the latest loading and unloading behaviors and patterns.

[0111] In this embodiment, the geographic distance is calculated using the haversine formula to ensure the accuracy of the distance between parking points and take into account the influence of the earth's curvature. By processing geographic data through a clustering algorithm, parking point groups with similar characteristics can be identified, providing algorithm support for the identification of loading and unloading points. The minimum number of points and neighborhood radius are dynamically obtained, making the clustering process more consistent with the actual data distribution and improving the accuracy of the clustering results.

[0112] In an exemplary embodiment, after acquiring the newly added parking data, the method further includes:

[0113] According to the newly added parking data, obtain the second parking time of the vehicle at the newly added parking spot;

[0114] When the second parking time is less than the preset time, the relevant parking data of the corresponding newly added parking spot is deleted from the newly added parking data.

[0115] Specifically, in the newly added parking data, the second parking duration of the vehicle at each newly added parking spot is recorded. This refers to the duration of the vehicle's second parking at the parking spot. A duration threshold (for example, 30 minutes) is set, which is used to determine whether the parking event is long enough and may be related to loading and unloading activities. The setting of the threshold is based on an estimate of the time required for loading and unloading activities. If the second parking duration of the vehicle at a newly added parking spot is less than the preset duration threshold, this may mean that the parking spot is not used for loading and unloading, but is parked for other reasons (such as temporary parking, traffic delays, etc.). In this case, these records are deleted from the newly added parking data. By deleting records with insufficient parking duration, the accuracy of the data can be improved to ensure that the parking spots recorded in the database are more likely to be actual loading and unloading spots.

[0116] In this embodiment, removing short-term parking data helps reduce redundant information in the database, making data analysis more efficient and avoiding unnecessary computing and storage overhead. This reflects the dynamic management of newly added parking data, ensuring that the database can be updated in a timely manner while maintaining the relevance and practicality of the data.

[0117] In an exemplary embodiment, the newly added parking data is analyzed according to the comprehensive loading and unloading point database to obtain the loading and unloading point identification result, including:

[0118] When the second parking time is not less than the preset time, the second geographical distance between the newly added parking point and each loading and unloading point in the comprehensive loading and unloading point database is calculated by using the haversine formula;

[0119] When the second geographical distance is less than the preset distance threshold, the new parking spot is added as a loading and unloading spot.

[0120] Specifically, first, for the newly added parking data, check whether the second parking duration reaches or exceeds the preset duration threshold (e.g., 30 minutes). For parking spots that meet the second parking duration condition, use the semi-haver formula to calculate the geographical distance between them and the existing loading and unloading spots in the comprehensive loading and unloading spot database. This step is to evaluate the proximity of the newly added parking spots to the known loading and unloading spots. Set a geographical distance threshold (e.g., 1 km) to determine whether the newly added parking spots are close enough to the known loading and unloading spots, so that they may be regarded as the same loading and unloading spot. If the second geographical distance between the newly added parking spots and the known loading and unloading spots is less than the preset distance threshold, then the newly added parking spot can be considered as a loading and unloading spot. This means that the newly added parking spot is geographically close to the known loading and unloading spots and may belong to the same loading and unloading area. Once the newly added parking spot is confirmed as a loading and unloading spot, it will be added to the comprehensive loading and unloading spot database. This helps to update and expand the database to ensure that it contains the latest loading and unloading spot information.

[0121] In this embodiment, by combining the two conditions of duration and geographical distance, the loading and unloading points can be identified more accurately, reducing misjudgments and missed judgments.

[0122] In an exemplary embodiment, the above steps are repeated at intervals of n cycle months to iteratively update the comprehensive loading and unloading point database.

[0123] It should be understood that, although the various steps in the flowcharts involved in the above-mentioned embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above-mentioned embodiments can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0124] Based on the same inventive concept, the embodiment of the present application also provides a vehicle loading and unloading point identification device for implementing the vehicle loading and unloading point identification method involved above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations in one or more vehicle loading and unloading point identification device embodiments provided below can refer to the limitations of the vehicle loading and unloading point identification method above, and will not be repeated here.

[0125] In an exemplary embodiment, Figure 4As shown, a vehicle loading and unloading point identification device is provided, including: an acquisition module 402, used to acquire vehicle driving data and parking data of the Internet of Vehicles;

[0126] A database construction module 404 is used to construct a single vehicle loading and unloading point database based on vehicle driving data and parking data of the Internet of Vehicles;

[0127] The database construction module 404 is further used to obtain a comprehensive loading and unloading point database based on the single-vehicle loading and unloading point database of all vehicles in the vehicle network;

[0128] The acquisition module 402 is also used to acquire newly added parking data;

[0129] The identification module 406 is used to analyze the newly added parking data according to the comprehensive loading and unloading point database to obtain the loading and unloading point identification result.

[0130] In an exemplary embodiment, the processing module is used to obtain the vehicle's oil level change data based on the vehicle driving data of the Internet of Vehicles; determine the parking and refueling point based on the oil level change data; and simplify the parking data of the Internet of Vehicles based on the parking and refueling point.

[0131] In an exemplary embodiment, the processing module is also used to obtain the first parking time of the vehicle at a non-parking refueling point other than the parking refueling point based on the parking data of the vehicle network; when the first parking time is less than the preset time, the relevant parking data of the corresponding non-parking refueling point is deleted from the parking data of the vehicle network.

[0132] In an exemplary embodiment, the database construction module 404 is also used to calculate the first geographical distance between each parking point of a single vehicle based on the parking data of the Internet of Vehicles using the semi-vector formula; based on the first geographical distance between each parking point, a clustering algorithm is used to obtain the minimum number of points and the neighborhood radius; based on the minimum number of points and the neighborhood radius, the center point of each cluster point group is calculated; and based on the center point of each cluster point group, a single-vehicle loading and unloading point database is constructed.

[0133] In an exemplary embodiment, the processing module is also used to obtain a second parking time of the vehicle at a newly added parking spot based on the newly added parking data; when the second parking time is less than a preset time, the relevant parking data of the corresponding newly added parking spot is deleted from the newly added parking data.

[0134] In an exemplary embodiment, the identification module 406 is also used to calculate the second geographical distance between the newly added parking point and each loading and unloading point in the comprehensive loading and unloading point database using the semi-vector formula when the second parking time is not less than the preset time; when the second geographical distance is less than the preset distance threshold, the newly added parking point is a loading and unloading point.

[0135] Each module in the above-mentioned vehicle loading and unloading point identification device can be implemented in whole or in part by software, hardware or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute the operations corresponding to each module.

[0136] In an exemplary embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as shown in FIG. Figure 5 As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. Among them, the processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store vehicle driving data and parking data of the Internet of Vehicles. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a vehicle loading and unloading point identification method is implemented.

[0137] Those skilled in the art will understand that Figure 5 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0138] In an exemplary embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, the following steps are implemented:

[0139] Obtain vehicle driving data and parking data from the Internet of Vehicles;

[0140] Build a single-vehicle loading and unloading point database based on vehicle driving data and parking data from the Internet of Vehicles;

[0141] Obtain a comprehensive loading and unloading point database based on the single-vehicle loading and unloading point database of all vehicles in the Internet of Vehicles;

[0142] Get new parking data;

[0143] According to the comprehensive loading and unloading point database, the newly added parking data is analyzed to obtain the loading and unloading point identification results.

[0144] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0145] According to the vehicle driving data of the Internet of Vehicles, the vehicle's oil level change data is obtained;

[0146] Determine the parking and refueling point based on the oil level change data;

[0147] The parking data of the Internet of Vehicles is simplified according to the parking and refueling points.

[0148] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0149] According to the parking data of the Internet of Vehicles, the first parking time of the vehicle at a non-parking refueling point other than the parking refueling point is obtained;

[0150] When the first parking time is less than the preset time, the relevant parking data of the corresponding non-parking refueling point is deleted from the parking data of the Internet of Vehicles.

[0151] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0152] According to the parking data of the Internet of Vehicles, the first geographical distance between each parking point of a single vehicle is calculated using the haversine formula;

[0153] According to the first geographical distance between each parking point, a clustering algorithm is used to obtain the minimum number of points and the neighborhood radius;

[0154] Calculate the center point of each cluster point group based on the minimum number of points and neighborhood radius;

[0155] According to the center point of each cluster point group, a single vehicle loading and unloading point database will be constructed.

[0156] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0157] According to the newly added parking data, obtain the second parking time of the vehicle at the newly added parking spot;

[0158] When the second parking time is less than the preset time, the relevant parking data of the corresponding newly added parking spot is deleted from the newly added parking data.

[0159] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0160] When the second parking time is not less than the preset time, the second geographical distance between the newly added parking point and each loading and unloading point in the comprehensive loading and unloading point database is calculated by using the haversine formula;

[0161] When the second geographical distance is less than the preset distance threshold, the new parking spot is added as a loading and unloading spot.

[0162] In one embodiment, a computer readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:

[0163] Obtain vehicle driving data and parking data from the Internet of Vehicles;

[0164] Build a single-vehicle loading and unloading point database based on vehicle driving data and parking data from the Internet of Vehicles;

[0165] Obtain a comprehensive loading and unloading point database based on the single-vehicle loading and unloading point database of all vehicles in the Internet of Vehicles;

[0166] Get new parking data;

[0167] According to the comprehensive loading and unloading point database, the newly added parking data is analyzed to obtain the loading and unloading point identification results.

[0168] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0169] According to the vehicle driving data of the Internet of Vehicles, the vehicle's oil level change data is obtained;

[0170] Determine the parking and refueling point based on the oil level change data;

[0171] The parking data of the Internet of Vehicles is simplified according to the parking and refueling points.

[0172] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0173] According to the parking data of the Internet of Vehicles, the first parking time of the vehicle at a non-parking refueling point other than the parking refueling point is obtained;

[0174] When the first parking time is less than the preset time, the relevant parking data of the corresponding non-parking refueling point is deleted from the parking data of the Internet of Vehicles.

[0175] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0176] According to the parking data of the Internet of Vehicles, the first geographical distance between each parking point of a single vehicle is calculated using the haversine formula;

[0177] According to the first geographical distance between each parking point, a clustering algorithm is used to obtain the minimum number of points and the neighborhood radius;

[0178] Calculate the center point of each cluster point group based on the minimum number of points and neighborhood radius;

[0179] According to the center point of each cluster point group, a single vehicle loading and unloading point database will be constructed.

[0180] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0181] According to the newly added parking data, obtain the second parking time of the vehicle at the newly added parking spot;

[0182] When the second parking time is less than the preset time, the relevant parking data of the corresponding newly added parking spot is deleted from the newly added parking data.

[0183] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0184] When the second parking time is not less than the preset time, the second geographical distance between the newly added parking point and each loading and unloading point in the comprehensive loading and unloading point database is calculated by using the haversine formula;

[0185] When the second geographical distance is less than the preset distance threshold, the new parking spot is added as a loading and unloading spot.

[0186] In one embodiment, a computer program product is provided, comprising a computer program, which, when executed by a processor, implements the following steps:

[0187] Obtain vehicle driving data and parking data from the Internet of Vehicles;

[0188] Build a single-vehicle loading and unloading point database based on vehicle driving data and parking data from the Internet of Vehicles;

[0189] Obtain a comprehensive loading and unloading point database based on the single-vehicle loading and unloading point database of all vehicles in the Internet of Vehicles;

[0190] Get new parking data;

[0191] According to the comprehensive loading and unloading point database, the newly added parking data is analyzed to obtain the loading and unloading point identification results.

[0192] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0193] According to the vehicle driving data of the Internet of Vehicles, the vehicle's oil level change data is obtained;

[0194] Determine the parking and refueling point based on the oil level change data;

[0195] The parking data of the Internet of Vehicles is simplified according to the parking and refueling points.

[0196] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0197] According to the parking data of the Internet of Vehicles, the first parking time of the vehicle at a non-parking refueling point other than the parking refueling point is obtained;

[0198] When the first parking time is less than the preset time, the relevant parking data of the corresponding non-parking refueling point is deleted from the parking data of the Internet of Vehicles.

[0199] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0200] According to the parking data of the Internet of Vehicles, the first geographical distance between each parking point of a single vehicle is calculated using the haversine formula;

[0201] According to the first geographical distance between each parking point, a clustering algorithm is used to obtain the minimum number of points and the neighborhood radius;

[0202] Calculate the center point of each cluster point group based on the minimum number of points and neighborhood radius;

[0203] According to the center point of each cluster point group, a single vehicle loading and unloading point database will be constructed.

[0204] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0205] According to the newly added parking data, obtain the second parking time of the vehicle at the newly added parking spot;

[0206] When the second parking time is less than the preset time, the relevant parking data of the corresponding newly added parking spot is deleted from the newly added parking data.

[0207] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0208] When the second parking time is not less than the preset time, the second geographical distance between the newly added parking point and each loading and unloading point in the comprehensive loading and unloading point database is calculated by using the haversine formula;

[0209] When the second geographical distance is less than the preset distance threshold, the new parking spot is added as a loading and unloading spot.

[0210] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant regulations.

[0211] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.

[0212] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0213] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A method for identifying a vehicle loading and unloading point, characterized in that: The method comprises: Obtain vehicle driving data and parking data from the Internet of Vehicles; Building a single vehicle loading and unloading point database based on vehicle driving data and parking data of the Internet of Vehicles; Obtaining a comprehensive loading and unloading point database based on the single-vehicle loading and unloading point database of all vehicles in the vehicle network; Get new parking data; The newly added parking data is analyzed according to the comprehensive loading and unloading point database to obtain a loading and unloading point identification result.

2. The method according to claim 1, characterized in that: Before constructing a single vehicle loading and unloading point database based on the vehicle driving data and parking data of the vehicle network, the method further includes: Acquiring vehicle oil level change data based on vehicle driving data of the connected vehicle network; Determining a stop and refueling point based on the oil level change data; The parking data of the Internet of Vehicles is simplified according to the parking and refueling point.

3. The method according to claim 2, characterized in that The simplified processing of the parking data of the Internet of Vehicles according to the parking and refueling point includes: According to the parking data of the Internet of Vehicles, obtaining a first parking time of the vehicle at a non-parking refueling point other than the parking refueling point; When the first parking time is less than a preset time, the relevant parking data of the corresponding non-parking refueling point is deleted from the parking data of the connected vehicle network.

4. The method according to claim 1, characterized in that: The step of constructing a single vehicle loading and unloading point database based on the vehicle driving data and parking data of the vehicle network includes: Calculating a first geographical distance between parking spots of a single vehicle using a haversine formula according to the parking data of the Internet of Vehicles; According to the first geographical distance between the parking points, a clustering algorithm is used to obtain a minimum number of points and a neighborhood radius; Calculate the center point of each cluster point group according to the minimum number of points and the neighborhood radius; According to the center point of each cluster point group, a single vehicle loading and unloading point database will be constructed.

5. The method according to claim 1, characterized in that After acquiring the newly added parking data, the method further includes: According to the newly added parking data, obtaining a second parking time of the vehicle at the newly added parking spot; When the second parking time is less than a preset time, the relevant parking data of the corresponding newly added parking spot is deleted from the newly added parking data.

6. The method according to claim 5, characterized in that The step of analyzing the newly added parking data according to the comprehensive loading and unloading point database to obtain a loading and unloading point identification result includes: When the second parking time is not less than the preset time, using the haversine formula, calculating the second geographical distance between the newly added parking point and each loading and unloading point in the comprehensive loading and unloading point database; When the second geographical distance is less than a preset distance threshold, the newly added parking point is a loading and unloading point.

7. A vehicle loading and unloading point identification device, characterized in that: The device comprises: An acquisition module, used to acquire vehicle driving data and parking data of the Internet of Vehicles; A database construction module, used to construct a single vehicle loading and unloading point database based on vehicle driving data and parking data of the Internet of Vehicles; The database construction module is further used to obtain a comprehensive loading and unloading point database based on the single-vehicle loading and unloading point database of all vehicles in the vehicle network; The acquisition module is also used to obtain newly added parking data; The identification module is used to analyze the newly added parking data according to the comprehensive loading and unloading point database to obtain a loading and unloading point identification result.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.